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噪声
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 1
other 1
citation-polarity summary
fields
quant-ph 5verdicts
UNVERDICTED 5representative citing papers
Hermitian weighted graphs enable universal exact realization of arbitrary complex QL-bits as real-spectrum eigenstates, with discrete {0, ±1, ±i} couplings dense in the state space.
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.
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
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
-
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噪声
-
Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs
Hermitian weighted graphs enable universal exact realization of arbitrary complex QL-bits as real-spectrum eigenstates, with discrete {0, ±1, ±i} couplings dense in the state space.
-
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.
-
Geometric and Resource-Theoretic Characterisation of Non-Stabiliserness in Quantum Algorithms
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
-
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.