What is Quantum Computing?

Quantum computing in one definition

Quantum computing is computation performed with quantum-mechanical phenomena such as superposition and entanglement. In the ordinary, or classical, model, information is represented with bits and processed by operations that transform those bits. In the quantum model, information is represented by quantum states and manipulated by quantum operations. The two models are not mutually exclusive in a practical system: quantum computers are hybrids of quantum and classical computational units, and important algorithms can alternate between quantum and classical steps.1

The phrase “quantum computer” describes a computing model, not a guarantee of speed. A common misconception is that quantum computers are faster than conventional CPUs and GPUs in all areas. The cited evidence explicitly rejects that claim: like GPUs, which outperform general-purpose CPUs on particular types of problems, quantum computers are expected to excel only on a niche set of problems. The useful question is therefore not whether a quantum computer is universally faster, but whether a particular quantum algorithm offers an advantage for a particular task.1

Qubits: the basic unit of quantum information

The basic physical unit in a quantum computer is the physical qubit. It is the quantum counterpart of the classical bit, but the analogy has limits. A classical bit is represented as either 0 or 1. A qubit is a quantum state that can be prepared and transformed so that measurement has different probabilities of producing 0 or 1. The state is described mathematically by amplitudes associated with those possible outcomes. Those amplitudes, rather than a list of simultaneously readable classical values, are what a quantum circuit manipulates.1

Superposition is the property that permits a qubit to have a state involving both computational-basis possibilities before measurement. It is often described informally as a qubit being “0 and 1 at once,” but that shorthand can mislead. A measurement does not expose two ordinary bits. It returns a classical result—typically 0 or 1—with probabilities determined by the state immediately before measurement. Quantum algorithms are designed so that useful outcomes become more likely through the controlled evolution of amplitudes.1

Physical qubits are not automatically reliable computational units. The cited terminology distinguishes a physical qubit, which is prone to noise and errors, from a logical qubit, which is a fault-tolerant qubit constructed from multiple physical qubits using quantum error correction. A logical qubit is therefore an effective unit for reliable quantum computation, and the distinction is essential when discussing large-scale capabilities or cryptographic impact.1

Entanglement and interference

Entanglement is a quantum-mechanical relationship between qubits in which the joint state cannot be described as independent states for each qubit. Operations on an entangled register create correlations among possible measurement outcomes. These correlations are not, by themselves, an answer to a computational problem; an algorithm must create, manipulate, and measure them in a way that makes the desired information useful.1

Interference is the mechanism by which a circuit changes the amplitudes associated with possible outcomes. Quantum operations can cause some computational paths to reinforce one another and others to cancel. A useful quantum algorithm therefore does not merely create many possibilities and read them all out. It arranges a sequence of operations so that measurement is more likely to return outcomes containing the desired information. This is why the popular “parallel universes” explanation is incomplete: measurement yields classical information, and the algorithm’s structure determines what information survives with useful probability.1

Quantum circuits, measurement, and classical control

A quantum circuit is a structured sequence of operations applied to one or more qubits. Single-qubit operations can change a qubit’s state; multi-qubit operations can create or use entanglement. The circuit begins with preparation, applies gates in a planned order, and ends with measurement. The measured values are classical data that can be stored, analyzed, or used to decide what happens next.1

Classical control is part of the practical computing model rather than an optional accessory. Classical processors can prepare inputs, configure and schedule quantum operations, collect measurement results, perform calculations, and choose subsequent operations. The cited evidence gives Shor’s algorithm as an example of a combination of quantum and classical computational steps. This hybrid arrangement also helps explain why a quantum computer is not a replacement for every conventional computer: classical systems remain responsible for substantial control, data handling, and interpretation.1

A circuit is generally run repeatedly because individual measurements are probabilistic. The resulting collection of classical outcomes can be analyzed to estimate the distribution produced by the circuit. The source set does not provide a general performance guarantee, qubit count, or hardware comparison for current systems, so claims about a particular device’s speed, scale, or practical advantage require separate evidence.1

Quantum and classical computation compared

Classical and quantum computers both transform inputs into outputs, but they represent and process information differently. Classical computation uses bits and conventional logical operations. Quantum computation uses qubits, quantum operations, and measurement, with classical control coordinating the overall procedure. A quantum processor can be part of a larger hybrid system rather than an isolated replacement for a CPU.1

The comparison should not be reduced to “classical is slow and quantum is fast.” The evidence says that quantum computers have a niche set of problems on which they may excel. Whether an advantage exists depends on the algorithm, the input, the required accuracy, the cost of preparing data, the cost of measuring results, and the reliability of the hardware. The cited passages do not establish a universal speedup or identify a complete list of problems for which quantum systems are advantageous.1

Why quantum computing matters to cryptography

The cryptographic relevance follows from the computing model, but it is narrower than the general subject. A CRQC is defined as a quantum computer with sufficient logical qubits to break traditional asymmetric algorithms within a practical timeframe. Traditional public-key cryptography includes key-establishment and digital-signature algorithms based on integer factorization or discrete logarithms over finite fields or elliptic curves. The cited evidence states that these algorithms are vulnerable to attacks using quantum computers, although existing quantum computers are not large enough to threaten currently deployed algorithms.123

This distinction matters because “a quantum computer exists” and “a CRQC can break deployed public-key cryptography” are different statements. Current systems are described in the evidence as experimental, and large-scale quantum computers that can break widely used asymmetric algorithms are not yet available in the cited RFC passage. The existence of research progress does not establish that a particular present-day system can perform a cryptographically relevant attack.21

The threat can also be long-term. An adversary may record encrypted communications today and attempt to decrypt them later if a suitable quantum computer becomes available; this is commonly called “harvest now, decrypt later.” The urgency of preparation therefore depends not only on when a CRQC might appear, but also on how long information must remain confidential and how long an organization’s cryptographic transition will take.45

The relevant defense is post-quantum cryptography, or PQC: cryptographic algorithms designed to resist attacks from both classical and quantum computers. PQC is not the same as quantum cryptography. The cited evidence describes PQC as based on mathematical techniques and distinguishes it from quantum cryptography, which is based fundamentally on quantum physics. PQC algorithms may still be attacked in the future; “post-quantum” describes their intended security properties, not an absolute promise that they can never be compromised.67

NIST’s cited materials identify three finalized standards released in 2024: FIPS 203 for a module-lattice-based key-encapsulation mechanism, FIPS 204 for a module-lattice-based digital signature algorithm, and FIPS 205 for a stateless hash-based signature algorithm. The evidence also says that organizations should begin identifying vulnerable uses and planning migration, while noting that the cited NIST IR 8547 document is an initial public draft and preserves that status and uncertainty.84

What this introduction does not establish

This article explains the model and the cryptographic distinction at an introductory level. It does not establish when a CRQC will be built, how many physical or logical qubits a particular attack requires, or which current quantum hardware will achieve fault-tolerant operation. The evidence states that large-scale CRQCs do not yet exist and that the true state of privately conducted quantum research may be difficult to assess. Predictions about dates and hardware capability should therefore be treated as uncertain rather than as settled facts.21

It also does not imply that every encryption system is affected in the same way. The cited evidence specifically emphasizes distinguishing symmetric algorithms from public-key algorithms and focuses on the risk to traditional public-key key establishment and digital signatures. A complete cryptographic risk assessment must examine the algorithms, protocols, data lifetimes, implementation constraints, and transition requirements of the particular system.23

Conclusion

Quantum computing uses qubits and quantum operations to manipulate quantum states, with superposition, entanglement, interference, and measurement forming the central concepts. Practical systems combine quantum processors with classical control, and their potential advantage is problem-specific rather than universal. The cryptographic issue is more specific still: a future CRQC with enough reliable logical qubits could threaten traditional public-key algorithms, while current systems are not large enough for that threat according to the cited evidence. Understanding this distinction provides the foundation for evaluating post-quantum cryptography and migration planning without confusing experimental quantum computing with a cryptographically relevant capability.1267