On the public citation graph

Step-by-step magic state encoding for efficient fault-tolerant quantum computation

0 signed · 31 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/s11128-005-7654-8openalex-snapshot
Quantum Universality from Magic States Distillation Applied to CSS Codes
inferredcites →https://doi.org/10.1038/nature03350openalex-snapshot
Quantum computing with realistically noisy devices
inferredcites →https://doi.org/10.1038/srep01939openalex-snapshot
Surface code implementation of block code state distillation
inferredcites →https://doi.org/10.1038/srep02044openalex-snapshot
Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation
inferredcites →https://doi.org/10.1103/physreva.70.052328openalex-snapshot
Improved simulation of stabilizer circuits
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.74.052333openalex-snapshot
Optimal and efficient decoding of concatenated quantum block codes
inferredcites →https://doi.org/10.1103/physreva.83.020302openalex-snapshot
Surface code quantum computing with error rates over 1%
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.86.052329openalex-snapshot
Magic-state distillation with low overhead
inferredcites →https://doi.org/10.1103/physreva.87.042305openalex-snapshot
Multilevel distillation of magic states for quantum computing
inferredcites →https://doi.org/10.1103/physreva.89.022322openalex-snapshot
Soft-decision decoder for quantum erasure and probabilistic-gate error models
inferredcites →https://doi.org/10.1103/physrevlett.111.090505openalex-snapshot
Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction
inferredcites →https://doi.org/10.1103/physrevlett.112.010505openalex-snapshot
Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates
inferredcites →https://doi.org/10.1103/physrevlett.98.190504openalex-snapshot
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
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.26421/qic13.3-4-2openalex-snapshot
Magic-state distillation with the four-qubit code

What points at this work

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

inferred← citeshttps://doi.org/10.1038/s41534-025-01035-8openalex-snapshot
Concatenate codes, save qubits
inferred← citeshttps://doi.org/10.1038/s41598-019-39439-0openalex-snapshot
Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture
inferred← citeshttps://doi.org/10.1038/srep19578openalex-snapshot
Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code
inferred← citeshttps://doi.org/10.1088/1751-8121/aaad13openalex-snapshot
Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
inferred← citeshttps://doi.org/10.1088/2058-9565/ace6caopenalex-snapshot
Magic state distillation and cost analysis in fault-tolerant universal quantum computation
inferred← citeshttps://doi.org/10.1103/5q1v-ry3yopenalex-snapshot
Magic State Injection with Erasure Qubits
inferred← citeshttps://doi.org/10.1103/9kys-3whhopenalex-snapshot
Efficient Magic State Cultivation on R P 2
inferred← citeshttps://doi.org/10.1103/p8tw-6kq9openalex-snapshot
High Rate Magic State Cultivation on the Surface Code
inferred← citeshttps://doi.org/10.1103/physrevresearch.5.043137openalex-snapshot
Measurement-free fault-tolerant logical-zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array
inferred← citeshttps://doi.org/10.1103/physrevx.11.041058openalex-snapshot
Realization of Real-Time Fault-Tolerant Quantum Error Correction
inferred← citeshttps://doi.org/10.1109/icufn.2018.8436751openalex-snapshot
An Introduction to Fault-Tolerant Quantum Computation and its Overhead Reduction Schemes
inferred← citeshttps://doi.org/10.1126/sciadv.adp6388openalex-snapshot
High-performance fault-tolerant quantum computing with many-hypercube codes
inferred← citeshttps://doi.org/10.22331/q-2019-05-20-143openalex-snapshot
Fault-tolerant magic state preparation with flag qubits
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.