On the public citation graph
Synthetiq: Fast and Versatile Quantum Circuit Synthesis
0 signed · 61 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.1002/spe.3039openalex-snapshot
Quantum computing: A taxonomy, systematic review and future directions
inferredcites →https://doi.org/10.1007/978-3-319-59936-6_7openalex-snapshot
REVS: A Tool for Space-Optimized Reversible Circuit Synthesis
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.1007/s10676-017-9439-zopenalex-snapshot
The potential impact of quantum computers on society
inferredcites →https://doi.org/10.1007/s11128-020-02816-0openalex-snapshot
Advanced exact synthesis of Clifford+T circuits
inferredcites →https://doi.org/10.1016/j.mejo.2018.08.011openalex-snapshot
A template-based technique for efficient Clifford+T-based quantum circuit implementation
inferredcites →https://doi.org/10.1021/acs.chemrev.8b00803openalex-snapshot
Quantum Chemistry in the Age of Quantum Computing
inferredcites →https://doi.org/10.1038/s41534-022-00624-1openalex-snapshot
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
inferredcites →https://doi.org/10.1038/s41534-022-00651-yopenalex-snapshot
T-count and T-depth of any multi-qubit unitary
inferredcites →https://doi.org/10.1038/s41586-019-1666-5openalex-snapshot
Quantum supremacy using a programmable superconducting processor
inferredcites →https://doi.org/10.1038/s41598-018-33125-3openalex-snapshot
Quantum Artificial Life in an IBM Quantum Computer
inferredcites →https://doi.org/10.1038/s41598-021-85474-1openalex-snapshot
A divide-and-conquer algorithm for quantum state preparation
inferredcites →https://doi.org/10.1063/5.0082975openalex-snapshot
The future of quantum computing with superconducting qubits
inferredcites →https://doi.org/10.1088/1367-2630openalex-snapshot
Elementary Excitations in Fractional Quantum Hall Effect from Classical Constraints
inferredcites →https://doi.org/10.1103/physreva.83.032302openalex-snapshot
Quantum-state preparation with universal gate decompositions
inferredcites →https://doi.org/10.1103/physreva.87.032332openalex-snapshot
Exact synthesis of multiqubit Clifford+ T circuits
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.93.032318openalex-snapshot
Quantum circuits for isometries
inferredcites →https://doi.org/10.1103/physrevlett.103.150502openalex-snapshot
Quantum Algorithm for Linear Systems of Equations
inferredcites →https://doi.org/10.1103/revmodphys.87.307openalex-snapshot
Quantum error correction for quantum memories
inferredcites →https://doi.org/10.1109/ismvl.2019.00026openalex-snapshot
Reversible Pebble Games for Reducing Qubits in Hierarchical Quantum Circuit Synthesis
inferredcites →https://doi.org/10.1109/qce49297.2020.00036openalex-snapshot
Towards Optimal Topology Aware Quantum Circuit Synthesis
inferredcites →https://doi.org/10.1109/tc.2015.2409842openalex-snapshot
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
inferredcites →https://doi.org/10.1109/tcad.2013.2244643openalex-snapshot
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
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/237814openalex-snapshot
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/2980983.2908121openalex-snapshot
Stratified synthesis: automatically learning the x86-64 instruction set
inferredcites →https://doi.org/10.1145/3453483.3454040openalex-snapshot
Unqomp: synthesizing uncomputation in Quantum circuits
inferredcites →https://doi.org/10.1145/3520304.3533956openalex-snapshot
A novel quantum-inspired evolutionary computation-based quantum circuit synthesis for various universal gate libraries
inferredcites →https://doi.org/10.1145/3548693openalex-snapshot
LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
inferredcites →https://doi.org/10.1145/3586039openalex-snapshot
Modular Component-Based Quantum Circuit Synthesis
inferredcites →https://doi.org/10.1147/jrd.2011.2165678openalex-snapshot
Quantum computing: An IBM perspective
inferredcites →https://doi.org/10.22331/q-2019-05-13-140openalex-snapshot
Quantum-assisted quantum compiling
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.11-12-1openalex-snapshot
Optimal ancilla-free Clifford+T approximation of z-rotations
inferredcites →https://doi.org/10.4204/eptcs.287.17openalex-snapshot
ReQWIRE: Reasoning about Reversible Quantum Circuits
inferredcites →https://doi.org/10.4230/lipics.fscd.2026.12openalex-snapshot
Open Quantum Assembly Language
inferredcites →https://doi.org/10.48550/arxiv.1510.00377openalex-snapshot
Reversible circuit compilation with space constraints
inferredcites →https://doi.org/10.48550/arxiv.1912.02727openalex-snapshot
Heuristics for Quantum Compiling with a Continuous Gate Set
inferredcites →https://doi.org/10.48550/arxiv.2003.02055openalex-snapshot
Thermodynamics of a Quantum Annealer
inferredcites →https://doi.org/10.5281/zenodo.10777502openalex-snapshot
Synthetiq: Fast and Versatile Quantum Circuit Synthesis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-13855-2_14openalex-snapshot
EniQmA - Enabling Hybrid Quantum Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_19openalex-snapshot
Quokka#: Quantum Computing with #SAT
inferred← citeshttps://doi.org/10.1016/bs.adcom.2025.06.003openalex-snapshot
Basic circuits for quantum computation
inferred← citeshttps://doi.org/10.1109/qai63978.2025.00047openalex-snapshot
CNOT Minimal Circuit Synthesis: A Reinforcement Learning Approach
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00102openalex-snapshot
Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00062openalex-snapshot
Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis
inferred← citeshttps://doi.org/10.1109/qce65121.2025.10443openalex-snapshot
QSynViz: An Interactive Visualization Tool for Quantum Circuit Synthesis, Optimization, and Education
inferred← citeshttps://doi.org/10.1109/qsw62656.2024.00020openalex-snapshot
T-Count Optimizing Genetic Algorithm for Quantum State Preparation
inferred← citeshttps://doi.org/10.1145/3669940.3707240openalex-snapshot
Optimizing Quantum Circuits, Fast and Slow
inferred← citeshttps://doi.org/10.1145/3763132openalex-snapshot
AccelerQ: Accelerating Quantum Eigensolvers with Machine Learning on Quantum Simulators
inferred← citeshttps://doi.org/10.1145/3776720openalex-snapshot
Generating Compilers for Qubit Mapping and Routing
inferred← citeshttps://doi.org/10.1145/3786150.3788615openalex-snapshot
Learning State Separation for Quantum Circuit Synthesis
inferred← citeshttps://doi.org/10.22331/q-2025-10-20-1889openalex-snapshot
Quantum circuit synthesis with SQiSW
inferred← citeshttps://doi.org/10.22331/q-2026-08-19-2193openalex-snapshot
Quantum phase estimation with optimal confidence interval using three control qubits
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539289openalex-snapshot
Quantum Circuit Synthesis Based on LimTDD
inferred← citeshttps://doi.org/10.2478/qic-2025-0038openalex-snapshot
Realization of Deterministic Quantum Circuits for Non-Deterministic or Incompletely Specified Quantum State Machines
inferred← citeshttps://doi.org/10.4204/eptcs.426.8openalex-snapshot
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
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.