Quantum state restoration and single-copy tomography for ground states of Hamiltonians.

Given a single copy of an unknown quantum state, the no-cloning theorem limits the amount of information that can be extracted from it. Given a gapped Hamiltonian, in most situations it is impractical to compute properties of its ground state, even though in principle all the information about the ground state is encoded in the Hamiltonian. We show in this Letter that if you know the Hamiltonian of a system and have a single copy of its ground state, you can use a quantum computer to efficiently compute its local properties. Specifically, in this scenario, we give efficient algorithms that copy small subsystems of the state and estimate the full statistics of any local measurement.

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  Scott Aaronson,et al.  Quantum Copy-Protection and Quantum Money , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[3]  Isaac L. Chuang,et al.  Quantum Information And Computation , 1996 .

[4]  David Chaum,et al.  Advances in Cryptology: Proceedings Of Crypto 83 , 2012 .

[5]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[6]  W. Hoeffding Probability Inequalities for sums of Bounded Random Variables , 1963 .

[7]  Yong Zhang,et al.  Fast amplification of QMA , 2009, Quantum Inf. Comput..

[8]  F. Lemmermeyer Error-correcting Codes , 2005 .

[9]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[10]  Gilles Brassard,et al.  Quantum Cryptography, or Unforgeable Subway Tokens , 1982, CRYPTO.

[11]  D. Poulin,et al.  Preparing ground States of quantum many-body systems on a quantum computer. , 2008, Physical review letters.

[12]  Avinatan Hassidim,et al.  Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol , 2009, ICS.

[13]  M. Mosca,et al.  Quantum Coins , 2009, 0911.1295.