Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.
Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
support 1representative citing papers
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
A microarchitecture-aware compiler for lattice surgery that exploits C-Phase commutativity to enable concurrent multi-target operations and dynamic event-driven scheduling, cutting execution time by up to 59.7 times versus standard baselines.
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
citing papers explorer
-
Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic
Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
A microarchitecture-aware compiler for lattice surgery that exploits C-Phase commutativity to enable concurrent multi-target operations and dynamic event-driven scheduling, cutting execution time by up to 59.7 times versus standard baselines.
-
Architecting Distributed Quantum Computers: Design Insights from Resource Estimation
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.