On the public citation graph
Dependency-Aware Compilation for Surface Code Quantum Architectures
0 signed · 76 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/11527695_1openalex-snapshot
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables
inferredcites →https://doi.org/10.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/11671541_4openalex-snapshot
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
inferredcites →https://doi.org/10.1007/978-3-319-94144-8_26openalex-snapshot
PySAT: A Python Toolkit for Prototyping with SAT Oracles
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_8openalex-snapshot
Efficient CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
inferredcites →https://doi.org/10.1016/b978-0-12-815412-0.00019-xopenalex-snapshot
Register Allocation
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.1038/s41586-023-06927-3openalex-snapshot
Logical quantum processor based on reconfigurable atom arrays
inferredcites →https://doi.org/10.1038/s41586-024-08449-yopenalex-snapshot
Quantum error correction below the surface code threshold
inferredcites →https://doi.org/10.1088/1367-2630openalex-snapshot
Elementary Excitations in Fractional Quantum Hall Effect from Classical Constraints
inferredcites →https://doi.org/10.1098/rspa.1998.0166openalex-snapshot
Resilient quantum computation: error models and thresholds
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/physrevlett.129.030501openalex-snapshot
Realization of an Error-Correcting Surface Code with Superconducting Qubits
inferredcites →https://doi.org/10.1103/physrevx.11.041058openalex-snapshot
Realization of Real-Time Fault-Tolerant Quantum Error Correction
inferredcites →https://doi.org/10.1103/prxquantum.3.020342openalex-snapshot
Surface Code Compilation via Edge-Disjoint Paths
inferredcites →https://doi.org/10.1109/cgo57630.2024.10444874openalex-snapshot
Ecmas: Efficient Circuit Mapping and Scheduling for Surface Code
inferredcites →https://doi.org/10.1109/dac56929.2023.10247760openalex-snapshot
Scalable Optimal Layout Synthesis for NISQ Quantum Processors
inferredcites →https://doi.org/10.1109/isca59077.2024.00032openalex-snapshot
A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
inferredcites →https://doi.org/10.1109/ismvl.2008.43openalex-snapshot
RevLib: An Online Resource for Reversible Functions and Reversible Circuits
inferredcites →https://doi.org/10.1109/micro56248.2022.00077openalex-snapshot
Qubit Mapping and Routing via MaxSAT
inferredcites →https://doi.org/10.1109/micro56248.2022.00078openalex-snapshot
Scaling Superconducting Quantum Computers with Chiplet Architectures
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/sfcs.2005.41openalex-snapshot
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
inferredcites →https://doi.org/10.1109/tcad.2018.2846658openalex-snapshot
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/s0097539796312733openalex-snapshot
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
inferredcites →https://doi.org/10.1145/195058.195119openalex-snapshot
Efficient routing in all-optical networks
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/2897518.2897538openalex-snapshot
Improved approximation for node-disjoint paths in planar graphs
inferredcites →https://doi.org/10.1145/3123939.3123949openalex-snapshot
Optimized surface code communication in superconducting quantum computers
inferredcites →https://doi.org/10.1145/330249.330250openalex-snapshot
Linear scan register allocation
inferredcites →https://doi.org/10.1145/3316781.3317859openalex-snapshot
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
inferredcites →https://doi.org/10.1145/3360546openalex-snapshot
Qubit allocation as a combination of subgraph isomorphism and token swapping
inferredcites →https://doi.org/10.1145/3400302.3415620openalex-snapshot
Optimal layout synthesis for quantum computing
inferredcites →https://doi.org/10.1145/3466752.3480072openalex-snapshot
AutoBraid: A Framework for Enabling Efficient Surface Code Communication in Quantum Computing
inferredcites →https://doi.org/10.1145/3613424.3614300openalex-snapshot
HetArch: Heterogeneous Microarchitectures for Superconducting Quantum Systems
inferredcites →https://doi.org/10.1145/3620665.3640362openalex-snapshot
Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
inferredcites →https://doi.org/10.1145/3720416openalex-snapshot
Dependency-Aware Compilation for Surface Code Quantum Architectures
inferredcites →https://doi.org/10.1145/872726.806984openalex-snapshot
Register allocation & spilling via graph coloring
inferredcites →https://doi.org/10.17169/refubium-4067openalex-snapshot
A game of surface codes: Large-scale quantum computing with lattice surgery
inferredcites →https://doi.org/10.17169/refubium-70openalex-snapshot
Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
inferredcites →https://doi.org/10.21231/gnt1-hw21openalex-snapshot
Center for High Throughput Computing
inferredcites →https://doi.org/10.22331/q-2018-05-04-62openalex-snapshot
Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
inferredcites →https://doi.org/10.22331/q-2019-03-05-128openalex-snapshot
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
inferredcites →https://doi.org/10.22331/q-2024-05-22-1354openalex-snapshot
A High Performance Compiler for Very Large Scale Surface Code Computations
inferredcites →https://doi.org/10.4230/lipics.approx-random.2015.187openalex-snapshot
On Approximating Node-Disjoint Paths in Grids
inferredcites →https://doi.org/10.4230/lipics.sat.2024.26openalex-snapshot
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
inferredcites →https://doi.org/10.4230/lipics.sat.2024.29openalex-snapshot
Challenges and Opportunities in Quantum Optimization
inferredcites →https://doi.org/10.4230/lipics.tqc.2019.5openalex-snapshot
On the Qubit Routing Problem
inferredcites →https://doi.org/10.4230/lipics.tqc.2024.1openalex-snapshot
Multi-qubit Lattice Surgery Scheduling
inferredcites →https://doi.org/10.48550/arxiv.1411.4028openalex-snapshot
A Quantum Approximate Optimization Algorithm
inferredcites →https://doi.org/10.48550/arxiv.1808.06709openalex-snapshot
Low overhead quantum computation using lattice surgery
inferredcites →https://doi.org/10.48550/arxiv.2003.02055openalex-snapshot
Thermodynamics of a Quantum Annealer
inferredcites →https://doi.org/10.48550/arxiv.2211.07629openalex-snapshot
Assessing requirements to scale to practical quantum advantage
inferredcites →https://doi.org/10.48550/arxiv.2404.02280openalex-snapshot
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
inferredcites →https://doi.org/10.48550/arxiv.2409.04628openalex-snapshot
Demonstration of quantum computation and error correction with a tesseract code
inferredcites →https://doi.org/10.5281/zenodo.14934044openalex-snapshot
Artifact for "Dependency-Aware Compilation for Surface Code Quantum Architectures" (DASCOT)
inferredcites →https://doi.org/10.5555/313651.313820openalex-snapshot
Improved bounds for all optical routing
inferredcites →https://doi.org/10.5555/314464.314579openalex-snapshot
Efficient routing and scheduling algorithms for optical networks
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-981-95-7829-0_13openalex-snapshot
Building Hybrid Quantum–Classical Computing Ecosystems: A Survey
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11394841openalex-snapshot
Dependence-Driven, Scalable Quantum Circuit Mapping with Affine Abstractions
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395205openalex-snapshot
Space-Time Optimisations for Early Fault-Tolerant Quantum Computation
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408545openalex-snapshot
TraceQ: Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface-Code Fault-Tolerant Quantum Computing
inferred← citeshttps://doi.org/10.1109/isca66397.2026.00069openalex-snapshot
Triage: An Adaptive Parallel Window Decoding Scheduler for Real-Time Fault-Tolerant Quantum Computation
inferred← citeshttps://doi.org/10.1109/isca66397.2026.00149openalex-snapshot
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00061openalex-snapshot
Lattice Surgery Compilation Beyond the Surface Code
inferred← citeshttps://doi.org/10.1109/qce65121.2025.10422openalex-snapshot
Remote Operation-Aware Logical Qubit Allocation in Fault Tolerant Distributed Quantum Computing
inferred← citeshttps://doi.org/10.1145/3776720openalex-snapshot
Generating Compilers for Qubit Mapping and Routing
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539371openalex-snapshot
Ultra-Low Logical Depth Fault-Tolerant Quantum Circuit Synthesis via Lattice Surgery
showing the first 10 of 11 · page through all 11
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.