Homological product codes
From MaRDI portal
Publication:5259561
DOI10.1145/2591796.2591870zbMath1315.94143arXiv1311.0885OpenAlexW2048984244MaRDI QIDQ5259561
Sergey Bravyi, Matthew B. Hastings
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.0885
Related Items (9)
Quantum Locally Testable Codes ⋮ A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory ⋮ Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders ⋮ On tensor products of CSS codes ⋮ Building manifolds from quantum codes ⋮ Homological codes and abelian anyons ⋮ Quantum Codes from High-Dimensional Manifolds ⋮ A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less) ⋮ Spacetime replication of continuous variable quantum information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: Homological product codes
