The quantum violation of a noncontextuality inequality for intraparticle path-spin entanglement quantitatively matches the success probability enhancement in n-bit random access code protocols.
1997.Stabilizer codes and quantum error correc- tion
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
years
2026 5verdicts
UNVERDICTED 5roles
background 3polarities
background 3representative citing papers
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
Surface code logical qubits in continuous baths have a true thermodynamic error threshold only for short-range interactions, as their decoherence maps exactly to the anisotropic Kondo model.
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
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
-
Random Access Code protocols: Quantum advantage related to intraparticle entanglement-based contextuality
The quantum violation of a noncontextuality inequality for intraparticle path-spin entanglement quantitatively matches the success probability enhancement in n-bit random access code protocols.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Quantum Decoherence of the Surface Code: A Generalized Caldeira-Leggett Approach
Surface code logical qubits in continuous baths have a true thermodynamic error threshold only for short-range interactions, as their decoherence maps exactly to the anisotropic Kondo model.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
-
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.