Towards local testability for quantum coding
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1796840 (Why is no real title available?)
- An application of Khovanov homology to quantum codes
- Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
- Approximate low-weight check codes and circuit lower bounds for noisy ground states
- Efficient decoding of random errors for quantum expander codes
- Fault-tolerant quantum computation by anyons
- Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- Local Hamiltonians whose ground states are hard to approximate
- Low-degree testing for quantum states, and a quantum entangled games PCP for QMA
- Product-state approximations to quantum ground states
- Quantum codes from high-dimensional manifolds
- Quantum expander codes
- Quantum locally testable codes
- Self-testing/correcting with applications to numerical problems
- Short locally testable codes and proofs: a survey in two parts
- Sparse quantum codes from quantum circuits
- The PCP theorem by gap amplification
- The filling problem in the cube
This page was built for publication: Towards local testability for quantum coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229354)
