On the public citation graph
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
0 signed · 83 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-38616-9_2openalex-snapshot
Quantum Algorithms for the Subset-Sum Problem
inferredcites →https://doi.org/10.1016/j.tcs.2014.05.025openalex-snapshot
Quantum cryptography: Public key distribution and coin tossing
inferredcites →https://doi.org/10.1017/cbo9780511976667openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1017/s0960129504004256openalex-snapshot
Towards a quantum programming language
inferredcites →https://doi.org/10.1038/ncomms10138openalex-snapshot
Quantum algorithms for topological and geometric analysis of data
inferredcites →https://doi.org/10.1038/s41534-018-0072-4openalex-snapshot
Automated optimization of large quantum circuits with continuous parameters
inferredcites →https://doi.org/10.1038/s41586-022-05434-1openalex-snapshot
Suppressing quantum errors by scaling a surface code logical qubit
inferredcites →https://doi.org/10.1073/pnas.1619152114openalex-snapshot
Elucidating reaction mechanisms on quantum computers
inferredcites →https://doi.org/10.1073/pnas.1801723115openalex-snapshot
Toward the first quantum simulation with quantum speedup
inferredcites →https://doi.org/10.1088/2058-9565/ab8963openalex-snapshot
Lower bounds on the non-Clifford resources for quantum computations
inferredcites →https://doi.org/10.1088/2058-9565/ab8e92openalex-snapshot
t|ket⟩: a retargetable compiler for NISQ devices
inferredcites →https://doi.org/10.1088/2058-9565/abae7dopenalex-snapshot
The bitter truth about gate-based quantum algorithms in the NISQ era
inferredcites →https://doi.org/10.1090/conm/305/05215openalex-snapshot
Quantum amplitude amplification and estimation
inferredcites →https://doi.org/10.1103/physicsphysiquefizika.1.195openalex-snapshot
On the Einstein Podolsky Rosen paradox
inferredcites →https://doi.org/10.1103/physreva.100.032328openalex-snapshot
Validating quantum computers using randomized model circuits
inferredcites →https://doi.org/10.1103/physreva.52.3457openalex-snapshot
Elementary gates for quantum computation
inferredcites →https://doi.org/10.1103/physreva.57.127openalex-snapshot
Theory of fault-tolerant quantum computation
inferredcites →https://doi.org/10.1103/physreva.71.022316openalex-snapshot
Universal quantum computation with ideal Clifford gates and noisy ancillas
inferredcites →https://doi.org/10.1103/physreva.86.032324openalex-snapshot
Surface codes: Towards practical large-scale quantum computation
inferredcites →https://doi.org/10.1103/physreva.87.042302openalex-snapshot
Quantum circuits of T -depth one
inferredcites →https://doi.org/10.1103/physreva.93.022311openalex-snapshot
Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization
inferredcites →https://doi.org/10.1103/physreva.98.022321openalex-snapshot
Quantum computational finance: Monte Carlo pricing of financial derivatives
inferredcites →https://doi.org/10.1103/physrevlett.102.110502openalex-snapshot
Restrictions on Transversal Encoded Quantum Gate Sets
inferredcites →https://doi.org/10.1103/physrevlett.117.210505openalex-snapshot
Demonstration of Weight-Four Parity Measurements in the Surface Code Architecture
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.1103/physrevlett.79.2586openalex-snapshot
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
inferredcites →https://doi.org/10.1103/physrevx.8.021047openalex-snapshot
Disjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates
inferredcites →https://doi.org/10.1103/physrevx.8.041015openalex-snapshot
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
inferredcites →https://doi.org/10.1103/prxquantum.1.020312openalex-snapshot
Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
inferredcites →https://doi.org/10.1103/prxquantum.2.010103openalex-snapshot
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
inferredcites →https://doi.org/10.1103/prxquantum.2.030305openalex-snapshot
Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
inferredcites →https://doi.org/10.1109/focs.2004.54openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1109/iccd.2013.6657074openalex-snapshot
QuRE: The Quantum Resource Estimator toolbox
inferredcites →https://doi.org/10.1109/lics.2005.1openalex-snapshot
A Functional Quantum Programming Language
inferredcites →https://doi.org/10.1109/tcad.2005.847911openalex-snapshot
Toffoli network synthesis with templates
inferredcites →https://doi.org/10.1109/tcad.2014.2341953openalex-snapshot
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
inferredcites →https://doi.org/10.1109/tit.2011.2161917openalex-snapshot
Transversality Versus Universality for Additive Quantum Codes
inferredcites →https://doi.org/10.1137/080712167openalex-snapshot
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
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/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
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/3434318openalex-snapshot
A verified optimizer for 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/3519939.3523433openalex-snapshot
Quartz: superoptimization of Quantum circuits
inferredcites →https://doi.org/10.1145/3531130.3533327openalex-snapshot
Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
inferredcites →https://doi.org/10.1145/3531130.3533332openalex-snapshot
Quantum Expectation Transformers for Cost Analysis
inferredcites →https://doi.org/10.1145/3563297openalex-snapshot
Tower: data structures in Quantum superposition
inferredcites →https://doi.org/10.1145/3569966.3570114openalex-snapshot
Silq2Qiskit - Developing a quantum language source-to-source translator
inferredcites →https://doi.org/10.1145/3571225openalex-snapshot
Qunity: A Unified Language for Quantum and Classical Computing
inferredcites →https://doi.org/10.1145/3571725openalex-snapshot
Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage
inferredcites →https://doi.org/10.1145/3591254openalex-snapshot
Synthesizing Quantum-Circuit Optimizers
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.22331/q-2018-01-31-49openalex-snapshot
ProjectQ: an open source software framework for quantum computing
inferredcites →https://doi.org/10.22331/q-2019-04-30-135openalex-snapshot
Efficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
inferredcites →https://doi.org/10.22331/q-2021-04-15-433openalex-snapshot
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
inferredcites →https://doi.org/10.22331/q-2021-11-16-580openalex-snapshot
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
inferredcites →https://doi.org/10.22331/q-2024-06-17-1375openalex-snapshot
Trading T gates for dirty qubits in state preparation and unitary synthesis
inferredcites →https://doi.org/10.26421/qic16.13-14-2openalex-snapshot
Optimal and asymptotically optimal NCT reversible circuits by the gate types
inferredcites →https://doi.org/10.26421/qic18.11-12-3openalex-snapshot
Limitations on transversal computation through quantum homomorphic encryption
inferredcites →https://doi.org/10.26421/qic3.1-7openalex-snapshot
Both Toffoli and Controlled-NOT need little help to universal quantum computing
inferredcites →https://doi.org/10.26421/qic3.4-3openalex-snapshot
Shor's discrete logarithm quantum algorithm for elliptic curves
inferredcites →https://doi.org/10.4204/eptcs.318.14openalex-snapshot
PyZX: Large Scale Automated Diagrammatic Reasoning
inferredcites →https://doi.org/10.4230/lipics.ccc.2020.16openalex-snapshot
A Framework of Quantum Strong Exponential-Time Hypotheses
inferredcites →https://doi.org/10.48550/arxiv.1209.4379openalex-snapshot
Defining Quantum Control Flow
inferredcites →https://doi.org/10.48550/arxiv.1801.01081openalex-snapshot
High Performance Quantum Modular Multipliers
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0703015openalex-snapshot
Every NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer
inferredcites →https://doi.org/10.5281/zenodo.10729069openalex-snapshot
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
inferredcites →https://doi.org/10.5281/zenodo.2573505openalex-snapshot
Qiskit/qiskit-metapackage: Qiskit 0.43.0
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.cjph.2025.09.014openalex-snapshot
Quantum scheme for private set intersection and union cardinality based on quantum homomorphic encryption
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408609openalex-snapshot
CLINE: Improving Control Flow Compilation of Quantum Programs with Control Line Encoding
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00257openalex-snapshot
On the Potential of Quantum Computing in Classical Program Analysis
inferred← citeshttps://doi.org/10.1145/3669940.3707240openalex-snapshot
Optimizing Quantum Circuits, Fast and Slow
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/3758316.3762820openalex-snapshot
How to Synthesize Quantum-Circuit Optimizers
inferred← citeshttps://doi.org/10.1145/3763056openalex-snapshot
Compositional Quantum Control Flow with Efficient Compilation in Qunity
inferred← citeshttps://doi.org/10.1145/3763153openalex-snapshot
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
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.