Portfolio · Written for this search · quantum-computer
Quantum Computer
Computation desk
A quantum computer is a machine that stores information in quantum states and changes it with controlled operations. The Computation desk treats it as a model of computation first and a piece of hardware second.
- Prepare qubits
- Apply gates
- Noise accumulates
- Measure
- Sample results
- Classical processing
What the machine is
A classical bit is 0 or 1. A qubit is described by amplitudes over both values. Several qubits are described together, and the number of amplitudes grows exponentially with the number of qubits.
Programs are written as sequences of gates acting on those qubits. The desk keeps this description in the quantum circuit model. It is the common language for algorithms, compilers and hardware alike.
Why it is hard to check
Small circuits can be checked on ordinary machines. The desk uses state-vector simulation, which stores every amplitude and so runs out of memory quickly as qubits are added. Where circuits have limited entanglement, tensor-network contraction can reach further.
Neither method scales without limit. That is part of the case for building the hardware. It is also why verification of large machines remains an open problem, and this note does not claim to resolve it.
What limits use
A quantum computer does not hand back its amplitudes. Reading it out is a measurement, and each run gives one outcome. Answers come from repeated runs, as covered in measurement and sampling. Real devices also drift and decohere, so noise and error set how deep a circuit can usefully go.
In practice the quantum part is a coprocessor. A classical system prepares jobs, collects samples and decides what to run next, an arrangement described under hybrid execution. The desk's view is that the system around the device matters as much as the device.
Finding from this desk
The useful question is not whether a quantum computer is faster in general. It is which tasks have a structure that quantum operations can exploit, and what it costs to read the answer out. This note records no benchmark and claims no speed-up.