A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
Restrictions on Transversal Encoded Quantum Gate Sets
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
abstract
Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.
citation-role summary
background 3
citation-polarity summary
years
2026 7roles
background 3polarities
background 3representative citing papers
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulations of magic-state cultivation over hundreds of billions of shots.
A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.
INJEQT reduces synthillation error by up to 22x, wall-clock time by 13x, and space-time cost by 7.2x in extractor FTQC architectures via auxiliary Rz synthesis and pre-fetching.
Two new heuristics reduce hardware-limited depth of commuting PPR groups by 10-20% on average (up to 50%) in QASMBench circuits compiled to PPRs.
Logical quantum kernels outperform physical ones when solving differential equations on a neutral-atom processor, with gains traced to noise error detection in the logical encoding.
citing papers explorer
-
In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes
A new in-situ scheme prepares logical magic states inside arbitrary CSS qLDPC codes using only syndrome-extraction ancillas, with simulations on the [[144,12,12]] BB code and [[225,9,4]] hypergraph-product code showing injection error rates around 10^{-3} or lower under depolarizing and asymmetric噪声
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulations of magic-state cultivation over hundreds of billions of shots.
-
Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes
A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.
-
INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures
INJEQT reduces synthillation error by up to 22x, wall-clock time by 13x, and space-time cost by 7.2x in extractor FTQC architectures via auxiliary Rz synthesis and pre-fetching.
-
Optimizing Parallel Execution of Commuting Pauli Product Rotations
Two new heuristics reduce hardware-limited depth of commuting PPR groups by 10-20% on average (up to 50%) in QASMBench circuits compiled to PPRs.
-
Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor
Logical quantum kernels outperform physical ones when solving differential equations on a neutral-atom processor, with gains traced to noise error detection in the logical encoding.
- Fortuity and Complexity in a Simple Quark Model