294 lines
13 KiB
BibTeX
294 lines
13 KiB
BibTeX
@book{Homer2001,
|
|
doi = {10.1007/978-1-4757-3544-4},
|
|
url = {https://doi.org/10.1007/978-1-4757-3544-4},
|
|
year = {2001},
|
|
publisher = {Springer New York},
|
|
author = {Steven Homer and Alan L. Selman},
|
|
title = {Computability and Complexity Theory}
|
|
}
|
|
|
|
@book{Nielsen2012,
|
|
doi = {10.1017/cbo9780511976667},
|
|
url = {https://doi.org/10.1017/cbo9780511976667},
|
|
year = {2012},
|
|
month = jun,
|
|
publisher = {Cambridge University Press},
|
|
author = {Michael A. Nielsen and Isaac L. Chuang},
|
|
title = {Quantum Computation and Quantum Information}
|
|
}
|
|
|
|
@book{arora2009computational,
|
|
title = {Computational Complexity: A Modern Approach},
|
|
author = {Arora, S. and Barak, B.},
|
|
isbn = {9780521424264},
|
|
lccn = {2009002789},
|
|
url = {https://books.google.pt/books?id=8Wjqvsoo48MC},
|
|
year = {2009},
|
|
publisher = {Cambridge University Press}
|
|
}
|
|
|
|
@inproceedings{Bernstein1993,
|
|
doi = {10.1145/167088.167097},
|
|
url = {https://doi.org/10.1145/167088.167097},
|
|
year = {1993},
|
|
publisher = {{ACM} Press},
|
|
author = {Ethan Bernstein and Umesh Vazirani},
|
|
title = {Quantum complexity theory},
|
|
booktitle = {Proceedings of the twenty-fifth annual {ACM} symposium on Theory of computing - {STOC} {\textquotesingle}93}
|
|
}
|
|
|
|
@inproceedings{Chen2017,
|
|
author = {Aaronson, Scott and Chen, Lijie},
|
|
title = {Complexity-Theoretic Foundations of Quantum Supremacy Experiments},
|
|
year = {2017},
|
|
isbn = {9783959770408},
|
|
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
|
|
address = {Dagstuhl, DEU},
|
|
abstract = {In the near future, there will likely be special-purpose quantum computers with 40--50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate "quantum supremacy": that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible.First, we study the hardness of sampling the output distribution of a random quantum circuit, along the lines of a recent proposal by the Quantum AI group at Google. We show that there's a natural average-case hardness assumption, which has nothing to do with sampling, yet implies that no polynomial-time classical algorithm can pass a statistical test that the quantum sampling procedure's outputs do pass. Compared to previous work -- for example, on BosonSampling and IQP -- the central advantage is that we can now talk directly about the observed outputs, rather than about the distribution being sampled.Second, in an attempt to refute our hardness assumption, we give a new algorithm, inspired by Savitch's Theorem, for simulating a general quantum circuit with n qubits and depth d in polynomial space and dO(n) time. We then discuss why this and other known algorithms fail to refute our assumption.Third, resolving an open problem of Aaronson and Arkhipov, we show that any strong quantum supremacy theorem -- of the form "if approximate quantum sampling is classically easy, then the polynomial hierarchy collapses"-- must be non-relativizing. This sharply contrasts with the situation for exact sampling.Fourth, refuting a conjecture by Aaronson and Ambainis, we show that there is a sampling task, namely Fourier Sampling, with a 1 versus linear separation between its quantum and classical query complexities.Fifth, in search of a "happy medium" between black-box and non-black-box arguments, we study quantum supremacy relative to oracles in P/poly. Previous work implies that, if one-way functions exist, then quantum supremacy is possible relative to such oracles. We show, conversely, that some computational assumption is needed: if SampBPP = SampBQP and NP ⊆ BPP, then quantum supremacy is impossible relative to oracles with small circuits.},
|
|
booktitle = {Proceedings of the 32nd Computational Complexity Conference},
|
|
articleno = {22},
|
|
numpages = {67},
|
|
keywords = {computational complexity, quantum supremacy, quantum computing},
|
|
location = {Riga, Latvia},
|
|
series = {CCC '17}
|
|
}
|
|
|
|
@inproceedings{Shor1994,
|
|
doi = {10.1109/sfcs.1994.365700},
|
|
url = {https://doi.org/10.1109/sfcs.1994.365700},
|
|
publisher = {{IEEE} Comput. Soc. Press},
|
|
author = {P.W. Shor},
|
|
title = {Algorithms for quantum computation: discrete logarithms and factoring},
|
|
booktitle = {Proceedings 35th Annual Symposium on Foundations of Computer Science},
|
|
year = {1994}
|
|
}
|
|
|
|
@unpublished{Kitaev1995,
|
|
title = {Quantum measurements and the Abelian Stabilizer Problem},
|
|
author = {Kitaev, A. Yu.},
|
|
year = {1995},
|
|
eprint = {9511026},
|
|
doi = {10.48550/ARXIV.QUANT-PH/9511026},
|
|
archiveprefix = {arXiv},
|
|
primaryclass = {quant-ph},
|
|
note = {Unpublished},
|
|
keywords = {Quantum Physics (quant-ph), FOS: Physical sciences, FOS: Physical sciences},
|
|
copyright = {Assumed arXiv.org perpetual, non-exclusive license to distribute this article for submissions made before January 2004}
|
|
}
|
|
|
|
@article{arute2019,
|
|
title = {Quantum supremacy using a programmable superconducting processor},
|
|
author = {Arute, Frank and Arya, Kunal and Babbush, Ryan and Bacon, Dave and Bardin, Joseph C and Barends, Rami and Biswas, Rupak and Boixo, Sergio and Brandao, Fernando GSL and Buell, David A and others},
|
|
journal = {Nature},
|
|
volume = {574},
|
|
number = {7779},
|
|
pages = {505--510},
|
|
year = {2019},
|
|
publisher = {Nature Publishing Group}
|
|
}
|
|
|
|
@article{Terhal2018,
|
|
doi = {10.1038/s41567-018-0131-y},
|
|
url = {https://doi.org/10.1038/s41567-018-0131-y},
|
|
year = {2018},
|
|
month = apr,
|
|
publisher = {Springer Science and Business Media {LLC}},
|
|
volume = {14},
|
|
number = {6},
|
|
pages = {530--531},
|
|
author = {Barbara M. Terhal},
|
|
title = {Quantum supremacy, here we come},
|
|
journal = {Nature Physics}
|
|
}
|
|
|
|
@inproceedings{Haner2017,
|
|
doi = {10.1145/3126908.3126947},
|
|
url = {https://doi.org/10.1145/3126908.3126947},
|
|
year = {2017},
|
|
month = nov,
|
|
publisher = {{ACM}},
|
|
author = {Thomas H\"{a}ner and Damian S. Steiger},
|
|
title = {0.5 petabyte simulation of a 45-qubit quantum circuit},
|
|
booktitle = {Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis}
|
|
}
|
|
|
|
@unpublished{Markov2018,
|
|
title = {Quantum Supremacy Is Both Closer and Farther than It Appears},
|
|
author = {Igor Markov and Aneeqa Fatima and Sergei Isakov and Sergio Boixo},
|
|
year = {2018},
|
|
eprint = {1807.10749},
|
|
archiveprefix = {arXiv},
|
|
primaryclass = {quant-ph},
|
|
note = {Unpublished}
|
|
}
|
|
|
|
@article{Bravyi2016,
|
|
doi = {10.1103/physrevlett.116.250501},
|
|
url = {https://doi.org/10.1103/physrevlett.116.250501},
|
|
year = {2016},
|
|
month = jun,
|
|
publisher = {American Physical Society ({APS})},
|
|
volume = {116},
|
|
number = {25},
|
|
author = {Sergey Bravyi and David Gosset},
|
|
title = {Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates},
|
|
journal = {Physical Review Letters}
|
|
}
|
|
|
|
@article{VandenNest2010,
|
|
doi = {10.26421/qic10.3-4-6},
|
|
url = {https://doi.org/10.26421/qic10.3-4-6},
|
|
year = {2010},
|
|
month = mar,
|
|
publisher = {Rinton Press},
|
|
volume = {10},
|
|
number = {3{\&}4},
|
|
pages = {258--271},
|
|
author = {M. Van den Nest},
|
|
title = {Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond},
|
|
journal = {Quantum Information and Computation}
|
|
}
|
|
|
|
@book{Gottesman1999,
|
|
title = {Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics, Hobart, July 13-17, 1998},
|
|
author = {Corney, S.P. and Delbourgo, R. and Jarvis, P.D.},
|
|
pages = {{32}--{43}},
|
|
isbn = {9781571460547},
|
|
series = {International Press lectures and conference proceedings in physics},
|
|
url = {https://books.google.pt/books?id=YPH4PgAACAAJ},
|
|
year = {1999},
|
|
publisher = {International Press}
|
|
}
|
|
|
|
@article{Gottesman2004,
|
|
title = {Improved simulation of stabilizer circuits},
|
|
author = {Aaronson, Scott and Gottesman, Daniel},
|
|
journal = {Phys. Rev. A},
|
|
volume = {70},
|
|
issue = {5},
|
|
pages = {052328},
|
|
numpages = {14},
|
|
year = {2004},
|
|
month = {Nov},
|
|
publisher = {American Physical Society},
|
|
doi = {10.1103/PhysRevA.70.052328},
|
|
url = {https://link.aps.org/doi/10.1103/PhysRevA.70.052328}
|
|
}
|
|
|
|
@article{Bravyi2005,
|
|
doi = {10.1103/physreva.71.022316},
|
|
url = {https://doi.org/10.1103/physreva.71.022316},
|
|
year = {2005},
|
|
month = feb,
|
|
publisher = {American Physical Society ({APS})},
|
|
volume = {71},
|
|
number = {2},
|
|
author = {Sergey Bravyi and Alexei Kitaev},
|
|
title = {Universal quantum computation with ideal Clifford gates and noisy ancillas},
|
|
journal = {Physical Review A}
|
|
}
|
|
|
|
@article{DeRaedt2019,
|
|
doi = {10.1016/j.cpc.2018.11.005},
|
|
url = {https://doi.org/10.1016/j.cpc.2018.11.005},
|
|
year = {2019},
|
|
month = apr,
|
|
publisher = {Elsevier {BV}},
|
|
volume = {237},
|
|
pages = {47--61},
|
|
author = {Hans De Raedt and Fengping Jin and Dennis Willsch and Madita Willsch and Naoki Yoshioka and Nobuyasu Ito and Shengjun Yuan and Kristel Michielsen},
|
|
title = {Massively parallel quantum computer simulator, eleven years later},
|
|
journal = {Computer Physics Communications}
|
|
}
|
|
|
|
@book{DeRaedt2006,
|
|
title = {Handbook of Theoretical and Computational Nanotechnology},
|
|
author = {H. De Raedt and K. Michielsen},
|
|
editor = {M. Rieth and W. Schommers},
|
|
publisher = {American Scientific Publishers},
|
|
year = {2006},
|
|
pages = {2--48}
|
|
}
|
|
|
|
@unpublished{Smelyanskiy2016,
|
|
title = {qHiPSTER: The Quantum High Performance Software Testing Environment},
|
|
author = {Smelyanskiy, Mikhail and Sawaya, Nicolas P. D. and Aspuru-Guzik, Alán},
|
|
year = {2016},
|
|
eprint = {1601.07195},
|
|
archiveprefix = {arXiv},
|
|
primaryclass = {quant-ph},
|
|
note = {Unpublished},
|
|
keywords = {Quantum Physics (quant-ph), Distributed, Parallel, and Cluster Computing (cs.DC), FOS: Physical sciences, FOS: Physical sciences, FOS: Computer and information sciences, FOS: Computer and information sciences}
|
|
}
|
|
|
|
@article{Niwa2002,
|
|
doi = {10.1103/physreva.66.062317},
|
|
url = {https://doi.org/10.1103/physreva.66.062317},
|
|
year = {2002},
|
|
month = dec,
|
|
publisher = {American Physical Society ({APS})},
|
|
volume = {66},
|
|
number = {6},
|
|
author = {Jumpei Niwa and Keiji Matsumoto and Hiroshi Imai},
|
|
title = {General-purpose parallel simulator for quantum computing},
|
|
journal = {Physical Review A}
|
|
}
|
|
|
|
@article{Jones2019,
|
|
doi = {10.1038/s41598-019-47174-9},
|
|
url = {https://doi.org/10.1038/s41598-019-47174-9},
|
|
year = {2019},
|
|
month = jul,
|
|
publisher = {Springer Science and Business Media {LLC}},
|
|
volume = {9},
|
|
number = {1},
|
|
author = {Tyson Jones and Anna Brown and Ian Bush and Simon C. Benjamin},
|
|
title = {{QuEST} and High Performance Simulation of Quantum Computers},
|
|
journal = {Scientific Reports}
|
|
}
|
|
|
|
@inproceedings{Haner2016,
|
|
doi = {10.1109/sc.2016.73},
|
|
url = {https://doi.org/10.1109/sc.2016.73},
|
|
year = {2016},
|
|
month = nov,
|
|
publisher = {{IEEE}},
|
|
author = {Thomas Haner and Damian S. Steiger and Mikhail Smelyanskiy and Matthias Troyer},
|
|
title = {High Performance Emulation of Quantum Circuits},
|
|
booktitle = {{SC}16: International Conference for High Performance Computing, Networking, Storage and Analysis}
|
|
}
|
|
|
|
@article{Xiao2023,
|
|
doi = {10.1145/3604606},
|
|
url = {https://doi.org/10.1145/3604606},
|
|
year = {2023},
|
|
month = jun,
|
|
publisher = {Association for Computing Machinery ({ACM})},
|
|
author = {Guoqing Xiao and Chuanghui Yin and Tao Zhou and Xueqi Li and Yuedan Chen and Kenli Li},
|
|
title = {A Survey of Accelerating Parallel Sparse Linear Algebra},
|
|
journal = {{ACM} Computing Surveys}
|
|
}
|
|
|
|
@article{Bernstein1997,
|
|
doi = {10.1137/s0097539796300921},
|
|
url = {https://doi.org/10.1137/s0097539796300921},
|
|
year = {1997},
|
|
month = oct,
|
|
publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
|
|
volume = {26},
|
|
number = {5},
|
|
pages = {1411--1473},
|
|
author = {Ethan Bernstein and Umesh Vazirani},
|
|
title = {Quantum Complexity Theory},
|
|
journal = {{SIAM} Journal on Computing}
|
|
}
|
|
|
|
@unpublished{Boixo2017,
|
|
author = {Sergio Boixo and Sergei V. Isakov and Vadim N. Smelyanskiy and Hartmut Neven},
|
|
note = {Unpublished},
|
|
title = {Simulation of low-depth quantum circuits as complex undirected graphical models},
|
|
year = {2017},
|
|
archiveprefix = {arXiv},
|
|
primaryclass = {quant-ph},
|
|
eprint = {1712.05384}
|
|
} |