Title

Preparing Ground States Of Quantum Many-Body Systems On A Quantum Computer

Abstract

Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time N. Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficiently as it does for classical systems. © 2009 The American Physical Society.

Publication Date

3-30-2009

Publication Title

Physical Review Letters

Volume

102

Issue

13

Number of Pages

-

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1103/PhysRevLett.102.130503

Socpus ID

64849108025 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/64849108025

This document is currently not available here.

Share

COinS