| bit | |
|---|---|
| Name | bit |
| Quantity | Information |
| Introduced | 1948 |
| Units | "Shannon information" |
| Domain | Information theory / Computer science |
bit
A bit is the basic unit of information in information theory and computer science, representing a binary choice between two alternatives. In the context of Quantum physics, the bit forms the conceptual bridge between classical information and quantum information, underpinning notions of entropy, communication limits, and the classical limit of quantum computation. Understanding bits in quantum settings is essential for technologies such as quantum cryptography, quantum error correction, and hybrid classical–quantum systems.
In classical information theory, a bit denotes the amount of information gained when distinguishing between two equally likely alternatives, formalized by Claude Shannon in his 1948 paper "A Mathematical Theory of Communication". The bit is tied to the Shannon entropy H = −∑ p_i log_2 p_i, where an unbiased binary variable has H = 1 bit. The bit is also the unit used in channel capacity calculations such as the Shannon–Hartley theorem and in measures like mutual information I(X;Y) between random variables. Classical models of computation such as the Turing machine and practical devices like the transistor operate by manipulating bits according to logical gates including NOT, AND, and OR.
Classical bits are physically realized by two distinguishable states of a medium: voltage levels in CMOS circuits, magnetic orientations in magnetic storage, or pits on optical disc surfaces. Fundamental limits on bit storage and processing invoke thermodynamic principles such as Landauer's principle, which connects information erasure to heat dissipation (k_B T ln 2 per erased bit). Implementations rely on fabrication and standards from organizations like Intel, IBM, and fabrication facilities such as fabs and university laboratories (e.g., MIT, Stanford University). Error rates and reliability are quantified by concepts like bit error rate used in telecommunications and digital memory systems.
In quantum contexts a classical bit contrasts with the qubit, the quantum analogue that can exist in superpositions of |0⟩ and |1⟩. While a bit is represented by a definite state, a qubit's state space is described by the Bloch sphere and governed by quantum superposition and quantum entanglement. The conversion between classical bits and qubits appears in protocols such as quantum teleportation, which consumes classical bits to transmit quantum states, and in quantum key distribution protocols like BB84 where classical bits encode measurement outcomes. Distinctions between classical bits and qubits are formalized in frameworks by researchers and institutions including Peter Shor and Paul Benioff who contributed to quantum computing theory, and experiments at facilities such as IBM Quantum and Google Quantum AI.
Quantum information theory generalizes classical information measures to incorporate quantum states: von Neumann entropy S(ρ) plays the role of Shannon entropy for density matrices ρ. Classical bits remain central as inputs, outputs, and control signals in quantum algorithms such as Shor's algorithm and Grover's algorithm, which nevertheless exploit qubits for speedup. Hybrid architectures combine classical processors (CPUs) and quantum processors (QPUs) in proposals like quantum annealing (e.g., D-Wave Systems) and gate-based systems from research labs at University of California, Berkeley and national labs such as Los Alamos National Laboratory. Resource accounting in quantum computation distinguishes between qubit count, quantum gate depth, and the required number of classical bits for measurement, feedforward, and error correction syndromes (e.g., in surface code implementations developed by groups at Microsoft Research and Caltech).
Measurement maps quantum states to classical information—typically bits—via projective measurements or positive operator-valued measures (POVMs). The process is constrained by the no-cloning theorem and by decoherence, the environment-induced loss of phase coherence described in models by Wojciech Zurek and others. Decoherence leads to the emergence of preferred pointer states and effectively classical outcomes, a topic studied in decoherence theory and experiments in ion trap and superconducting qubit platforms. The quantum-to-classical transition is explored through criteria like quantum Darwinism and is relevant for implementing reliable readout mechanisms that translate qubit observables into robust classical bits for subsequent processing by classical controllers.
Information measures connect bits and quantum systems: the von Neumann entropy S(ρ) is measured in bits when using log base 2, and quantum mutual information I(A:B) = S(A)+S(B)−S(AB) quantifies total correlations between subsystems. Operational tasks relate these measures to bits: quantum source coding (Schumacher compression) yields qubit rates analogous to classical source coding limits, while classical data transmission capacities—such as the Holevo bound—limit the amount of classical information (bits) extractable from quantum ensembles prepared by parties like in quantum communication experiments. Studies by institutions including Perimeter Institute and publications in journals like Physical Review Letters and Nature Physics formalize trade-offs between classical bits, qubits, and entanglement as resources in tasks such as state discrimination, entanglement-assisted communication, and quantum channel capacity assessments.
Category:Information theory Category:Quantum information theory Category:Units of information