Quantum computing
A quantum computer is a computer that represents and processes information using quantum states. It works by using effects such as superposition, interference, and entanglement. Quantum computers could someday finish some calculations exponentially faster than ordinary computers. For example, a large quantum computer could break widely used encryption schemes and help physicists with physical simulations. However, today's quantum hardware is still largely experimental and is useful only for certain specialized tasks.
The basic unit of information in quantum computing is the qubit, or quantum bit. It does a similar job to the bit in ordinary, or "classical," computers. A classical bit can be in one of two states, a binary value. A qubit, however, can exist in a linear combination of states called a quantum superposition. When a qubit is measured, the result is one of the two states, chosen by a probabilistic rule. If a quantum computer handles the qubit in a particular way, wave interference effects can increase the chance of the desired result. Quantum algorithm design means creating step-by-step procedures that let a quantum computer make this happen.
Quantum computers are not yet practical for everyday real-world use. If a physical qubit is not well isolated from its surroundings, it suffers from quantum decoherence, which adds noise, or errors, to calculations. Governments have invested in research to build qubits that keep their quantum states for longer and make fewer errors. Some example designs use superconductors, which isolate an electrical current by removing electrical resistance. Others use ion traps, which hold a single atomic particle in place using electromagnetic fields.
Researchers have claimed that quantum devices can outperform classical computers on certain tasks, a goal called quantum advantage or quantum supremacy. These tasks are not necessarily useful in the real world. As a result, as of 2026, these demonstrations are best seen as scientific milestones rather than proof that quantum computers will be ready for use soon. Global government investment in quantum computing reached $10 billion by April 2025.
History
For a chronological guide, see Timeline of quantum computing and communication. Quantum mechanics and computer science formed separate academic communities until quantum computing appeared. Quantum theory was developed in the 1920s to explain puzzling physical phenomena, and computers emerged decades later. As physicists applied quantum models to computing problems and swapped bits for qubits, the two fields began to come together. In 1980, Paul Benioff introduced the quantum Turing machine, which used quantum theory to describe a simplified computer. As digital computers grew faster, physicists faced an exponential increase in effort when simulating quantum dynamics, so Yuri Manin and Richard Feynman each suggested that hardware based on quantum phenomena might be more efficient. In a 1984 paper, Charles Bennett and Gilles Brassard applied quantum theory to cryptography and showed that quantum key distribution could improve information security.
Quantum algorithms then appeared for solving oracle problems, such as Deutsch's algorithm in 1985, the Bernstein–Vazirani algorithm in 1993, and Simon's algorithm in 1994. These did not solve practical problems, but they showed mathematically that more information could be gained by querying a black box with a quantum state in superposition, sometimes called quantum parallelism.
In 1994, Peter Shor built on these results with polynomial-time quantum algorithms for integer factorization and the discrete logarithm problem. A large enough quantum computer could therefore break widely used public-key cryptography systems, since efficient factorization would weaken RSA and an efficient discrete-logarithm method would weaken Diffie–Hellman key exchange. This attention to Shor's algorithm drew wide interest in quantum computing. In 1996, Grover's algorithm showed a quantum speedup for the unstructured search problem, and Seth Lloyd proved that quantum computers could simulate quantum systems without the exponential overhead of classical methods, supporting Feynman's 1982 idea. Experimentalists built small quantum computers using trapped ions and superconductors, and in 1998 a two-qubit machine showed that the idea was technically possible. In 2019, Google AI and NASA announced they had reached quantum supremacy with a 54-qubit machine, completing a task that they estimated would take classical supercomputers 10,000 years. IBM disputed this, arguing the task could be done in about 2.5 days on its Summit supercomputer, which sparked debate over what counts as this milestone. Later work focused on quantum error correction to control decoherence, and in 2024 researchers demonstrated approaches toward large, reliable quantum memory, a step toward larger systems, though building them at scale remains an engineering challenge.
See also: Unitarity (physics)
Further information: Quantum programming
Quantum information processing
Computer engineers usually describe how a modern computer works using classical physics. Some parts of these computers may depend on quantum behavior, but they are not fully cut off from their surroundings, so any quantum information quickly decoheres. Classical computers store information in bits that are either 0 or 1. The qubit is the basic unit of quantum information. When measured, a qubit gives either 0 or 1, but before that it can be in a superposition of both. Each added qubit doubles the size of the system, which makes it hard for a classical computer to copy a quantum one. For example, a 100-qubit system needs 2100 values to be stored. Quantum programs rely on carefully controlling quantum systems, which are described with complex numbers, vectors, and matrices. Quantum computers use quantum logic gates, such as the CNOT gate, to change qubits, much as classical logic gates change bits. Physicist Charlie Bennett pointed out that because classical computers are made of quantum atoms, all computers are quantum, so the real question is where classical slowdowns come from.
Any quantum computation can be built from a small set of gates, known as a universal gate set. Researchers also describe computing as a network of gates and measurements, often drawn as quantum circuits. Quantum computers are still developing, and fully error-free machines remain out of reach as of 2026. Some researchers think noisy intermediate-scale quantum machines may have special uses soon, but errors in gates limit how reliable they are. Scientists at Harvard created quantum circuits that fix errors more efficiently than other methods, which may help remove a major obstacle. The Harvard team was supported by MIT, QuEra Computing, Caltech, and Princeton, and funded by DARPA's Optimization with Noisy Intermediate-Scale Quantum devices (ONISQ) program.
Communication
Further information: Quantum information science
Quantum cryptography makes secure data sending possible. For example, quantum key distribution uses linked quantum states to create secure cryptographic keys.: 1017 If a sender and receiver pass quantum states between them, they can be sure that an adversary has not listened in, because anyone who spies would disturb the fragile quantum system and cause a change that can be noticed. Using suitable cryptographic protocols, they can share information privately. Modern fiber-optic cables can carry quantum information over fairly short distances. Researchers are working to build more reliable parts, such as quantum repeaters, to make long-distance quantum networks possible. In theory, this could allow new uses such as distributed quantum computing and better quantum sensing.
Quantum teleportation is a method where Alice can send the state of a qubit to Bob using one shared entangled pair and two classical bits. Alice's qubit is not physically sent. Instead, it is rebuilt at Bob's end using measurement results sent over ordinary channels. This shows that quantum communication needs both entanglement and classical communication, and teleportation cannot send information faster than light. Superdense coding works the other way: using one shared entangled pair and sending only one qubit, Alice can send two classical bits to Bob. This seems to break Holevo's theorem, which says a single qubit can carry at most one bit of classical information, but the shared entanglement gets around that limit.
Algorithms
See also: List of quantum algorithms
Most work on quantum algorithms uses the quantum circuit model, though some exceptions, such as the quantum adiabatic algorithm, exist. Scientists group quantum algorithms roughly by the kind of speedup they give over regular, or classical, algorithms. Some give more than a polynomial speedup, including Shor's algorithm for factoring. Related methods work for discrete logarithms, Pell's equation, and the hidden subgroup problem for abelian finite groups, and they all use the quantum Fourier transform. No one has proven that a classical algorithm could never be just as fast, but the evidence suggests this is unlikely. Some problems, such as Simon's problem and the Bernstein–Vazirani problem, show provable speedups, but only in the quantum query model, a restricted model that does not always apply to real problems.
Other problems, including simulating quantum physical processes from chemistry and solid-state physics, approximating certain Jones polynomials, and the quantum algorithm for linear systems of equations, appear to have very large speedups and are BQP-complete. Some algorithms, such as Grover's algorithm and amplitude amplification, give smaller polynomial speedups but can be used for many problems. Their speedups have not yet been shown in real-world use.
Simulation of quantum systems
Main article: Quantum simulation
Chemistry and nanotechnology rely on understanding quantum systems, which are very hard to simulate on regular computers. So quantum simulation may be an important application. Quantum computational chemistry is promising, though useful versions are still limited by hardware. Quantum simulation could also show how atoms and particles behave under unusual conditions, such as reactions inside a collider. In June 2023, IBM computer scientists reported that a quantum computer gave better results for a physics problem than a conventional supercomputer.
About 2% of the world's yearly energy is used for nitrogen fixation to make ammonia for the Haber process in farm fertiliser production. Quantum simulations might help scientists understand this process and make it more energy efficient.
Cryptography
Main articles: Post-quantum cryptography and Quantum cryptography
Digital cryptography keeps communications private by blocking unauthorised people from reading them. Conventional encryption hides a message with a key through an algorithm that is hard to reverse. Quantum computing may someday be powerful enough to make those reversals possible, which could let people read messages protected this way. In theory, quantum computing could attack many cryptographic systems in use today. Integer factorization protects public key cryptographic systems and is believed to be too hard for a classical computer when the number is the product of a few large prime numbers. A quantum computer could solve this much faster using Shor's algorithm, which could break many widely used systems. These include RSA, Diffie–Hellman, and elliptic curve Diffie–Hellman, which help keep web pages, emails, and other data safe.
Researchers are working on post-quantum cryptography, which aims to find systems that quantum algorithms cannot easily break. Some public-key methods, such as the McEliece cryptosystem, rely on problems that Shor's algorithm cannot solve. Lattice-based cryptosystems are not known to be vulnerable to quantum computers. Grover's algorithm can also weaken symmetric (secret-key) algorithms, but doubling the key length keeps them about as secure. Quantum cryptography uses ideas from quantum mechanics, such as entanglement, to protect messages. In principle, a message protected this way cannot be decoded even by a quantum computer, though this takes a lot of special equipment.
Search problems
Main article: Grover's algorithm
The best-known example of a problem with a polynomial quantum speedup is searching an unstructured list to find one marked item. Grover's algorithm can do this with fewer checks than classical methods. Many other speedups are based on it, including Brassard, Høyer, and Tapp's algorithm for finding collisions. Grover's algorithm can be used on a Boolean satisfiability problem, and it could be used in a password cracker that guesses passwords. Breaking symmetric ciphers this way is of interest to government agencies.
Quantum annealing
Quantum annealing uses the adiabatic theorem to do calculations. The system starts in a simple state and slowly changes into a more complex one whose lowest state represents the answer. If the change is slow enough, the system stays in that lowest state. Quantum annealing can solve Ising models and related problems, which can represent many combinatorial optimization problems. It may also help with computational biology problems.
Machine learning
Main article: Quantum machine learning
Quantum computers may be able to speed up some machine learning tasks. However, many proposed advantages depend on special assumptions, and as of 2024 they had not led to a clear practical benefit. The HHL Algorithm is believed to offer a speedup over classical methods. Researchers have also tried quantum annealing hardware for training Boltzmann machines and deep neural networks.
Quantum methods are also being explored for drug discovery. In 2023, researchers reported a hybrid model that generated new small molecules with properties similar to medicines. Large molecule spaces remain a major challenge, which future quantum computers might help with. Quantum-enhanced models such as quantum generative adversarial networks (GANs) may be developed into chemistry tools.
AI-assisted algorithm discovery
Artificial intelligence is being explored as a tool for finding and improving quantum algorithms. AlphaEvolve, a Google DeepMind system built on large language models and evolutionary algorithms, has been described as a coding agent for scientific discovery. In quantum research, AlphaEvolve-optimised quantum circuits have been used in work on quantum computation of molecular geometry through many-body nuclear spin echoes.
Engineering
See also: Quantum network
Further information: List of proposed quantum registers
As of 2023, classical computers were still better than quantum computers for all real-world uses. Building a large-scale quantum computer is very hard. Physicist David DiVincenzo listed what a practical one needs, including the ability to add more qubits, quantum decoherence that is slower than the computer's operations, and qubits that are easy to read. Parts are also hard to get. Superconducting quantum computers need helium-3, which is hard to find. Errors are another challenge, so scientists study quantum error correction and topological quantum computers. The National Institute of Standards and Technology (NIST) has also started work on codes that stay safe against both quantum and ordinary computers.
In 2019, Google Quantum AI claimed to have reached quantum supremacy, meaning a quantum device solved a problem that ordinary computers could not solve well. Other researchers challenged this claim. A 2023 article said that quantum computers were not yet useful but might be useful someday. Among the most developed hardware are superconductors and trapped ions.
Theory
Computability
Further information: Computability theory
Any computational problem that a classical computer can solve can also be solved by a quantum computer. This is because all physical things, including classical computers, can be described using quantum mechanics, which also explains how quantum computers work. In the other direction, any problem a quantum computer can solve can also be solved by a classical computer, given enough time. Quantum computers do not have more computability power than classical ones, so they cannot solve undecidable problems like the halting problem. Their existence also does not disprove the Church–Turing thesis.
Complexity
Main article: Quantum complexity theory
Quantum computers cannot solve any problem that classical computers cannot already solve, but they are thought to solve some problems faster. For example, quantum computers can efficiently factor integers, which classical computers are not believed to do. The problems a quantum computer can efficiently solve with bounded error form the class BQP, which is the quantum version of BPP. Scientists do not yet know exactly how BQP relates to PSPACE and other classes, but they know that all problems classical computers can efficiently solve can also be solved efficiently by quantum computers. Integer factorization and the discrete logarithm problem are believed to be solvable by quantum computers but not by classical ones. If a quantum computer could solve an NP-complete problem efficiently, then, because of NP-hardness, it could solve all problems in NP efficiently too, and this is not believed to be true.
List of quantum computers
See also: List of quantum processors
Some quantum computers have already been built. The Hanyuan-1 is a 100-qubit neutral atom quantum computer from the Chinese Academy of Sciences in China. The IBM Quantum System One is an IBM superconducting system that was introduced in 2019. The IBM Quantum System Two is a modular superconducting system that uses IBM Heron processors. Jiuzhang is a photonic prototype made for Gaussian boson sampling. The QpiAI-Indus is a 25-qubit superconducting quantum computer from QpiAI in India.
Scientists are also studying many different ways to build quantum computers. Some of these approaches are only proposed so far, such as the Cat qubit quantum computer, which is based on cat-state qubits, and the Kane quantum computer, which uses a silicon-based design with nuclear spin. Other approaches use photonic methods, such as linear optical quantum computing, which works with photons. Some use neutral atoms that are trapped and controlled with light, while others use nuclear magnetic resonance or superconducting electronic circuits. The Spin qubit quantum computer uses a semiconductor design, and the Topological quantum computer is proposed to use states such as anyons. The Trapped-ion quantum computer uses charged atoms that are held in place as qubits.
Quantum computing conferences
- Quantum Information Processing (QIP)
- Theory of Quantum Computation, Communication and Cryptography (TQC)
- Quantum Communication, Measurement and Computing (QCMC)
- IEEE International Conference on Quantum Computing and Engineering (QCE), also known as IEEE Quantum Week
- International Conference on quantum cryptography (QCrypt)
- Q2B – by QC Ware.

Quiz time!
5 questions about Quantum computing
What makes a qubit different from a classical bit?
Keep exploring
This article is a child-friendly adaptation of the Wikipedia article on Quantum computing, available under CC BY-SA 4.0.
Images from Wikimedia Commons. Tap any image to view credits and license.