Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
A game of surface codes: Large-scale quantum computing with lattice surgery
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
quant-ph 7verdicts
UNVERDICTED 7roles
background 3polarities
background 3representative citing papers
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
qstack introduces callback wrapping in a quantum IR to allow compositional end-to-end compilation of fault-tolerant quantum programs including concatenated error-correcting codes without manual classical logic adaptation.
Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and factories by up to 30% versus deterministic optima.
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
PureMagic dynamically schedules magic state cultivation by repurposing ancilla patches for routing and cultivation in surface codes, reporting 40-150% efficiency gains and up to 15x improvement over DASCOT on 29 benchmarks.
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
Sudden death of entanglement, rebirth of magic
Under local amplitude damping the n-qubit GHZ family loses entanglement at damping strength γ_e but regains magic at γ_+ satisfying γ_e + γ_+ = 1 for every n, with the reborn magic residing in a fully separable state.
-
Parallel Logical Measurements via Quantum Code Surgery
A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.
-
qstack: Compositional End-to-End Compilation for Fault-Tolerant Quantum Programs
qstack introduces callback wrapping in a quantum IR to allow compositional end-to-end compilation of fault-tolerant quantum programs including concatenated error-correcting codes without manual classical logic adaptation.
-
Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation
Stochastic magic-state production in fault-tolerant quantum computing inflates execution time but reduces peak resource demand, allowing stochastic-aware factory allocation to cut space-time volume by up to 27% and factories by up to 30% versus deterministic optima.
-
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
-
PureMagic: A Dynamic Scheduler for Lattice Surgery
PureMagic dynamically schedules magic state cultivation by repurposing ancilla patches for routing and cultivation in surface codes, reporting 40-150% efficiency gains and up to 15x improvement over DASCOT on 29 benchmarks.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.