Quantum Computer · aiwiki.page

A quantum computer is a computer that processes information encoded in controllable quantum systems according to quantum mechanics. Its basic information unit is the qubit, rather than the classical bit. Quantum operations exploit superposition, entanglement, and interference to implement computations. For particular problems, quantum algorithms offer advantages over known classical methods; this does not mean that quantum computers are faster for every task or can efficiently examine every possible answer. (nist.gov)

Information and computation

A classical bit takes the value 0 or 1. A qubit has two computational basis states, written $|0\rangle$ and $|1\rangle$ , and a general pure state

|\psi\rangle=\alpha|0\rangle+\beta|1\rangle, \qquad |\alpha|^2+|\beta|^2=1.

The amplitudes $\alpha$ and $\beta$ are complex numbers. Under measurement in this basis, the Born rule assigns probabilities $|\alpha|^2$ and $|\beta|^2$ to the outcomes 0 and 1. Relative phase distinguishes quantum superposition from an ordinary uncertainty about a classical bit. Operations can turn phase differences into different measurement outcomes. (learning.quantum.ibm.com)

An $n$ -qubit register has $2^n$ computational basis states. Its state can contain amplitudes for all of them, and entangled states cannot generally be described by assigning an independent pure state to each qubit. However, measurement does not reveal this entire amplitude list: a computational-basis measurement produces one bit string. Useful algorithms arrange interference so that measurement extracts relevant information with sufficiently high probability. The exponentially large state description alone does not guarantee an exponential computational advantage. (nist.gov)

Computational models

In the gate-based model, a program consists of state preparation, a sequence of quantum gates, and measurements. Ideal gates perform unitary transformations, mathematically represented by matrices. Single-qubit gates change individual states, while suitable two-qubit gates generate entanglement. A universal gate set can approximate arbitrary unitary computations to a specified accuracy. Circuit depth describes the number of sequential operation layers and matters because errors accumulate during execution. (quantum.cloud.ibm.com)

Classical equipment remains essential: it controls the processor, organizes execution, and interprets measurement results. Programs commonly run repeatedly, with each execution called a shot, to estimate output distributions rather than infer them from one measurement. Compilation must accommodate hardware-specific gates and connectivity, which can introduce additional operations. (quantum.cloud.ibm.com)

Other approaches include analog quantum simulation, in which a controllable quantum system reproduces aspects of another system, and quantum annealing, which is investigated for optimization problems. An annealing device should not automatically be equated with a universal gate-based computer; its computational capabilities depend on its controls and architecture. (nist.gov)

Algorithms and potential applications

The importance of quantum computing is established most clearly through specific algorithms. Introduced in 1994, Shor’s algorithm solves integer factorization and discrete logarithm problems in time polynomial in the input length on an ideal quantum computer. No comparably efficient classical algorithms are known for these general problems. This creates implications for cryptography based on their presumed classical difficulty, although executing attacks at relevant scales requires sufficiently capable, reliable hardware. (nist.gov)

Grover’s algorithm, published in 1996, provides a different advantage: unstructured search among $N$ possibilities requires on the order of $\sqrt{N}$ oracle queries rather than order $N$ classical queries. This is a quadratic improvement, not an exponential one. The query count also does not eliminate the cost of implementing the oracle that recognizes a desired result. (arxiv.org)

Simulation of quantum matter is another major application area. Molecular and many-particle systems can be difficult to represent and evolve using classical methods, whereas quantum processors can encode their quantum degrees of freedom more directly. Proposed uses include calculating molecular properties and studying materials. Whether a particular calculation offers a practical advantage depends on the complete algorithm, required accuracy, hardware errors, and competing classical techniques. Quantum computing therefore concerns problem-specific computational complexity, not a general increase in computer speed. (nist.gov)

Physical implementations

Several physical platforms implement qubits:

Superconducting qubits use quantized states of fabricated electrical circuits operated at very low temperatures.
Trapped-ion qubits use internal states of charged atoms confined by electromagnetic fields.
Neutral-atom qubits use uncharged atoms held in optical traps.
Photonic qubits encode information in properties of photons, controlled through optical components and detected through measurement.
Semiconductor qubits can use electron states confined in structures made from materials such as silicon. (nist.gov)

These approaches differ in coherence, operation speed, connectivity, measurement, and engineering requirements. Scaling involves not merely adding qubits but maintaining precise control and reliable interactions across the system. (nist.gov)

Errors and reliability

Interaction with the environment causes quantum decoherence, while imperfect preparation, gates, and readout introduce additional errors. Quantum error correction encodes a logical qubit across multiple physical qubits. Measurements of auxiliary systems provide error information without directly measuring the encoded logical state. Fault-tolerant procedures must also prevent faulty correction operations from spreading unmanageable errors. (ibm.com)

Codes such as the surface code illustrate the trade-off between protection and physical-resource overhead. The number of physical qubits required per logical qubit depends on the code, physical error rates, and target reliability. Consequently, raw qubit count is not a sufficient measure of computational capability. (ibm.com)

The term noisy intermediate-scale quantum computing, popularized by John Preskill in 2018, describes processors whose computational reach is constrained by noise and limited error correction. Demonstrating superiority on a selected benchmark is distinct from achieving useful advantage on a practical application. Evaluation must consider accuracy, execution resources, and the strongest relevant classical comparison. (arxiv.org)