title: Solving search problems by strongly simulating quantum circuits.
abstract: Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several efficient strong simulation techniques are known for restricted families of quantum circuits and we develop an additional technique in this article. Further, we show that strong simulation algorithms perform another fundamental task: solving search problems. Efficient strong simulation techniques allow solutions to a class of search problems to be counted and found efficiently. This enhances the utility of strong simulation methods, known or yet to be discovered, and extends the class of search problems known to be efficiently simulable. Relating strong simulation to search problems also bounds the computational power of efficiently strongly simulable circuits; if they could solve all problems in P this would imply that all problems in NP and #P could be solved in polynomial time.
authors: Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Kingdom. t.johnson1@physics.ox.ac.uk
authors: T H
authors: TH
authors: Johnson
authors: J D
authors: JD
authors: Biamonte
authors: S R
authors: SR
authors: Clark
authors: D
authors: D
authors: Jaksch
references: Phys Rev Lett. 2003 Oct 3;91(14):147902
references: 14611555
references: Phys Rev Lett. 2006 May 5;96(17):170503
references: 16712283
references: Phys Rev E Stat Nonlin Soft Matter Phys. 2010 Sep;82(3 Pt 2):036702
references: 21230208