Proves the finite-length quantum Hamming bound for every nontrivial exact subspace code in local dimension q ≥ 3.
Perfect quantum error correcting code
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
citing papers explorer
-
The Quantum Hamming Bound in Arbitrary Local Dimension
Proves the finite-length quantum Hamming bound for every nontrivial exact subspace code in local dimension q ≥ 3.
-
Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
-
Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.