5 papers · 1 filter
Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time
William Gay, Fernando Granha Jeronimo, Abhi Shukul
In classical coding theory, the quest for explicit codes achieving list decoding capacity has been an important driving force. While random codes are easily shown to achieve capaci…
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
We construct explicit families of asymptotically good quantum locally testable codes over qubits. More precseily, we construct explicit quantum LDPC CSS codes over qubits having co…
PureSuperQMA(exp) = BellPureSymQMA(poly) = QMA via Dimension-Free Bosonic Argmax
William Gay, Fernando Granha Jeronimo, Lenny Liu +3
Pure-state consistency problems naturally lead to quantum proof systems in which a single pure witness must satisfy many acceptance constraints. The corresponding class $\mathsf{Pu…
The Honeycomb Framework for Code Bounds
William Gay, Fernando Granha Jeronimo, Lenny Liu
We introduce the honeycomb hierarchy, a representation-theoretic framework that gives new asymptotic upper bounds on . Its first level is the two-row hyperoctahedral repres…
The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
William Gay, Fernando Granha Jeronimo
Interference and entanglement are among the most fundamental properties of quantum mechanics. In this work, we investigate the power of interference in the role of detecting entang…