What makes computing quantum?

Quantum computers are often described as one of the most groundbreaking and promising technologies of the future. But we often do not really understand what this “quantum” actually refers to. Classical processors are built from transistors, and transistors themselves rely on discoveries from quantum mechanics. Still, no one calls ordinary processors quantum computers.

It's also not about greater speed, more advanced hardware, or the ability to check many answers at once. The real difference lies elsewhere: in a different way of encoding and processing information.

TL;DR

• Quantum computing differs from classical computing not only in technology, but above all in how information is represented and processed.
• Its quantum character comes from the fact that information is represented using quantum states and evolves according to the laws of quantum mechanics.
• Superposition, interference, and measurement play a central role.
• Quantum computers are not replacements for classical computers.

We talk about computation when some input data, or an initial state, is transformed into output data, or a final state, according to a set of state-transformation rules, which we call operations.

Classical computation is based on processing information encoded as bits, with each bit having the value 0 or 1. The initial state of a system is described using strings of zeros and ones, and a classical processor transforms those strings very quickly using logic gates such as OR and AND. The result of these operations can be read from memory as many times as needed.

Quantum computers require a different way of describing and processing information. They use quantum states, which obey the laws of quantum mechanics. The basic unit of information in quantum computing is the qubit, short for quantum bit.

The state of a qubit is described by a superposition, that is, a linear combination of the values 0 and 1: |ψ⟩ = α|0⟩ + β|1⟩.

Here, each value appears with a certain probability amplitude, denoted by α and β. In other words, while the state of a classical bit is determined by one of two values, the state of a qubit is described by a pair of complex numbers that specify the combination of the 0 and 1 states.

A qubit takes the value 0 or 1 when it is measured.

The operations used to transform the state of the system also change. Quantum computation uses quantum gates, which represent reversible operations. Each gate has an inverse, so we can, in principle, restore the previous state of the system, as long as no measurement has been performed.

Information can therefore evolve in a way that goes beyond the classical paradigm.

That is why quantum computing is not an improved version of classical computing, but a different model of information processing. What changes is not only the hardware, but also, and more importantly, the representation of information and the rules by which the state of the system is transformed.

The state of a qubit is described by superposition, meaning a linear combination of 0 and 1 with specific probability amplitudes. These amplitudes can be strengthened through constructive interference or weakened through destructive interference. This makes it possible to increase the probability of obtaining desired results.

Where do the greater capabilities of quantum computers come from?

In a classical 3-bit system, there are 8 possible configurations of zeros and ones. At any given moment, however, a classical register has exactly one of those values, for example 010 or 111.

In a quantum system, 3 qubits also have 8 basis states. The difference is that, before measurement, the state of such a register can be a superposition of all those basis states. We describe it using 8 complex amplitudes, each assigned to one basis state.

Superposition alone, however, does not speed up computation.

In the classical model, reading the result is straightforward, at least at a certain level of abstraction: we check the final state of the system and simply learn what it is. In the quantum model, the situation is completely different.

Measuring the final state of a quantum system would produce a random outcome, while in computation we usually want a precisely defined result. The advantage appears only when we design operations so that the amplitudes of correct solutions are amplified and the amplitudes of incorrect ones are suppressed. That is why we talk about speedups for specific problems, for which such operations can be designed.

Quantum computers can easily capture the imagination, so it is worth being clear about what the word “quantum” does not mean.

“Quantum” does not mean unconditionally faster

Quantum computers do not offer an advantage for every solution to every problem, and they do not replace classical computers in all applications. Their importance lies in the fact that, for certain classes of problems, they can gain a computational advantage by exploiting the properties of quantum states. Classic examples include Shor’s algorithm and Grover’s algorithm.

“Quantum” does not mean all-powerful

Quantum computation operates within a specific physical model. That model creates certain possibilities, but it also imposes its own limitations.

“Quantum” does not simply mean more advanced

The difference is not just that a quantum computer is harder to build. The core issue is a change in the model used to describe information and the process of computation itself.

So what does it really mean for computing to be quantum? It means that information is not represented and processed only in a classical way, but through quantum states whose evolution is described by the laws of quantum mechanics. In such a model, superposition, interference, and measurement matter.

Simulating molecules, atoms, or materials means describing systems that are naturally quantum. A classical computer has to model these quantum elements, which leads to exponential growth in complexity as the system grows. A quantum computer does not need to simulate such systems from the outside in the same way. It operates according to the same underlying rules, so the scale of the problem can grow much more gently.

By contrast, tasks such as editing text, browsing the internet, or typical data processing are problems that are:

• discrete,
• well described by classical logic,
• based on clearly defined error behavior.

They do not contain a quantum structure that can be exploited algorithmically, so a quantum computer does not provide a justified advantage for them.

If we want to really understand how quantum computers work, we should not start with the most catchy slogans. We should start with the nature of computation itself. The difference between the classical and quantum models is not only about hardware or the promise of faster computation. It concerns how information is represented, how the state of a system can change, and how we obtain the result.

Catch me on Instagram at @qubic.blog and let’s talk!

1. Why is it not enough to say that a quantum computer is simply faster?
2. How does the classical description of information differ from the quantum description?
3. How does quantum computing relate to classical computing in practical applications?

1. Deutsch, D. (1985). “Quantum theory, the Church–Turing principle and the universal quantum computer.” Proceedings of the Royal Society A, 400(1818), pp. 97–117.
2. Grover, L. K. (1996). “A fast quantum mechanical algorithm for database search.” arXiv:quant-ph/9605043.
3. Mermin, N. D. (2007). Quantum Computer Science: An Introduction. Cambridge: Cambridge University Press.
4. Nielsen, M. A. and Chuang, I. L. (2010). Quantum Computation and Quantum Information. 10th Anniversary Edition. Cambridge: Cambridge University Press.
5. Preskill, J. Lecture Notes for Quantum Information and Computation. California Institute of Technology.
6. Shor, P. W. (1995). “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.” arXiv:quant-ph/9508027.