---
title: Quantum computing
slug: quantum-computing
qid: 
snapshot: enwiki-001378864845
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1378864845
tags: [10639558, 116690197, 125876068, 130042203, 20157965, 20366816, 20423413, 22899860, 22906068, 22915716, 22964558, 22985424, 23118434, 23603337, 24043274, 24623845, 24745122, 25574325, 28031502, 29265121, 29265208, 31929112, 51681788, 63706498, 68328988, 7386969, 81199107, 89061568]
---

# Quantum computing

> [!note] Provenance
> Snapshot `enwiki-001378864845` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1378864845> · Licensed CC BY-SA 4.0

quantum computer demo at ITU WTSA 2024 in Delhi representation of a qubit. The state | \psi \rangle = \alpha |0 \rangle + \beta |1 \rangle is a point on the surface of the sphere, partway between the poles, |0\rangle and |1\rangle . A quantum computer is a computer that represents and processes information using quantum states. Quantum computations exploit phenomena such as superposition, interference, and entanglement. Quantum computers have the potential to complete some calculations exponentially faster than classical computers. For example, a large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations. However, current hardware implementations of quantum computation are largely experimental and suitable for only certain specialized tasks. The basic unit of information in quantum computing, the qubit (quantum bit), serves a similar function as the bit in ordinary or "classical" computing. Unlike a classical bit, which can be in one of two states (a binary), a qubit can exist in a linear combination of states known as a quantum superposition. The result of measuring a qubit is one of the two states, given by a probabilistic rule. If a quantum computer manipulates the qubit in a particular way, wave interference effects amplify the probability of the desired measurement result.…

quantum computer demo at ITU WTSA 2024 in Delhi representation of a qubit. The state | \psi \rangle = \alpha |0 \rangle + \beta |1 \rangle is a point on the surface of the sphere, partway between the poles, |0\rangle and |1\rangle . A quantum computer is a computer that represents and processes information using quantum states. Quantum computations exploit phenomena such as superposition, interference, and entanglement. Quantum computers have the potential to complete some calculations exponentially faster than classical computers. For example, a large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations. However, current hardware implementations of quantum computation are largely experimental and suitable for only certain specialized tasks. The basic unit of information in quantum computing, the qubit (quantum bit), serves a similar function as the bit in ordinary or "classical" computing. Unlike a classical bit, which can be in one of two states (a binary), a qubit can exist in a linear combination of states known as a quantum superposition. The result of measuring a qubit is one of the two states, given by a probabilistic rule. If a quantum computer manipulates the qubit in a particular way, wave interference effects amplify the probability of the desired measurement result. Quantum algorithm design involves creating procedures that allow a quantum computer to perform this amplification. Quantum computers are not yet practical for real-world applications. If a physical qubit is not sufficiently isolated from its environment, it suffers from quantum decoherence, introducing noise (error) into calculations. Governments have invested in research aimed at developing qubits with longer coherence times and lower error rates. Example implementations include superconductors (which isolate an electrical current by eliminating electrical resistance) and ion traps (which confine a single atomic particle using electromagnetic fields). Researchers have claimed that quantum devices can outperform classical computers on specific tasks, a metric referred to as quantum advantage or quantum supremacy. Such tasks are not necessarily useful for real-world applications. As a result, as of 2026 demonstrations are best understood as scientific milestones rather than evidence for near-term deployment. Global government investment in quantum computing reached $10 billion by April 2025. (pictured here in 2017) showed in 1994 that a scalable quantum computer would be able to break RSA encryption.|upright=0.9 Peter Shor built on these results in 1994 with polynomial-time quantum algorithms for integer factorization and the discrete logarithm problem. A sufficiently large quantum computer could therefore break widely used public-key cryptography systems: efficient factorization would compromise RSA, while an efficient discrete-logarithm algorithm would compromise Diffie–Hellman key exchange. The cryptographic implications of Shor's algorithm drew attention to quantum computing. In 1996, Grover's algorithm established a quantum speedup for the unstructured search problem. The same year, Seth Lloyd proved that quantum computers could simulate quantum systems without the exponential overhead required by classical simulations, validating Feynman's 1982 conjecture. Experimentalists constructed small-scale quantum computers using trapped ions and superconductors. In 1998, a two-qubit quantum computer demonstrated technical feasibility. Subsequent experiments increased the number of qubits and reduced error rates. In 2019, Google AI and NASA announced that they had achieved quantum supremacy with a 54-qubit machine, performing a computation that classical supercomputers would take an estimated 10,000 years to complete—a claim subsequently disputed by IBM, which argued the calculation could be done in approximately 2.5 days on its Summit supercomputer with optimized algorithms, sparking a debate over the threshold for this milestone. Quantum computing increasingly focused on controlling decoherence through quantum error correction. In 2024, researchers demonstrated approaches for high threshold, low-overhead fault-tolerant quantum memory. These developments represented a critical step toward scaling systems beyond the noisy intermediate-scale quantum (NISQ) era into the fault-tolerant application scale quantum computing (FASQ) era, though large-scale physical implementation remains an engineering challenge . Any valid qubit state has coefficients \alpha and \beta such that |\alpha|^2+|\beta|^2 = 1 . As an example, measuring the qubit 1/\sqrt {2}|0\rangle+1/\sqrt{2}|1\rangle would produce either |0\rangle or |1\rangle with equal probability. Two particularly important superposition states are the plus state |+\rangle = 1/\sqrt{2}|0\rangle + 1/\sqrt{2}|1\rangle and the minus state |-\rangle = 1/\sqrt{2}|0\rangle - 1/\sqrt{2}|1\rangle . While both yield outcomes 0 and 1 with equal probability upon standard basis measurement, they behave differently under operations such as the Hadamard gate—which maps |0\rangle \leftrightarrow |+\rangle and |1\rangle \leftrightarrow |-\rangle —demonstrating that relative phase differences carry meaningful quantum information. Each additional qubit doubles the dimension of the state space. As an example, the vector represents a two-qubit state, a tensor product of the qubit with the qubit . This vector inhabits a four-dimensional vector space spanned by the basis vectors , , , and . In general, the vector space for an -qubit system is -dimensional, and this makes it challenging for a classical computer to simulate a quantum one: representing a 100-qubit system requires storing classical values. === Unitary operators === The state of this one-qubit quantum memory can be manipulated by applying quantum logic gates, analogous to how classical memory can be manipulated with classical logic gates. One important gate for both classical and quantum computation is the NOT gate, which can be represented by a matrix X := \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}. Mathematically, the application of such a logic gate to a quantum state vector is modeled with matrix multiplication. Thus X|0\rangle = |1\rangle and X|1\rangle = |0\rangle . The mathematics of single-qubit gates can be extended to operate on multi-qubit quantum memories in two important ways. One way is to select a qubit and apply that gate to the target qubit while leaving the remainder of the memory unaffected. Another way is to apply the gate to its target only if another part of the memory is in a desired state. These two choices can be illustrated using another example. The possible states of a two-qubit quantum memory are: |00\rangle := \begin{pmatrix} 1 \\ 0 \\ 0 \\ 0 \end{pmatrix};\quad |01\rangle := \begin{pmatrix} 0 \\ 1 \\ 0 \\ 0 \end{pmatrix};\quad |10\rangle := \begin{pmatrix} 0 \\ 0 \\ 1 \\ 0 \end{pmatrix};\quad |11\rangle := \begin{pmatrix} 0 \\ 0 \\ 0 \\ 1 \end{pmatrix}. The controlled NOT (CNOT) gate can then be represented using the following matrix: \operatorname{CNOT} := \begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \end{pmatrix}. As a mathematical consequence of this definition, \operatorname{CNOT}|00\rangle = |00\rangle , \operatorname{CNOT}|01\rangle = |01\rangle , \operatorname{CNOT}|10\rangle = |11\rangle , and \operatorname{CNOT}|11\rangle = |10\rangle . In other words, the CNOT applies a NOT gate ( X from before) to the second qubit if and only if the first qubit is in the state |1\rangle . If the first qubit is |0\rangle , nothing is done to either qubit. In summary, quantum computation can be described as a network of quantum logic gates and measurements. However, any measurement can be deferred to the end of quantum computation, though this deferment may come at a computational cost, so most quantum circuits depict a network consisting only of quantum logic gates and no measurements. === Quantum programming === Various models of computation are used for quantum computing, distinguished by the basic elements in which the computation is decomposed. from more primitive gates|upright=1.15 A quantum gate array decomposes computation into a sequence of few-qubit quantum gates. A quantum computation can be described as a network of quantum logic gates and measurements. Any measurement can be deferred to the end of quantum computation, though this deferment may come at a computational cost, so most quantum circuits depict a network consisting only of quantum logic gates and no measurements. Any quantum computation (in the above formalism, any unitary matrix of size 2^n \times 2^n over n qubits) can be represented as a network of quantum logic gates from a fairly small family of gates. A choice of gate family that enables this construction is known as a universal gate set, since a computer that can run such circuits is a universal quantum computer. One common such set includes all single-qubit gates as well as the CNOT gate. This means any quantum computation can be performed by executing a sequence of single-qubit gates together with CNOT gates. Though this gate set is infinite, it can be replaced with a finite gate set by appealing to the Solovay-Kitaev theorem. Implementation of Boolean functions using the few-qubit quantum gates is presented here. ===Noisy intermediate-scale quantum computing=== The threshold theorem shows how increasing the number of qubits can mitigate errors, yet fully fault-tolerant quantum computing remains out of reach as of 2026. According to some researchers, noisy intermediate-scale quantum (NISQ) machines may have specialized uses in the near future, but noise in quantum gates limits their reliability. Scientists at Harvard created "quantum circuits" that correct errors more efficiently than alternative methods, which may remove a major obstacle to practical quantum computers. The Harvard research team was supported by MIT, QuEra Computing, Caltech, and Princeton and funded by DARPA's Optimization with Noisy Intermediate-Scale Quantum devices (ONISQ) program. === Search problems === The most well-known example of a problem that allows for a polynomial quantum speedup is unstructured search, which involves finding a marked item out of a list of n items in a database. This can be solved by Grover's algorithm using O(\sqrt{n}) queries to the database, quadratically fewer than the \Omega(n) queries required for classical algorithms. In this case, the advantage is not only provable but also optimal: it has been shown that Grover's algorithm gives the maximal possible probability of finding the desired element for any number of oracle lookups. Many examples of provable speedups for query problems are based on Grover's algorithm, including Brassard, Høyer, and Tapp's algorithm for finding collisions in two-to-one functions, and Farhi, Goldstone, and Gutmann's algorithm for evaluating NAND trees. Problems that can be efficiently addressed with Grover's algorithm have the following properties: The collection of possible answers has no searchable structure The number of possible answers to check is the same as the number of inputs to the algorithm, A Boolean function exists that evaluates each input and determines whether it is the correct answer. For problems with all these properties, the running time of Grover's algorithm on a quantum computer scales as the square root of the number of inputs (or elements in the database), as opposed to the linear scaling of classical algorithms. A general class of problems to which Grover's algorithm can be applied is a Boolean satisfiability problem, in which the algorithm iterates through all possible answers. An example and possible application of this is a password cracker that attempts to guess a password. Breaking symmetric ciphers with this algorithm is of interest to government agencies. ==== Decoherence ==== Quantum decoherence must be controlled or eliminated. Error rates are typically proportional to the ratio of operating time to decoherence time; hence, any operation must be completed much more quickly than the decoherence time. This usually means isolating the system from its environment, as external interactions cause decoherence. However, other sources also exist. Examples include the quantum gates, the lattice vibrations, and the background thermonuclear spin of the physical system that implements the qubits. Decoherence is irreversible, as it is effectively non-unitary, and must be controlled or avoided. Decoherence times for candidate systems in particular, the transverse relaxation time (for NMR and MRI technology, also called the dephasing time), typically range between nanoseconds and seconds at low temperatures. Some quantum computers require their qubits to be cooled to 20 millikelvin (usually using a dilution refrigerator ) in order to prevent significant decoherence. A 2020 study reported that ionizing radiation such as cosmic rays can cause certain systems to decohere within milliseconds. As a result, time-consuming tasks may render some quantum algorithms inoperable, as maintaining the state of qubits over a long period eventually corrupts the superpositions. These issues are more difficult for optical approaches as the timescales are orders of magnitude shorter. An often-cited approach to overcoming them is optical pulse shaping. As described by the threshold theorem, if the error rate is small enough, it is thought to be possible to use quantum error correction to suppress errors and decoherence. This allows the total calculation time to be longer than the decoherence time if the error correction scheme can correct errors faster than decoherence introduces them. An often-cited figure for the required error rate in each gate for fault-tolerant computation is , assuming the noise is depolarizing. Meeting this scalability condition is possible for a wide range of systems. However, error correction requires far more qubits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between and , where is the number of binary digits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of . For a 1000-bit number, this implies a need for about bits without error correction. With error correction, the figure would rise to about bits. Computation time is about or about steps and at 1 MHz, about 10 seconds. However, the encoding and error-correction overheads increase the size of a real fault-tolerant quantum computer by orders of magnitude. Estimates show that at least 3 million physical qubits would factor a 2,048-bit integer in 5 months on a fully error-corrected trapped-ion quantum computer. In terms of the number of physical qubits, to date, this remains the lowest estimate for practically useful integer factorization problem sizing 1,024-bit or larger. One approach to overcoming errors combines low-density parity-check code with cat qubits that have intrinsic bit-flip error suppression. Implementing 100 logical qubits with 768 cat qubits could reduce the error rate to one part in per cycle per bit. Another approach to the stability-decoherence problem is to create a topological quantum computer with anyons, quasi-particles used as threads, and relying on braid theory to form stable logic gates. Non-Abelian anyons can, in effect, remember how they have been manipulated, making them potentially useful in quantum computing. As of 2025, Microsoft and other organizations were investing in quasi-particle research. == Theory == === Computability === Any computational problem solvable by a classical computer is also solvable by a quantum computer. Intuitively, this is because all physical phenomena, including the operation of classical computers, can be described using quantum mechanics, which underlies the operation of quantum computers. Conversely, any problem solvable by a quantum computer is also solvable by a classical computer. It is possible to simulate both quantum and classical computers manually with just some paper and a pen, if given enough time. Formally, any quantum or classical computer can be simulated by a Turing machine. Quantum computers provide no computability power over classical computers. Thus, quantum computers cannot solve undecidable problems like the halting problem, and the existence of quantum computers does not disprove the Church–Turing thesis. === Complexity === While quantum computers cannot solve any problems that classical computers cannot already solve, it is suspected that they can solve certain problems faster than classical computers. For instance, it is known that quantum computers can efficiently factor integers, while this is not believed to be the case for classical computers. The class of problems that can be efficiently solved by a quantum computer with bounded error is called BQP, for "bounded error, quantum, polynomial time". More formally, BQP is the class of problems that can be solved by a polynomial-time quantum Turing machine with an error probability of at most 1/3. As a class of probabilistic problems, BQP is the quantum counterpart to BPP ("bounded error, probabilistic, polynomial time"), the class of problems that can be solved by polynomial-time probabilistic Turing machines with bounded error. \mathsf{BPP\subseteq BQP} but no proof demonstrates that \mathsf{BQP\neq BPP} , which intuitively would mean that quantum computers offer superior time complexity over classical computers. The exact relationship of BQP to P, NP, and PSPACE is not known. However, it is known that \mathsf{P\subseteq BQP \subseteq PSPACE} ; that is, all problems that can be efficiently solved by a classical computer can be efficiently solved by a quantum computer, and all problems that can be efficiently solved by a quantum computer can be solved by a classical computer with polynomial space resources. It is suspected that BQP is a strict superset of P, meaning that problems exist that are efficiently solvable by quantum computers that are not efficiently solvable by classical computers. For instance, integer factorization and the discrete logarithm problem are in BQP and are suspected to be outside of P. On the relationship of BQP to NP, little is known except that NP problems that are not in P are in BQP (integer factorization and the discrete logarithm problem are both in NP, for example). It is suspected that \mathsf{NP\nsubseteq BQP} ; that is, it is believed that some efficiently checkable problems are not efficiently solvable by a quantum computer. A direct consequence is that BQP is disjoint from the class of NP-complete problems (if an NP-complete problem were in BQP, then it would follow from NP-hardness that all problems in NP are in BQP). ===Sources=== ===Textbooks=== ===Academic papers=== Table 1 lists switching and dephasing times for various systems. Quantum computing for the determined – 22 video lectures by Michael Nielsen Video Lectures by David Deutsch Lomonaco, Sam. Four Lectures on Quantum Computing given at Oxford University in July 2006
