Glossary of quantum computing
This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields.
- Bacon–Shor code
- is a Subsystem error correcting code.[1] In a Subsystem code, information is encoded in a subsystem of a Hilbert space. Subsystem codes lend to simplified error correcting procedures unlike codes which encode information in the subspace of a Hilbert space.[2] This simplicity led to the first demonstration of fault tolerant circuits on a quantum computer.[3]
- BQP
- In polynomial time, with an error probability of at most 1/3 for all instances.[4] It is the quantum analogue to the complexity class BPP. A decision problem is a member of BQP if there exists a quantum algorithm (an algorithm that runs on a quantum computer) that solves the decision problem with high probabilityand is guaranteed to run in polynomial time. A run of the algorithm will correctly solve the decision problem with a probability of at least 2/3.
- Classical shadow
- is a protocol for predicting functions of a measurements.[5]Given an unknown state , a tomographically complete set of gates (e.g Clifford gates), a set of observables and a quantum channel (defined by randomly sampling from , applying it to and measuring the resulting state); predict the expectation values .[6] A list of classical shadows is created using , and by running a Shadow generation algorithm. When predicting the properties of , a Median-of-means estimation algorithm is used to deal with the outliers in .[7] Classical shadow is useful for direct fidelity estimation, entanglement verification, estimating correlation functions, and predicting entanglement entropy.[5]
- Cloud-based quantum computing
- is the invocation of quantum simulators or processors through the cloud. Increasingly, cloud services are being looked on as the method for providing access to quantum processing. Quantum computers achieve their massive computing power by initiating quantum physics into processing power and when users are allowed access to these quantum-powered computers through the internet it is known as quantum computingwithin the cloud.
- Cross-entropy benchmarking
- (also referred to as XEB), is quantum benchmarking protocol which can be used to demonstrate quantum supremacy.[8] In XEB, a random quantum circuitis executed on a quantum computer multiple times in order to collect a set of samples in the form ofbitstrings. The bitstrings are then used to calculate the cross-entropy benchmark fidelity () via a classical computer, given by
- ,
- Eastin–Knill theorem
- is a many-body theory.[14]
- Five-qubit error correcting code
- is the smallest quantum error correcting code that can protect a logical qubit from any arbitrary single qubit error.[15] In this code, 5 physical qubits are used to encode the logical qubit.[16] With and being Pauli matrices and the Identity matrix, this code's generators are . Its logical operators are and .[17] Once the logical qubit is encoded, errors on the physical qubits can be detected via stabilizer measurements. A lookup table that maps the results of the stabilizer measurements to the types and locations of the errors gives the control system of the quantum computer enough information to correct errors.[18]
- Hadamard test (quantum computation)
- is a method used to create a real part, where is a quantum state and is aunitary gateacting on the space of .[19] The Hadamard test produces a random variable whose image is in and whose expected value is exactly . It is possible to modify the circuit to produce a random variable whose expected value is .[19]
- Magic state distillation
- is a process that takes in multiple noisy quantum computation. Magic state distillation has also been used to argue [21] that quantum contextuality may be the "magic ingredient" responsible for the power of quantum computers.[22]
- Mølmer–Sørensen gate
- (or MS gate), is a two Their proposal also extends to gates on more than two qubits.
- Quantum algorithm
- is an quantum computer. Although all classical algorithms can also be performed on a quantum computer,[26]: 126 the term quantum algorithm is usually used for those algorithms which seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.
- Quantum computing
- is a type of RSA encryption), substantially faster than classical computers. The study of quantum computing is a subfield of quantum information science.
- Quantum volume
- is a metric that measures the capabilities and error rates of a quantum computer. It expresses the maximum size of square quantum circuits that can be implemented successfully by the computer. The form of the circuits is independent from the quantum computer architecture, but compiler can transform and optimize it to take advantage of the computer's features. Thus, quantum volumes for different architectures can be compared.
- Quantum error correction
- (QEC), is used in fault-tolerant quantum computationthat can reduce the effects of noise on stored quantum information, faulty quantum gates, faulty quantum preparation, and faulty measurements.
- Quantum image processing
- (QIMP), is using Due to some of the properties inherent to quantum computation, notably entanglement and parallelism, it is hoped that QIMP technologies will offer capabilities and performances that surpass their traditional equivalents, in terms of computing speed, security, and minimum storage requirements.[30][31]
- Quantum programming
- is the process of open-source software.[33]
- Quantum simulator
- Quantum simulators permit the study of quantum system in a programmable fashion. In this instance, simulators are special purpose devices designed to provide insight about specific physics problems.[34][35][36] Quantum simulators may be contrasted with generally programmable "digital" quantum computers, which would be capable of solving a wider class of quantum problems.
- Quantum state discrimination
- In quantum information science, quantum state discrimination refers to the task of inferring the quantum state that produced the observed measurement probabilities. More precisely, in its standard formulation, the problem involves performing some POVM on a given unknown state , under the promise that the state received is an element of a collection of states , with occurring with probability , that is, . The task is then to find the probability of the POVM correctly guessing which state was received. Since the probability of the POVM returning the -th outcome when the given state was has the form , it follows that the probability of successfully determining the correct state is .[37]
- Quantum supremacy
- or quantum advantage, is the goal of demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time (irrespective of the usefulness of the problem).[38][39][40] 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.[41][42] The term was coined by John Preskill in 2012,[43][44] but the concept of a quantum computational advantage, specifically for simulating quantum systems, dates back to Yuri Manin's (1980)[45] and Richard Feynman's (1981) proposals of quantum computing.[46] Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov,[47] D-Wave's specialized frustrated cluster loop problems,[48] and sampling the output of random quantum circuits.[49][50]
- Quantum Turing machine
- (QTM), or universal quantum computer, is an quantum computer. It provides a simple model that captures all of the power of quantum computation—that is, any quantum algorithm can be expressed formally as a particular quantum Turing machine. However, the computationally equivalent quantum circuit is a more common model.[51][52]: 2
- Qubit
- A qubit (/ˈkjuːbɪt/) or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization. In a classical system, a bit would have to be in one state or the other. However, quantum mechanics allows the qubit to be in a coherent superposition of both states simultaneously, a property that is fundamental to quantum mechanics and quantum computing.
- Quil (instruction set architecture)
- is a
- Qutrit
- (or quantum trit), is a unit of quantum states.[60]The qutrit is analogous to the classicaltrit, just as the qubit, a quantum system described by a superposition of two orthogonal states, is analogous to the classical radix-2 bit. There is ongoing work to develop quantum computers using qutrits and qubits with multiple states.[61]
- Solovay–Kitaev theorem
- In quantum information and computation, the Solovay–Kitaev theorem says, roughly, that if a set of single-MSRI in 2000 but it was interrupted by a fire alarm.[63] Christopher M. Dawson and Michael Nielsen call the theorem one of the most important fundamental results in the field of quantum computation.[64]
References
- S2CID 118968017.
- ^ Aly Salah A., Klappenecker, Andreas (2008). "Subsystem code constructions". 2008 IEEE International Symposium on Information Theory. pp. 369–373. )
- ^
Egan, L., Debroy, D.M., Noel, C. (2021). "Fault-tolerant control of an error-corrected qubit". Phys. Rev. Lett. 598 (7880). Nature: 281–286. S2CID 238357892.)
{{cite journal}}
: CS1 maint: multiple names: authors list (link - ISBN 0-521-63503-9.
- ^ S2CID 211205098.
- S2CID 227127118.
- S2CID 221103573.
- S2CID 4167494.
- ^
Aaronson, S. (2021). "Open Problems Related to Quantum Query Complexity". arXiv:2109.06917 [quant-ph].
- ^
Arute, F.; et al. (2019). "Quantum supremacy using a programmable superconducting processor". Nature. 574 (7779): 505–510. S2CID 204836822.
- S2CID 44457708.
- S2CID 4446310.
- S2CID 119302752.
- S2CID 119207861.
- ].
- ^
Knill, E. and Laflamme, R. and Martinez, R. and Negrevergne, C. (2001). "Benchmarking Quantum Computers: The Five-Qubit Error Correcting Code". Phys. Rev. Lett. 86 (25). American Physical Society: 5811–5814. S2CID 119440555.)
{{cite journal}}
: CS1 maint: multiple names: authors list (link - arXiv:quant-ph/9705052.
- ^
Roffe Joschka (2019). "Quantum error correction: an introductory guide". Contemporary Physics. 60 (3). Taylor & Francis: 226–245. S2CID 198893630.
- ^ a b
S2CID 7058660.
- S2CID 4446310.
- S2CID 4463585.
- PMID 24919151.
- ^ Sørensen, Anders; Mølmer, Klaus (March 1, 1999). "Multi-particle entanglement of hot trapped ions". Physical Review Letters. 82 (9): 1835–1838. arXiv:quant-ph/9810040. Bibcode:1999PhRvL..82.1835M. doi:10.1103/PhysRevLett.82.1835. S2CID 49333990.
- ISBN 978-0-521-63503-5.
- ].
- ISBN 9781598297324.
- OCLC 1117464128.
- ^ Nielsen & Chuang 2010, p. 1.
- ^ Venegas-Andraca, Salvador E. (2005). Discrete Quantum Walks and Quantum Image Processing (DPhil thesis). The University of Oxford.
- ^ .
- .
- ISBN 9781608458516.
- ^ "Comprehensive list of quantum open-source projects". Github. Retrieved 2022-01-27.
- S2CID 120250321.
- ^ This article incorporates public domain material from Michael E. Newman. NIST Physicists Benchmark Quantum Simulator with Hundreds of Qubits. National Institute of Standards and Technology. Retrieved 2013-02-22.
- ^
Britton, Joseph W.; Sawyer, Brian C.; Keith, Adam C.; Wang, C.-C. Joseph; Freericks, James K.; Uys, Hermann; Biercuk, Michael J.; Bollinger, John J. (2012). "Engineered two-dimensional Ising interactions in a trapped-ion quantum simulator with hundreds of spins" (PDF). Nature. 484 (7395): 489–92. S2CID 4370334. Note: This manuscript is a contribution of the US National Institute of Standards and Technology and is not subject to US copyright.
- S2CID 119199057.
- ].
- .
- ^ Zhong, Han-Sen; Wang, Hui; Deng, Yu-Hao; Chen, Ming-Cheng; Peng, Li-Chao; Luo, Yi-Han; Qin, Jian; Wu, Dian; Ding, Xing; Hu, Yi; Hu, Peng (2020-12-03). "Quantum computational advantage using photons". Science. 370 (6523): 1460–1463. arXiv:2012.01625. Bibcode:2020Sci...370.1460Z. doi:10.1126/science.abe8770. ISSN 0036-8075. PMID 33273064. S2CID 227254333.
- S2CID 2514901.
- S2CID 41867048.
- ^ arXiv:1608.03355 [quant-ph].
- ^ "John Preskill Explains 'Quantum Supremacy'". Quanta Magazine. 2 October 2019. Retrieved 2020-04-21.
- ^ 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.
- S2CID 124545445.
- S2CID 681637.
- arXiv:1701.04579 [quant-ph].
- arXiv:1612.05903 [quant-ph].
- S2CID 125264133.
- ^ Andrew Yao (1993). Quantum circuit complexity. 34th Annual Symposium on Foundations of Computer Science. pp. 352–361.
- PMID 31293355.
- S2CID 92988541.
- arXiv:1610.06910 [quant-ph].
- ].
- ^ "Rigetti Launches Full-Stack Quantum Computing Service and Quantum IC Fab". IEEE Spectrum: Technology, Engineering, and Science News. 26 June 2017. Retrieved 2017-07-06.
- ^ "Rigetti Quietly Releases Beta of Forest Platform for Quantum Programming in the Cloud | Quantum Computing Report". quantumcomputingreport.com. 8 March 2017. Retrieved 2017-07-06.
- ^ "XACC Rigetti Accelerator". ornl-qci.github.io. Retrieved 2017-07-06.
- ^ Doiron, Nick (2017-03-07), jsquil: Quantum computer instructions for JavaScript developers, retrieved 2017-07-06
- S2CID 110606655.
- ^ "Qudits: The Real Future of Quantum Computing?". IEEE Spectrum. 28 June 2017. Retrieved 2021-05-24.
- S2CID 250816585.
- ^ Solovay, Robert (2000-02-08). Lie Groups and Quantum Circuits. MSRI.
- .
Further reading
Textbooks
- OCLC 829706638.
- Akama, Seiki (2014). Elements of Quantum Computing: History, Theories and Engineering Applications. Springer. OCLC 884786739.
- Benenti, Giuliano; Casati, Giulio; Rossini, Davide; Strini, Giuliano (2019). Principles of Quantum Computation and Information: A Comprehensive Textbook (2nd ed.). S2CID 62280636.
- Bernhardt, Chris (2019). Quantum Computing for Everyone. MIT Press. OCLC 1082867954.
- Hidary, Jack D. (2021). Quantum Computing: An Applied Approach (2nd ed.). S2CID 238223274.
- Hiroshi, Imai; Masahito, Hayashi, eds. (2006). Quantum Computation and Information: From Theory to Experiment. Topics in Applied Physics. Vol. 102. ISBN 978-3-540-33133-9.
- Hughes, Ciaran; Isaacson, Joshua; Perry, Anastasia; Sun, Ranbel F.; Turner, Jessica (2021). Quantum Computing for the Quantum Curious (PDF). S2CID 242566636.
- Jaeger, Gregg (2007). Quantum Information: An Overview. OCLC 186509710.
- Johnston, Eric R.; Harrigan, Nic; Gimeno-Segovia, Mercedes (2019). Programming Quantum Computers: Essential Algorithms and Code Samples. O'Reilly Media, Incorporated. OCLC 1111634190.
- Kaye, Phillip; OCLC 85896383.
- OCLC 907358694.
- OCLC 422727925.
- )
- S2CID 59717455.
- Stolze, Joachim; Suter, Dieter (2004). Quantum Computing: A Short Course from Theory to Experiment. OCLC 212140089.
- Wichert, Andreas (2020). Principles of Quantum Artificial Intelligence: Quantum Problem Solving and Machine Learning (2nd ed.). S2CID 225498497.
- Wong, Thomas (2022). Introduction to Classical and Quantum Computing (PDF). Rooted Grove. OCLC 1308951401.
- Zeng, Bei; Chen, Xie; Zhou, Duan-Lu; Wen, Xiao-Gang (2019). Quantum Information Meets Quantum Matter. S2CID 118528258.
Academic papers
- S2CID 34885835.
- Berthiaume, Andre (1997). "Quantum Computation".
- S2CID 15439711.
- DiVincenzo, David P. (1995). "Quantum Computation". Science. 270 (5234): 255–261. S2CID 220110562. Table 1 lists switching and dephasing times for various systems.
- S2CID 124545445.
- Jeutner, Valentin (2021). "The Quantum Imperative: Addressing the Legal Dimension of Quantum Computers". Morals & Machines. 1 (1): 52–59. S2CID 236664155.
- Mitchell, Ian (1998). "Computing Power into the 21st Century: Moore's Law and Beyond".
- Simon, Daniel R. (1994). "On the Power of Quantum Computation". Institute of Electrical and Electronics Engineers Computer Society Press.