Home › Science › Physics › Quantum Computing › Qubit

Qubit

Quantum bit • The fundamental unit of quantum information
Quantum Mechanics Information Theory Computing Last updated: March 2025
Contents

1. Definition & Overview

A qubit (short for quantum bit) is the fundamental unit of quantum information in quantum computing and quantum communication. Unlike a classical bit, which exists in one of two definite states (0 or 1), a qubit can exist in a superposition of both states simultaneously, described by complex probability amplitudes[1]. This property, alongside entanglement and interference, enables quantum computers to process information in ways that are fundamentally distinct from classical architectures[2].

The concept was formalized in the early 1980s by physicists Richard Feynman and Yuri Mann, who recognized that simulating quantum systems classically becomes exponentially intractable as system size grows[3]. Today, qubits form the backbone of emerging quantum technologies, including cryptographic protocols, optimization solvers, and quantum simulation platforms.

2. Mathematical Representation

State Vector & Superposition

A single qubit state |ψ⟩ is represented as a normalized vector in a two-dimensional complex Hilbert space. In the computational basis {|0⟩, |1⟩}, it is expressed as:

|ψ⟩ = α|0⟩ + β|1⟩, where |α|² + |β|² = 1

Here, α and β are complex numbers known as probability amplitudes. The squared magnitudes |α|² and |β|² represent the probabilities of measuring the qubit in state |0⟩ or |1⟩, respectively[4].

Multi-Qubit Systems

For n qubits, the state space grows exponentially to 2ⁿ dimensions. A two-qubit system is described by:

|ψ⟩ = α₀₀|00⟩ + α₀₁|01⟩ + α₁₀|10⟩ + α₁₁|11⟩

This exponential scaling is the primary source of quantum computational advantage for certain algorithms, such as Shor's factoring algorithm and Grover's search algorithm[5].

3. Physical Implementations

Qubits are not abstract entities alone; they must be physically realized using quantum systems with two addressable energy states. Major hardware approaches include:

  • Superconducting circuits: Utilize Josephson junctions to create artificial atoms. Used by IBM, Google, and Rigetti. Operate at ~10 mK.[6]
  • Trapped ions: Employ electromagnetic fields to suspend charged atoms (e.g., Yb⁺, Ca⁺). Internal electronic states encode qubits. Notable for high coherence and gate fidelity.[7]
  • Photonic qubits: Encode information in polarization, time-bin, or path degrees of freedom of single photons. Ideal for quantum communication and room-temperature operation.[8]
  • Semiconductor spin qubits: Leverage electron or nuclear spins in quantum dots or diamond NV centers. Highly scalable with existing CMOS fabrication.[9]

No single modality currently dominates; research focuses on balancing coherence time, gate speed, connectivity, and manufacturability.

4. Applications in Quantum Computing

Qubits enable computational paradigms impossible classically:

  • Cryptanalysis: Shor's algorithm can factor large integers exponentially faster than classical methods, threatening RSA and ECC cryptography[10].
  • Quantum Simulation: Modeling molecular dynamics, high-Tc superconductors, and chemical reactions with precision unattainable classically[11].
  • Optimization & Machine Learning: Quantum approximate optimization algorithms (QAOA) and variational quantum eigensolvers (VQE) tackle combinatorial and parameter-heavy problems[12].
  • Quantum Networks: Entangled qubits enable quantum key distribution (QKD) and teleportation protocols for theoretically secure communication[13].

5. Challenges & Decoherence

Despite rapid progress, practical quantum computing faces significant hurdles:

  • Decoherence: Interaction with the environment collapses superposition, destroying quantum information. Coherence times range from microseconds to seconds depending on hardware[14].
  • Error Correction: Quantum error correction (e.g., surface codes) requires hundreds to thousands of physical qubits per logical qubit to suppress errors below thresholds[15].
  • Scalability & Interconnects: Wiring, cooling, and control infrastructure become bottlenecks beyond ~1,000 qubits. Modular architectures and photonic interconnects are active research areas[16].

Industry and academia aim to reach fault-tolerant, million-qubit systems by the 2030s, though timelines remain contested.

References

  1. Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.
  2. Shor, P. W. (1994). "Algorithms for quantum computation: Discrete logarithms and factoring". STOC '94. doi:10.1145/195018.195024
  3. Feynman, R. P. (1982). "Simulating physics with computers". International Journal of Theoretical Physics, 21(6), 467–488.
  4. Preskill, J. (1998). "Lecture Notes for Physics 219: Quantum Information and Computation". Caltech.
  5. Grover, L. K. (1996). "A fast quantum mechanical algorithm for database search". STOC '96.
  6. Devoret, M. H., & Schoelkopf, R. J. (2013). "Superconducting circuits for quantum information: an outlook". Science, 339(6124), 1169–1174.
  7. Monroe, C., & Kim, J. (2013). "Scaling the ion trap quantum computer". Science, 339(6124), 1164–1169.
  8. Boschi, D., et al. (1998). "Realization of a photonic quantum circuit for quantum computation". Nature, 393, 677–679.
  9. Vandersypen, L. M. K., et al. (2017). "Interfacing spin qubits in quantum dots and donors—hot, dense, and coherent". Nature Electronics, 1, 438–446.
  10. Shor, P. (1997). "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer". Siam Journal on Computing, 26(5), 1484–1509.
  11. Aspuru-Guzik, A., et al. (2005). "Simulated quantum computation of molecular energies". Science, 309(5723), 1704–1707.
  12. Farhi, E., et al. (2014). "A quantum approximate optimization algorithm". arXiv:1411.4028.
  13. Bennett, C. H., & Brassard, G. (1984). "Quantum cryptography: Public key distribution and coin tossing". Proceedings of IEEE International Conference on Computers, Systems and Signal Processing.
  14. Devitt, S. J., et al. (2013). "Quantum error correction for beginners". Reports on Progress in Physics, 76(7), 076001.
  15. Kitaev, A. Y. (2003). "Fault-tolerant quantum computation by anyons". Annals of Physics, 303(1), 2–30.
  16. Arute, F., et al. (2019). "Quantum supremacy using a programmable superconducting processor". Nature, 574, 505–510.