This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details.(October 2019) (Learn how and when to remove this message)
In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem.[1][2][3] The term was coined by John Preskill in 2012,[1][4] but the concept dates to Yuri Manin's 1980[5] and Richard Feynman's 1981[6] proposals of quantum computing.
Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task.[7][8]
Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov,[9] and sampling the output of random quantum circuits.[10][11] The output distributions that are obtained by making measurements in boson sampling or quantum random circuit sampling are flat, but structured in a way so that one cannot classically efficiently sample from a distribution that is close to the distribution generated by the quantum experiment. For this conclusion to be valid, only very mild assumptions in the theory of computational complexity have to be invoked. In this sense, quantum random sampling schemes can have the potential to show quantum supremacy.[12]
A notable property of quantum supremacy is that it can be feasibly achieved by near-term quantum computers,[4] since it does not require a quantum computer to perform any useful task[13] or use high-quality quantum error correction,[14] both of which are long-term goals.[2] Consequently, researchers view quantum supremacy as primarily a scientific goal, with relatively little immediate bearing on the future commercial viability of quantum computing.[2] Due to unpredictable possible improvements in classical computers and algorithms, quantum supremacy may be temporary or unstable, placing possible achievements under significant scrutiny.[15][16]
^ abPreskill, John (2012-03-26). "Quantum computing and the entanglement frontier". arXiv:1203.5813 [quant-ph].
^ abcPreskill, John (2018-08-06). "Quantum Computing in the NISQ era and beyond". Quantum. 2: 79. arXiv:1801.00862. Bibcode:2018Quant...2...79P. doi:10.22331/q-2018-08-06-79.
^Cite error: The named reference :6 was invoked but never defined (see the help page).
^ abCite error: The named reference :14 was invoked but never defined (see the help page).
^Manin, Yu. I. (1980). Vychislimoe i nevychislimoe [Computable and Noncomputable] (in Russian). Sov.Radio. pp. 13–15. Archived from the original on 2013-05-10. Retrieved 2013-03-04.
^Feynman, Richard P. (1982-06-01). "Simulating Physics with Computers". International Journal of Theoretical Physics. 21 (6–7): 467–488. Bibcode:1982IJTP...21..467F. CiteSeerX 10.1.1.45.9310. doi:10.1007/BF02650179. ISSN 0020-7748. S2CID 124545445.
^Papageorgiou, Anargyros; Traub, Joseph F. (2013-08-12). "Measures of quantum computing speedup". Physical Review A. 88 (2): 022316. arXiv:1307.7488. Bibcode:2013PhRvA..88b2316P. doi:10.1103/PhysRevA.88.022316. ISSN 1050-2947. S2CID 41867048.
^Aaronson, Scott; Arkhipov, Alex (2011). "The computational complexity of linear optics". Proceedings of the forty-third annual ACM symposium on Theory of computing. STOC '11. New York, New York, United States: Association for Computing Machinery. pp. 333–342. arXiv:1011.3245. doi:10.1145/1993636.1993682. ISBN 9781450306911. S2CID 681637.
^Bouland, Adam; Fefferman, Bill; Nirkhe, Chinmay; Vazirani, Umesh (2018-10-29). "On the complexity and verification of quantum random circuit sampling". Nature Physics. 15 (2): 159–163. arXiv:1803.04402. doi:10.1038/s41567-018-0318-2. ISSN 1745-2473. S2CID 125264133.
^Hangleiter, Dominik; Eisert, Jens (2023-07-20). "Computational advantage of quantum random sampling". Reviews of Modern Physics. 95 (3): 035001. arXiv:2206.04079. Bibcode:2023RvMP...95c5001H. doi:10.1103/RevModPhys.95.035001. S2CID 249538723.
^Metz, Cade (2019-10-23). "Google Claims a Quantum Breakthrough That Could Change Computing (Published 2019)". The New York Times. ISSN 0362-4331. Retrieved 2020-12-07.
^Aaronson, Scott (2019-10-30). "Opinion | Why Google's Quantum Supremacy Milestone Matters (Published 2019)". The New York Times. ISSN 0362-4331. Retrieved 2020-12-07.
^Cite error: The named reference ibmsupremacy was invoked but never defined (see the help page).
^Crane, Leah. "IBM says Google may not have reached quantum supremacy after all". New Scientist. Retrieved 2020-12-07.
In quantum computing, quantumsupremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that...
QuantumSupremacy: How the Quantum Computer Revolution Will Change Everything is a non-fiction book by the American futurist and physicist Michio Kaku...
such as sorting are proven to not allow any asymptotic quantum speedup. Claims of quantumsupremacy have drawn significant attention to the discipline, but...
is quantum benchmarking protocol which can be used to demonstrate quantumsupremacy. In XEB, a random quantum circuit is executed on a quantum computer...
have achieved quantumsupremacy. To estimate the time that would be taken by a classical supercomputer, Google ran portions of the quantum circuit simulation...
generally cannot be efficiently simulated on classical computers (see Quantumsupremacy). The best-known algorithms are Shor's algorithm for factoring and...
partnered with Google, published an article demonstrating novel quantumsupremacy, using a chip composed of 53 superconducting qubits. Classical computation...
Stepping Stone to Quantum Computing Supremacy". MIT Technology Review. Retrieved 2017-10-18. "A Preview of Bristlecone, Google's New Quantum Processor", Research...
electronics. On the 23rd of October 2019, the Quantum AI Lab announced in a paper that it had achieved quantumsupremacy. Artificial intelligence Glossary of artificial...
by Google's quantum computer research team was briefly available in late September 2019, claiming the project had reached quantumsupremacy. Google also...
computation, and he is known for coining the term "quantumsupremacy" and that of "noisy intermediate-scale quantum (NISQ)" devices. Preskill was born on January...
realization of quantum devices, consolidating their education in quantum science and technologies. Quantumsupremacy Noisy intermediate-scale quantum era Timeline...
Quantum teleportation is a technique for transferring quantum information from a sender at one location to a receiver some distance away. While teleportation...
expectation for gaining quantumsupremacy. VQAs is a mixed quantum-classical approach where the quantum processor prepares quantum states and measurement...
Quantum information is the information of the state of a quantum system. It is the basic entity of study in quantum information theory, and can be manipulated...
are not Air supremacy, the aerial control of a battlefield by one side's air force Petrine supremacy, in the Catholic church Quantumsupremacy, the question...
which are (i) the validation of quantum computers, which is the method that Google used when they claimed quantumsupremacy in 2019., and (ii) understanding...
In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier...
Quantum information science is a field that combines the principles of quantum mechanics with information theory to study the processing, analysis, and...
In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit...
In quantum computing, a qubit (/ˈkjuːbɪt/) or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically...
Quantum simulators permit the study of a quantum system in a programmable fashion. In this instance, simulators are special purpose devices designed to...
classical computer; thereby proving Quantumsupremacy of their photon-based quantum computer called Jiu Zhang Quantum Computer (九章量子计算机). The boson sampling...