Journal article icon

Journal article

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. Effici...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's Version

Actions


Access Document


Files:
Publisher copy:
10.1038/srep01235

Authors


Johnson, TH More by this author
Biamonte, JD More by this author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Physics
Subgroup:
Atomic and Laser Physics
Publisher:
Springer Nature Publisher's website
Journal:
Scientific Reports Journal website
Volume:
3
Pages:
Article: 1235
Publication date:
2013-02-06
Acceptance date:
2013-01-16
DOI:
EISSN:
2045-2322
URN:
uuid:6b62a702-0b94-4e9c-8228-cea711ec1577
Source identifiers:
352671
Local pid:
pubs:352671
Language:
English
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP