New Cosystolic Expanders from Tensors Imply Explicit Quantum LDPC Codes with $\Omega(\sqrt{n}\log^k n)$ Distance
Main Authors: | Kaufman, Tali, Tessler, Ran J. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Media Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/145911 |
Similar Items
-
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
by: First, Uriya A., et al.
Published: (2024) -
An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion
by: Fan, Rui, et al.
Published: (2008) -
No-Signaling Proofs with O(sqrt(log n)) Provers Is in PSPACE
by: Holden, Dhiraj, et al.
Published: (2022) -
E[subscript n]-Regularity Implies E[subscript n-1]-Regularity
by: Trigo Neri Tabuada, Goncalo Jo
Published: (2015) -
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
by: Asadpour, Arash, et al.
Published: (2011)