
A quantum computer is a device that uses quantum bits to perform computations leveraging superposition and entanglement.A quantum computer uses qubits, which, thanks to superposition, can be in a linear combination of states (0 and 1). Entanglement creates nonlocal connections between qubits. Sequences of quantum gates — reversible logical operations — transform the states. Measurement destroys the superposition, yielding a single result; thus algorithms (such as Shor's for factorization or Grover's for search) aim to maximize the probability of the correct answer.
The concept of quantum computing was independently proposed by Yuri Manin (1980) and Richard Feynman (1981). In 1985, David Deutsch created a model of a universal quantum computer. Shor's algorithm (1994) for factoring numbers attracted attention due to the threat to RSA encryption. Grover's algorithm (1995) accelerates search. Experiments evolved from 2-qubit NMR schemes to ion traps and superconducting qubits. In 2012, the Nobel Prize was awarded to Serge Haroche and David Wineland for the manipulation of individual quantum systems.
The evolution of the qubit state vector in Hilbert space is described by the Hamiltonian. The initial state (usually |0...0⟩) is sequentially transformed by unitary gates, which create superposition and entangle the qubits. Algorithms such as the quantum Fourier transform adjust the amplitudes so that interference amplifies the target state. Measurement yields one of the outcomes with probability |amplitude|². The no-cloning theorem guarantees that an unknown quantum state cannot be exactly copied, which is fundamental for protocol security.
Simulating molecules for new drugs, financial optimization, breaking cryptographic ciphers.
A quantum computer does not explicitly try all possibilities, as often thought. It manipulates probability amplitudes, which interfere: the waves of incorrect answers cancel each other out, while the correct one is amplified.
















