Product-State Approximations to Quantum States
We show that for any many-body quantum state there exists an unentangled quantum state such that most of the two-body reduced density matrices are close to those of the original state. This is a statement about the monogamy of entanglement, which cannot be shared without limit in the same way as classical correlation. Our main application is to Hamiltonians that are sums of two-body terms. For such Hamiltonians we show that there exist product states with energy that is close to the ground-state energy whenever the interaction graph of the Hamiltonian has high degree. This proves the validity of mean-field theory and gives an explicitly bounded approximation error. If we allow states that are entangled within small clusters of systems but product across clusters then good approximations exist when the Hamiltonian satisfies one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state where the blocks in the partition have sublinear entanglement. Previously this was known only in the case of small expansion or in the regime where the entanglement was close to zero. Our approximations allow an extensive error in energy, which is the scale considered by the quantum PCP (probabilistically checkable proof) and NLTS (no low-energy trivial-state) conjectures. Thus our results put restrictions on the possible Hamiltonians that could be used for a possible proof of the qPCP or NLTS conjectures. By contrast the classical PCP constructions are often based on constraint graphs with high degree. Likewise we show that the parallel repetition that is possible with classical constraint satisfaction problems cannot also be possible for quantum Hamiltonians, unless qPCP is false. The main technical tool behind our results is a collection of new classical and quantum de Finetti theorems which do not make any symmetry assumptions on the underlying states.
KeywordsQuantum State Mutual Information Average Mutual Information Constraint Graph Conditional Mutual Information
Unable to display preview. Download preview PDF.
- 1.Aharonov, D., Arad, I., Landau, Z., Vazirani, U.: The detectability lemma and quantum gap amplification. In: STOC ’09, pp. 417–426 (2009). arXiv:0811.3412.
- 3.Aharonov, D., Eldar, L.: On the complexity of commuting local Hamiltonians, and tight conditions for topological order in such systems. In: FOCS ’11, pp. 334–343 (2011). arXiv:1102.0770
- 4.Aharonov, D., Eldar, L.: Commuting local Hamiltonians on expanders, locally testable quantum codes, and the qPCP conjecture (2013). arXiv:1301.3407
- 6.Arora, S.: How np got a new definition: a survey of probabilistically checkable proofs. In: Proceedings of the ICM, vol. 3, pp 637–648, Beijing (2002). arXiv:cs/0304038
- 9.Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. In: FOCS ’11 (2011). arXiv:1104.4680
- 11.Brandao, F.G., Harrow, A.W.: Quantum de Finetti theorems under local measurements with applications. In: Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC ’13, pp. 861–870 (2013). arXiv:1210.6367
- 19.Doherty, A.C., Wehner, S.: Convergence of SDP hierarchies for polynomial optimization on the hypersphere (2012). arXiv:1210.5048
- 24.Gharibian, S., Kempe, J., Regev, O.: Personal communication (2012)Google Scholar
- 25.Gottesman, D., Irani, S.: The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems. In: FOCS ’09, pp. 95–104 (2009). arXiv:0905.2419
- 26.Harrow, A.W.: The church of the symmetric subspace (2013). arXiv:1308.6595
- 35.Kitaev A.Y., Shen A.H., Vyalyi M.N.: Classical and quantum computation, volume 47 of Graduate Studies in Mathematics. AMS, Boston, MA (2002)Google Scholar
- 43.Raghavendra, P., Tan, N.: Approximating CSPs with global cardinality constraints using SDP hierarchies. In: SODA ’12, pp. 373–387 (2012). arXiv:1110.1064
- 47.Salavatipour, M.: Label cover, hardness of set cover (2011). http://webdocs.cs.ualberta.ca/~mreza/courses/Approx11/week12
- 53.Trevisan, L.: Inapproximability of combinatorial optimization problems, Texcnical Report TR04-065, electronic collgium on computational complexity, (2004). arXiv:cs/0409043