Homological product codes
From MaRDI portal
Abstract: Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum LDPC codes known to this date suffer from a poor distance scaling limited by the square-root of the code length. This is in a sharp contrast with the classical case where good families of LDPC codes are known that combine constant encoding rate and linear distance. Here we propose the first family of good quantum codes with low-weight stabilizers. The new codes have a constant encoding rate, linear distance, and stabilizers acting on at most qubits, where is the code length. For comparison, all previously known families of good quantum codes have stabilizers of linear weight. Our proof combines two techniques: randomized constructions of good quantum codes and the homological product operation from algebraic topology. We conjecture that similar methods can produce good stabilizer codes with stabilizer weight for any . Finally, we apply the homological product to construct new small codes with low-weight stabilizers.
Recommendations
- Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
- Homological stabilizer codes
- An application of Khovanov homology to quantum codes
- Bounding the distance of quantum surface codes
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Cites work
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(15)- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Homological codes and abelian anyons
- Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
- A dualization approach to the ground state subspace classification of abelian higher gauge symmetry models
- Homological stabilizer codes
- Cyclic mappings of product codes (Corresp.)
- A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory
- Building manifolds from quantum codes
- Spacetime replication of continuous variable quantum information
- Approximate low-weight check codes and circuit lower bounds for noisy ground states
- A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less)
- Quantum locally testable codes
- Quantum codes from high-dimensional manifolds
- On tensor products of CSS codes
- Single-shot decoding of good quantum LDPC codes
This page was built for publication: Homological product codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259561)
