An algorithm converts topological data of 2D bulk stabilizer codes into 1D boundary subsystem codes via operator algebra and normal forms, enabling automatic generation of boundaries and defects demonstrated on toric, color, and other codes.
hub
Shor (1995): Scheme for reducing decoherence in quantum computer memory
14 Pith papers cite this work. Polarity classification is still indexing.
14
Pith papers citing it
hub tools
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.
Sparse Mamba Decoder processes only active defects in surface code syndromes using a 13-feature representation and Mamba backbone for O(k) complexity, reporting speedups and accuracy gains over dense decoders.
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
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.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.
A conceptual proposal to implement finite-state classical logic machines by mapping Boolean operations onto the population and coherence dynamics of a two-level atomic system analyzed via the Liouville equation.
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
citing papers explorer
-
Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes
An algorithm converts topological data of 2D bulk stabilizer codes into 1D boundary subsystem codes via operator algebra and normal forms, enabling automatic generation of boundaries and defects demonstrated on toric, color, and other codes.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.