On the public citation graph

Modular Synthesis of Efficient Quantum Uncomputation

0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10003-2_104openalex-snapshot
Reversible Computing
inferredcites →https://doi.org/10.1007/3-540-57659-2_28openalex-snapshot
Construction of thinned gated single-assignment form
inferredcites →https://doi.org/10.1007/978-3-030-52482-1_9openalex-snapshot
A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_1openalex-snapshot
Verified Compilation of Space-Efficient Reversible Circuits
inferredcites →https://doi.org/10.1103/physrevlett.70.1895openalex-snapshot
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
inferredcites →https://doi.org/10.1109/lics.2005.1openalex-snapshot
A Functional Quantum Programming Language
inferredcites →https://doi.org/10.1109/mc.1982.1653939openalex-snapshot
Data Flow Program Graphs
inferredcites →https://doi.org/10.1137/0218053openalex-snapshot
Time/Space Trade-Offs for Reversible Computation
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/2103656.2103667openalex-snapshot
Information effects
inferredcites →https://doi.org/10.1145/2491956.2462177openalex-snapshot
Quipper
inferredcites →https://doi.org/10.1145/3009837.3009894openalex-snapshot
QWIRE: a core language for quantum circuits
inferredcites →https://doi.org/10.1145/3385412.3386007openalex-snapshot
Silq: a high-level quantum language with safe uncomputation and intuitive semantics
inferredcites →https://doi.org/10.1145/3453483.3454040openalex-snapshot
Unqomp: synthesizing uncomputation in Quantum circuits
inferredcites →https://doi.org/10.1145/3491247openalex-snapshot
QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization
inferredcites →https://doi.org/10.1145/3563297openalex-snapshot
Tower: data structures in Quantum superposition
inferredcites →https://doi.org/10.1145/3571225openalex-snapshot
Qunity: A Unified Language for Quantum and Classical Computing
inferredcites →https://doi.org/10.1145/73560.73561openalex-snapshot
Detecting equality of variables in programs
inferredcites →https://doi.org/10.1145/93548.93578openalex-snapshot
The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.4204/eptcs.287.17openalex-snapshot
ReQWIRE: Reasoning about Reversible Quantum Circuits
inferredcites →https://doi.org/10.48550/arxiv.2406.14227openalex-snapshot
Artifact for "Modular Synthesis of Efficient Quantum Uncomputation"
inferredcites →https://doi.org/10.5281/zenodo.2562110openalex-snapshot
Qiskit: An Open-source Framework for Quantum Computing
inferredcites →https://doi.org/10.5281/zenodo.5978363openalex-snapshot
QSSA: An SSA-based IR for Quantum Computing - Artifact

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← backgroundhttps://doi.org/10.5281/zenodo.14006272zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1145/3704842openalex-snapshot
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
inferred← citeshttps://doi.org/10.1145/3729253openalex-snapshot
Optimizing Ancilla-Based Quantum Circuits with SPARE
inferred← citeshttps://doi.org/10.1145/3729283openalex-snapshot
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
inferred← citeshttps://doi.org/10.1145/3763056openalex-snapshot
Compositional Quantum Control Flow with Efficient Compilation in Qunity
inferred← citeshttps://doi.org/10.1145/3779212.3790134openalex-snapshot
Borrowing Dirty Qubits in Quantum Programs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.