Quantum Computing Fundamentals: Qubits, Circuits and Limits

Updated 15 November 2026 · Standard formula, shown below

Quantum computing uses quantum states to process information: its basic units, qubits, can combine possibilities through superposition and become correlated through entanglement. Quantum circuits manipulate qubits with gates and measurements; selected algorithms can outperform known classical methods for particular tasks, but today’s noisy hardware is limited and does not make every computation faster.

From classical bits to quantum information

A classical bit is either 0 or 1. A qubit is a physical quantum system whose state can be described as a combination of two basis states, conventionally written |0⟩ and |1⟩. The state is often represented as α|0⟩ + β|1⟩, where α and β are complex amplitudes and |α|² + |β|² = 1. When measured in this basis, the qubit returns 0 with probability |α|² or 1 with probability |β|².

This is not simply a bit that secretly stores both answers and reveals whichever one is wanted. Measurement produces one result, and it generally changes the measured state. A quantum algorithm must arrange amplitudes so that useful outcomes become more likely. Repeating a computation may be necessary to estimate those probabilities.

Qubits can be implemented in different physical systems, including superconducting circuits, trapped ions, photons, and neutral atoms. These approaches differ in how they create, control, connect, and measure qubits. No single hardware design removes the fundamental challenges of noise and scaling.

Superposition, phase, and entanglement

Superposition refers to the combination of basis states in a quantum state. The amplitudes have both magnitude and phase, and phase is essential: two computational paths can reinforce or cancel one another. This interference is the central resource behind many quantum algorithms. It is why a quantum computer is not just a machine that tries every answer at once.

For multiple qubits, the state space grows rapidly. Two qubits have four computational basis states—|00⟩, |01⟩, |10⟩, and |11⟩—and n qubits have 2ⁿ basis states. A general state can assign amplitudes across those possibilities, but that does not mean a user can read all 2ⁿ values from one measurement.

Entanglement is a form of correlation between quantum systems that cannot be explained by treating each system as having its own independent state. It is useful in quantum computation and communication, but it does not permit faster-than-light messaging. Entanglement and interference are resources to be engineered, not automatic sources of computational advantage.

How quantum circuits work

A quantum circuit is a sequence of operations applied to qubits. The circuit model begins by preparing qubits, applies gates, and then measures selected qubits to produce classical bits. Gates are usually reversible transformations; common examples include:

Hadamard gate: creates an equal-amplitude superposition from |0⟩ or |1⟩.
Pauli-X gate: flips |0⟩ and |1⟩, much like a classical NOT operation on basis states.
Phase gates: change relative phases, affecting how paths interfere.
CNOT gate: flips a target qubit when a control qubit is 1; combined with other gates, it can create entanglement.

For example, applying a Hadamard gate to the first qubit of |00⟩ and then a CNOT controlled by that qubit creates (|00⟩ + |11⟩)/√2. Measuring both qubits yields either 00 or 11, each with probability one half. The outcomes are correlated, but a single run does not reveal both components of the superposition.

Real devices execute physical operations that approximate these abstract gates. Gates, state preparation, and measurement all have errors. Circuits are often repeated many times, or “shots,” to estimate output probabilities. Circuit depth—the number of sequential gate layers—matters because errors can accumulate as the computation runs.

What quantum algorithms can do

Quantum algorithms are specialized procedures, not universal shortcuts. Their advantage depends on the problem, the available hardware, and the comparison with the best classical methods.

Shor’s algorithm factors integers and solves the discrete logarithm problem in polynomial time on a sufficiently large, fault-tolerant quantum computer. This is relevant to some widely used public-key cryptography, but existing noisy machines are not capable of running the required large, error-corrected computations.
Grover’s algorithm searches an unstructured space of N possibilities with a query count proportional to √N, rather than N in the classical worst case. This is a quadratic improvement, not an exponential one, and the full cost depends on how the search is implemented.
Quantum simulation uses quantum systems to model other quantum systems. It is a promising application because classical simulation can become difficult as system size grows, though practical useful demonstrations remain an engineering challenge.
Other areas, such as optimization and machine learning, are active research topics. A quantum approach is not automatically faster or more accurate; evidence of advantage must include realistic data loading, hardware costs, and a fair classical comparison.

Noise, error correction, and practical limits

Qubits are fragile. Interaction with the environment can cause decoherence, while imperfect control introduces gate errors and measurement errors. A computation that is too deep may accumulate enough error to make its output unreliable. Increasing the number of physical qubits alone does not guarantee a more useful machine.

Quantum error correction addresses this by encoding one logical qubit across many physical qubits and detecting error syndromes without directly measuring and destroying the encoded information. The overhead can be substantial: a useful fault-tolerant computer may require many physical qubits per logical qubit, along with high-quality operations, reliable control, and continual error correction. The exact resources depend on the hardware error rates and the task.

Current noisy intermediate-scale devices can run experiments and small circuits, but they have limited scale and coherence. Their results may be valuable for research, yet a result on a quantum processor is not, by itself, proof that the processor beats classical computation for a useful real-world task. Classical computers remain essential for compiling circuits, controlling hardware, checking results, and solving most everyday computing problems.

Quantum computers compared with classical computers

Quantum computers do not replace classical computers. A classical machine is usually the better choice for routine tasks such as writing documents, browsing, most data processing, and ordinary arithmetic. Quantum hardware is a specialized accelerator that may help with certain computational structures once the necessary scale and error control are available.

It is also misleading to say that quantum computers “try every answer at once.” A quantum state can involve many amplitudes, but measurement gives limited information. Algorithms succeed by using carefully designed operations to make desired outcomes more likely, and their performance must be evaluated against classical algorithms, including improvements made over time.

Frequently Asked Questions

What is a qubit in simple terms?
A qubit is a quantum information unit that can be in a superposition of two reference states. Measurement returns a classical result, usually 0 or 1, with probabilities determined by its state.

Can quantum computers solve every problem faster?
No. Known advantages apply to specific problem types and algorithms. Many tasks have no demonstrated quantum speedup, and the overhead of preparing data and correcting errors can outweigh theoretical gains.

Are quantum computers faster than supercomputers today?
Not for general-purpose work. Quantum devices can perform specialized experiments, but practical advantage requires a meaningful task, a fair classical comparison, and reliable results—not merely a large number of qubits.

Will quantum computers break encryption?
A sufficiently large, fault-tolerant quantum computer running Shor’s algorithm could threaten some public-key systems based on factoring or discrete logarithms. Current machines do not have the scale and error correction required for that task. Cryptographic systems are also adopting post-quantum approaches designed to resist known quantum attacks.

What is the difference between a physical and logical qubit?
A physical qubit is a hardware component. A logical qubit is an error-corrected unit encoded across multiple physical qubits so that errors can be detected and corrected while preserving the computation.

What to watch as the field develops

Useful progress depends on more than qubit count. Important measures include gate and measurement fidelity, connectivity, circuit depth, error-correction performance, and whether a system can complete a meaningful task with results that can be checked. For readers assessing a claim of quantum advantage, the key questions are what problem was solved, what classical baseline was used, how errors and repetitions were handled, and whether the result has practical value.

Method: the standard formula for this calculation, rounded as each result states. See how the calculators work or report an error.