Quantum Locally Testable Codes

DOI10.1137/140975498zbMath1326.81054arXiv1310.5664OpenAlexW2120102043MaRDI QIDQ3449558

Lior Eldar, Dorit Aharonov

Publication date: 4 November 2015

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5664

zbMATH Keywords

quantum error correcting codeslocally testable codesstabilizer codesquantum PCP

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60) Error probability in coding theory (94B70) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Related Items (4)

A construction of combinatorial NLTS ⋮ Single-shot decoding of good quantum LDPC codes ⋮ Unnamed Item ⋮ Quantum Codes from High-Dimensional Manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Feasibility of self-correcting quantum memory and thermal stability of topological order
• A short proof of stability of topological order under local perturbations
• Fault-tolerant quantum computation by anyons
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Bounding the distance of quantum surface codes
• Thermodynamic stability criteria for a quantum memory based on stabilizer and subsystem codes
• Quantum Computation and Quantum Information
• Dense Locally Testable Codes Cannot Have Constant Rate and Distance
• Expander codes
• Proof verification and the hardness of approximation problems
• Property testing and its connection to learning and approximation
• Locally testable codes and PCPs of almost-linear length
• Testing Reed–Muller Codes
• Randomness conductors and constant-degree lossless expanders
• Short PCPs with Polylog Query Complexity
• Probabilistic checking of proofs
• A recursive approach to low complexity codes
• Quantum Reed-Muller codes
• Topological quantum memory
• Robust Characterizations of Polynomials with Applications to Program Testing
• Short Locally Testable Codes and Proofs: A Survey in Two Parts
• The detectability lemma and quantum gap amplification
• Topological quantum order: Stability under local perturbations
• Homological product codes
• Computational Complexity
• A Construction of Quantum LDPC Codes From Cayley Graphs
• Some optimal inapproximability results
• Product-state approximations to quantum ground states
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• The PCP theorem by gap amplification

This page was built for publication: Quantum Locally Testable Codes