Commuting Local Hamiltonians on Expanders, Locally Testable Quantum codes, and the qPCP conjecture (original) (raw)
Related papers
The commuting local Hamiltonian on locally-expanding graphs is in NP
Quantum Locally Testable Codes
SIAM Journal on Computing, 2015
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2013
On the commuting local hamiltonian problem, and tight conditions on topological order
2011
On the Minimum Degree Up to Local Complementation: Bounds and Complexity
Lecture Notes in Computer Science, 2012
On the Complexity of Two Dimensional Commuting Local Hamiltonians
2018
Eprint Arxiv Quant Ph 0210077, 2002
The complexity of stoquastic local Hamiltonian problems
2006
Quantum commuting circuits and complexity of Ising partition functions
The complexity of quantum spin systems on a two-dimensional square lattice
2005
Quantum Hamiltonian complexity and the detectability lemma
2010
Approximate quantum error-correcting codes
Algorithmic Cluster Expansions for Quantum Problems
2024
International Journal of Quantum Information, 2004
Quantum Circuit Depth Lower Bounds For Homological Codes
arXiv: Quantum Physics, 2018
Complexity Limitations on Quantum Computation
Journal of Computer and System Sciences, 1999
Universality of entanglement and quantum-computation complexity
Physical Review A, 2004
A computational proof of locality in entanglement
Asymptotically good quantum codes
Physical Review A, 2001
Complexity and order in approximate quantum error-correcting codes
arXiv (Cornell University), 2023
Quantum error-correcting codes over mixed alphabets
Physical Review A, 2013
Algorithmic Complexity and Entanglement of Quantum States
Physical Review Letters, 2005
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
Algorithmica, 2008
The detectability lemma and quantum gap amplification
Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09, 2009
Separable operations, graph codes and the location of quantum information
2010
Singleton bounds for entanglement-assisted classical and quantum error correcting codes
2022
An Information-Theoretic Proof of the Constructive Commutative Quantum Lov\'asz Local Lemma
Optimal quantum error correcting codes from absolutely maximally entangled states
Journal of Physics A: Mathematical and Theoretical
Lower Bounds on Quantum Query and Learning Graph Complexities
2014
Unbounded-error quantum computation with small space bounds
Information and Computation/information and Control, 2011
Quantum-error-correcting codes using qudit graph states
Robert Griffiths, Vlad Gheorghiu
Physical Review A, 2008
Lower Bounds for Local Search by Quantum Arguments
Siam Journal on Computing, 2006
Distributed quantum computation over noisy channels
Physical Review A, 1999
Mathematical Programming, 2018