Quantum computing is a way of processing information with quantum systems called qubits. Unlike a classical bit, which is either 0 or 1, a qubit can be in a superposition of states. A quantum computer applies carefully chosen operations to qubits so that interference changes the odds of possible measurement results. It does not simply calculate every answer and reveal them all: measurement returns limited classical data, so the algorithm must make useful results more likely.
What is a quantum computer?
A classical computer represents and processes information with bits, each encoded as 0 or 1. A quantum computer uses qubits, physical systems controlled so they can store and transform quantum information. Qubits can be made from different technologies, including trapped ions and superconducting circuits.
Quantum computers obey the same quantum mechanics as other physical systems. Their potential comes from using properties such as superposition, entanglement and interference in a computation. These properties can help with particular problems; they do not make a quantum computer a universally faster replacement for a conventional computer.
What is a qubit, and what do superposition and entanglement mean?
Qubits and superposition
A qubit has two measurement basis states, conventionally labelled 0 and 1. Before measurement, its state can be a superposition of those basis states, described by amplitudes. The amplitudes determine the probabilities of the outcomes when the qubit is measured. Measurement produces a classical result, not a readable list of every component of the superposition.
Do these 3 things before closing this tab:
1Fix the driver behind crashes, sound loss and screen glitches2Repair Windows errors before they cause bigger problems3Scan for outdated or missing drivers - takes under a minute#1 Best Overall
Superposition is therefore not the same as having two ordinary bits, or two copies of an answer that can both be inspected. The quantum state can encode combinations of possibilities, but a readout yields limited information. A useful algorithm has to arrange the computation so that measurement is more likely to return information relevant to the task.
Entanglement
When qubits are entangled, their shared state cannot be fully described by treating each qubit as independent. Measuring one can be correlated with the result of measuring another in ways that classical independent bits cannot reproduce. Entanglement is a resource used by quantum circuits, but it does not by itself provide a solution or make every computation faster.
Gates, circuits and interference
A quantum gate is a controlled operation that changes a qubit’s state. Some gates act on one qubit; multi-qubit gates can create entanglement. A sequence of gates is a quantum circuit. During a circuit, quantum amplitudes can interfere: they combine so that some possible outcomes become more likely and others less likely. Algorithms use this effect to steer measurement probabilities toward useful answers. IBM Quantum Learning introduces these building blocks in its quantum computing fundamentals course.
How does a gate-based quantum computer work?
A typical gate-based computation has a planned sequence of operations, followed by measurement. The classical computer surrounding the quantum processor often helps prepare the task and interpret the results.
- Initialize: prepare the qubits in a known starting state.
- Apply gates: use single-qubit operations to change individual states, and multi-qubit operations to build correlations or entanglement.
- Run the circuit: apply the designed sequence of gates. The sequence shapes amplitudes so that interference changes the probability of different outcomes.
- Measure: convert the quantum state into classical outcomes. A single measurement does not expose every part of the state.
- Interpret the samples: run measurements repeatedly when needed, then analyze the resulting classical data, often with conventional computing.
The central challenge in algorithm design is to make the desired information extractable from measurement. A quantum computer is not a brute-force machine that tries every candidate and prints the full answer set. As NIST explains, quantum states may represent many possible outcomes, but measurement still limits how much information can be obtained from them: NIST’s Quantum Computing Explained.
What could quantum computers be useful for?
Quantum computing is most promising for selected tasks where quantum operations can exploit a problem’s structure. The main areas under investigation include:
- Simulating molecules and materials: quantum systems may help model other quantum systems, a potential use in chemistry and materials science.
- Factoring: Shor’s algorithm shows that a sufficiently capable fault-tolerant quantum computer could factor integers in a way that matters for some current public-key cryptography. That is a theoretical capability, not a description of what today’s machines can routinely do.
- Optimization and related applications: optimization, machine learning and transportation have been explored as possible application areas. A U.S. Department of Transportation workshop report from November 2024 discusses these fields, but identifying an area of interest does not establish practical quantum advantage on its workloads: USDOT Quantum Workshop Report.
These are prospective areas, not proof that present-day devices routinely outperform classical computers on useful commercial tasks. NIST describes many applications as years or perhaps decades away. A real advantage depends on the problem, the algorithm, the quality and scale of the hardware, and comparison with the best classical methods.
Independent reader supportYour contribution helps us test, update, and keep practical guides available for everyone.Why are quantum computers difficult to build?
Qubits are fragile. Stray electric or magnetic fields, temperature fluctuations and other disturbances can alter their states; imperfect operations can introduce additional errors. As a computation grows, errors can accumulate and corrupt the result.
Quantum error correction is intended to protect computations, but it requires substantial engineering overhead. Consequently, a raw count of physical qubits is not enough to judge a machine’s useful computing power. Reliability, gate performance, connectivity, control systems and the resources needed for error correction also matter.
How do the main qubit hardware approaches differ?
There is no single established hardware design. NIST describes two prominent approaches with different trade-offs, alongside other technologies being researched. The comparison below is qualitative; it is not a current performance ranking.
| Approach | Strength described by NIST | Trade-off described by NIST |
|---|---|---|
| Trapped ions | Qubits can maintain superpositions for a long time. | Computation is relatively slow. |
| Superconducting circuits | Can compute quickly and use chip-manufacturing techniques. | Quantum states are more fragile and shorter-lived. |
Neutral atoms, diamond defects, photons, silicon and topological qubits are also under investigation. Comparing platforms fairly requires more than a single headline number: coherence or state lifetime, gate speed and fidelity, connectivity, scaling approach, control infrastructure and error-correction overhead all affect what a device can do.
Will quantum computers replace ordinary computers?
No. Quantum processors are specialized tools for selected problems, while classical computers remain better suited to most everyday computing and handle many tasks in a quantum workflow. A hybrid system may use a conventional computer for most of the work and call on a quantum processor for a particular subproblem. The useful question is not whether a machine is quantum, but whether it can solve a specific task more effectively than the best practical alternative.
Recommended Free Tools
Learn the fundamentals
For a structured introduction to qubits, gates, circuits, superposition, entanglement and measurement, see IBM Quantum Learning’s quantum computing fundamentals. For an overview of applications, hardware and limitations, consult NIST’s Quantum Computing Explained.
Quick Recap
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
