Skip to content

Quantum-Software-Development/QuantumComputing-Timeline-Formulas

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

[🇧🇷 Português] [🇺🇸 English]


🇶 Quantum Computing Timeline with Key Contributions and Formulas

Sponsor Quantum Software Development





This repository is a heartfelt tribute to the pioneers of quantum mechanics and computing, whose brilliance and vision have illuminated the path to one of humanity’s most profound scientific revolutions. It serves as both a beacon and a foundation for those eager to explore the intricacies of quantum computing, showcasing the journey from groundbreaking discoveries to the cutting-edge innovations shaping our future.

Every concept, formula, and historical account presented here has been thoughtfully curated with deep respect for the minds that dared to question the unknown and redefine our understanding of reality. This is not just a repository of knowledge—it is a celebration of human ingenuity, curiosity, and the relentless pursuit of truth.

We invite your contributions and insights, encouraging you to join us in this collaborative endeavor to honor the legacy of these great thinkers and push the boundaries of quantum exploration.

Feel free to explore, learn, and contribute by adding information, corrections, or ideas—because the future of quantum computing is not shaped by individuals, but by a collective spirit of innovation and determination. This repository welcomes everyone passionate about quantum computing and bold enough to believe they can change the world.


Together, We Are Stronger. Together, We Will Change the World !


< made with vibe, frequency, and joy /> ⚡️


Table of Contents



Predecessors of Quantum Mechanics

1. Leonhard Euler (1748)
──────────────

Leonhard Euler, one of the most significant mathematicians in history, contributed foundational mathematical principles that would later support the development of quantum mechanics. His work in functions and complex numbers laid the groundwork for modern physics.

  • Developed the Euler's Formula, which links exponential functions to trigonometric functions. It is fundamental in wave mechanics and quantum state representation.

Euler's Formula:

$\huge \color{DeepSkyBlue} e^{i\theta} = \cos(\theta) + i\sin(\theta)$

Where:
- $\large \color{DeepSkyBlue} ( e )$: Base of the natural logarithm.
- $\large \color{DeepSkyBlue} ( \theta )$: Phase angle.
- $\large \color{DeepSkyBlue} ( i )$: Imaginary unit.

Euler's formula is essential for describing quantum wavefunctions and visualizing oscillations in the complex plane.

2. Carl Friedrich Gauss (1809)
──────────────

Carl Friedrich Gauss was pivotal in developing the mathematical framework used in quantum mechanics. His work on number theory and statistics influenced quantum field theory and the statistical interpretation of quantum systems.

Gaussian Distribution Formula:

$\huge \color{DeepSkyBlue} f(x) = \frac{1}{\sqrt{2\pi\sigma^2}} e^{-\frac{(x-\mu)^2}{2\sigma^2}}$


Where:
- $\large \color{DeepSkyBlue}( \mu )$: Mean of the distribution.
- $\large \color{DeepSkyBlue} ( \sigma )$: Standard deviation.
- $\large \color{DeepSkyBlue} ( x )$: Random variable.

This formula is widely used to model measurement uncertainties in quantum mechanics.

3. Joseph Fourier (1822)
──────────────

Joseph Fourier’s development of Fourier analysis allowed quantum mechanics to describe wave functions in terms of frequency components. His work directly relates to the development of quantum mechanics in wave propagation.

  • Developed the mathematical framework for the Fourier Transform, which is foundational in quantum mechanics and quantum computing.

Formula for Fourier Transform:

$\huge \color{DeepSkyBlue} \hat{f}(k) = \int_{-\infty}^{\infty} f(x) , e^{-2\pi i k x} , dx$


Formula for Inverse Fourier Transform:

$\huge \color{DeepSkyBlue} f(x) = \int_{-\infty}^{\infty} \hat{f}(k) , e^{2\pi i k x} , dk$


Where:

  • $\large \color{DeepSkyBlue} f(x)$ is the original function in the spatial domain.
  • $\large \color{DeepSkyBlue} \hat{f}(k)$ is the transformed function in the frequency domain.
  • $\large \color{DeepSkyBlue} ( x )$ represents position, and $\large \color{DeepSkyBlue} k$ represents momentum or frequency.

Relevance in Quantum Mechanics and Computing:]()

  • Quantum Mechanics: Converts wavefunctions between position and momentum spaces.
  • Quantum Computing: Basis for the Quantum Fourier Transform (QFT), essential for algorithms like Shor's factoring algorithm.



II. Early 20th Century – Foundations of Quantum Mechanics


  1. Max Planck (1900)
    ──────────────

    • Founder of quantum theory by introducing the concept of energy quantization.

    Formula for quantized energy:

    $\huge \color{DeepSkyBlue} E = h \cdot f$

    Where:

    • $\large \color{DeepSkyBlue} E$ is the energy of the photon.
    • $\large \color{DeepSkyBlue} h$ is Planck's constant ($6.626 \times 10^{-34} , \text{J·s}$).
    • $\large \color{DeepSkyBlue} f$ is the radiation frequency.

  1. Albert Einstein (1905)
    ──────────────

    • Explanation of the photoelectric effect, which introduced the concept of photons.

    Formula for the photoelectric effect:

    $\huge \color{DeepSkyBlue} E_{photon} = h \cdot f = W + K$

    Where:

    • $\large \color{DeepSkyBlue} W$ is the work function (minimum energy required to remove an electron).
    • $\large \color{DeepSkyBlue} K$ is the kinetic energy of the ejected electron.

  1. Niels Bohr (1913)
    ──────────────

    • Bohr's atomic model with quantized energy levels.

    Formula for the energy levels of the electron in the hydrogen atom:

    $\huge \color{DeepSkyBlue} E_n = -\frac{13.6 , \text{eV}}{n^2}$

    Where:

    • $\large \color{DeepSkyBlue} E_n$ is the energy of level $n$.
    • $\large \color{DeepSkyBlue} n$ is the principal quantum number.

  1. Erwin Schrödinger (1926)
    ──────────────

    • Schrödinger's equation, the foundation of wave mechanics.

    Time-dependent form of Schrödinger's equation:

    $\huge \color{DeepSkyBlue} i\hbar \frac{\partial}{\partial t} \psi(r, t) = \hat{H} \psi(r, t)$

    Where:

    • $\large \color{DeepSkyBlue} \psi(r, t)$ is the wave function of the system.
    • $\large \color{DeepSkyBlue} \hat{H}$ is the Hamiltonian operator.
    • $\large \color{DeepSkyBlue} \hbar$ is the reduced Planck constant.

  1. Werner Heisenberg (1927)
    ──────────────

    • Uncertainty Principle, central to quantum physics.

    Formula for the Uncertainty Principle:

    $\huge \color{DeepSkyBlue} \Delta x \cdot \Delta p \geq \frac{\hbar}{2}$

    Where:

    • $\large \color{DeepSkyBlue} \Delta x$ is the uncertainty in position.
    • $\large \color{DeepSkyBlue} \Delta p$ is the uncertainty in momentum.

  1. Paul Dirac (1928)
    ──────────────

    • Developed the relativistic theory of the electron and contributed to quantum mechanics.

    Dirac equation for relativistic particles:

    $\huge \color{DeepSkyBlue} (i\hbar \gamma^\mu \partial_\mu - mc)\psi = 0$

    Where:

    • $\large \color{DeepSkyBlue} \gamma^\mu$ are the Dirac matrices.
    • $\large \color{DeepSkyBlue} m$ is the mass of the particle.




  1. John von Neumann (1932)
    ──────────────

    • Formalized the mathematics of quantum mechanics and introduced operator theory.

    Formula for the density matrix in Hilbert space:

    $\huge \color{DeepSkyBlue} \rho = \sum_i p_i |\psi_i\rangle \langle\psi_i|$

    Where:

    • $\large \color{DeepSkyBlue} \rho$ is the density matrix.
    • $\large \color{DeepSkyBlue} p_i$ are the probabilities of the quantum states.
    • $\large \color{DeepSkyBlue} |\psi_i\rangle$ are the individual quantum states.

  1. Claude Shannon (1948)
    ──────────────

    • Although Shannon is primarily known for classical information theory, his definition of entropy plays a crucial role in both quantum computing and quantum information theory. Shannon's entropy measures the uncertainty of a random variable, and this concept extends to quantum systems, forming the foundation for quantum information theory.

    Formula for Shannon Entropy (used in quantum information theory):

    $\huge \color{DeepSkyBlue} H = -\sum p_i \log p_i$

    Where:

    • $\large \color{DeepSkyBlue} H$ is the entropy of the system (quantifies uncertainty or information).
    • $\large \color{DeepSkyBlue} p_i$ represents the probability of the $\large \color{DeepSkyBlue} i^{th}$ event or outcome.

  1. John S. Bell (1964)
    ──────────────
  • Introduced Bell's theorem, which provided a way to test the principles of quantum mechanics against local realism using experimentally verifiable inequalities. Bell's theorem demonstrated that no local hidden variable theory can reproduce all the predictions of quantum mechanics.

---cont--

  1. Stephen Wiesner (1970)
    ──────────────

  1. Richard Feynman (1981)
    ──────────────
  • Introduced the idea of quantum computers as simulators for physical systems.

Simplified formula for simulating quantum systems:
$\huge \color{DeepSkyBlue} U(t) = e^{-iHt/\hbar}$

Where:

  • $\large \color{DeepSkyBlue} U(t)$ is the time evolution operator.
  • $\large \color{DeepSkyBlue} H$ is the Hamiltonian of the system.

  1. Gilles Brassard (1984)
    ──────────────
  • Co-founder of the BB84 protocol, the first functional quantum cryptography system. The BB84 protocol is a [quantum key distribution] (QKD) protocol that allows two parties to securely exchange cryptographic keys over a potentially insecure channel. The security of BB84 relies on the principles of quantum mechanics, particularly quantum superposition and the no-cloning theorem.

  • BB84 Protocol Formula:
    The Quantum Bit Error Rate (QBER) is used to measure the efficiency and security of the BB84 protocol by determining the rate of errors that occur during the transmission of quantum bits (qubits). It is calculated as follows:

    $\huge \color{DeepSkyBlue} QBER = \frac{\text{observable error}}{\text{total bits sent}}$

    Where:

    • Observable error refers to the number of bits where the transmitted and received values differ due to noise or eavesdropping.
    • Total bits sent refers to the total number of qubits transmitted during the key distribution process.

    This formula is essential for determining the level of interference and security in quantum communication systems. The lower the QBER, the higher the security of the quantum key distribution process.

  1. David Deutsch (1985)
    ──────────────
  • Proposed the concept of the quantum Turing machine and formulated the first quantum algorithm.

Formulation of Deutsch's Algorithm:
$\huge \color{DeepSkyBlue} |q\rangle = \frac{1}{\sqrt{2}}(|0\rangle + |1\rangle)$

Where:

  • $\large \color{DeepSkyBlue} |q\rangle$ is the superposed state of a qubit.



1990s and 2000s – Consolidation of Quantum Computing

  1. Artur Ekert (1991)
    ──────────────
  • Introduced a quantum encryption protocol based on entanglement.

Formula for entangled states used in encryption:

$\huge \color{DeepSkyBlue} |\Phi^+\rangle = \frac{1}{\sqrt{2}}(|00\rangle + |11\rangle)$

  • $\huge \color{DeepSkyBlue} |\Phi^+\rangle$: Represents the quantum state vector in Dirac notation (also known as bra-ket notation). The state $\huge \color{DeepSkyBlue} |\Phi^+\rangle$ is one of the four Bell states, which are entangled qubit states.

  • $\huge \color{DeepSkyBlue} \frac{1}{\sqrt{2}}$: This normalization factor is necessary to ensure that the total probability of measuring the system is 1. In quantum mechanics, the norm of the state vector (the sum of the squares of the probabilities of possible outcomes) must equal 1.

The formula above represents a prominent entangled state known as a Bell state or maximally entangled state, which is essential in quantum computing theory and quantum cryptography, such as in Artur Ekert's protocol.

  • $\large \color{DeepSkyBlue} |\Phi^+\rangle$: Represents the quantum state vector in Dirac notation (also known as bra-ket notation). The state $|\Phi^+\rangle$ is one of the four Bell states, which are entangled qubit states.

  • $\frac{1}{\sqrt{2}}$: This normalization factor is necessary to ensure that the total probability of measuring the system is 1. In quantum mechanics, the norm of the state vector (the sum of the squares of the probabilities of possible outcomes) must equal 1.

  • $|00\rangle$ and $|11\rangle$: These are the states of the two qubits. The symbol $|00\rangle$ denotes both qubits in the "0" state, and $|11\rangle$ denotes both qubits in the "1" state.

  • $+$: The sum between $|00\rangle$ and $|11\rangle$ indicates that the system is in a superposition of these two states. The Bell state is not a classical state where the system would be either 00 or 11, but rather a superposition of both. This means that when the qubits are measured, they will both have the same value (either both 0 or both 1), but the measurement is probabilistic until the observation occurs.

This state is an example of quantum entanglement. Entanglement is a phenomenon where two particles (or qubits, in the case of quantum computing) are correlated in such a way that the state of one particle (qubit) instantaneously affects the state of the other, regardless of the distance between them.

In quantum cryptography, this state is used to ensure the security of communications because any attempt to intercept the entangled qubits alters their state, which can be detected by the person sending the message.

----CONT___ ⬇︎







This repository thrives on collaboration! Whether you're a quantum computing expert or just getting started, your contributions are valuable.

Ways to Contribute:

  • Add Information: Share new discoveries or advancements in quantum computing.
  • Improve Content: Help us fix errors or enhance existing material.
  • Share Ideas: Submit new concepts or resources that could advance the field.
  • Contribute Code: Share algorithms or code snippets related to quantum computing.
  • Correct Mistakes: Point out any inaccuracies to keep the content reliable.
  • Add References: Provide relevant research papers or books to enrich the repository.

How to Submit:

  1. Fork the repository.
  2. Make changes locally.
  3. Submit a pull request with a clear description of your contributions.

Guidelines:

  • Be respectful and collaborative.
  • Ensure your changes are clear and well-documented.
  • Follow coding standards if contributing code.
  • Stay focused on quantum computing.

Together, we can shape the future of quantum computing. Every contribution, no matter how small, makes a difference. Thank you for being part of this journey!


1. The Importance of Quantum Error Correction

Quantum error correction is a foundational concept in quantum computing, addressing the challenges posed by decoherence and quantum noise. Since quantum systems are highly sensitive to their environment, errors can accumulate during computation, making error correction crucial for reliable quantum operations.

2. Key Techniques in Quantum Error Correction

  • Shor's Code: The first quantum error-correcting code, proposed by Peter Shor, demonstrated how a single qubit of information could be protected from errors using nine physical qubits.
  • Steane Code: Andrew Steane introduced a more efficient error-correcting code that requires fewer resources compared to Shor’s code.
  • Topological Codes: These include approaches like Kitaev’s surface code, which leverage the topological properties of quantum systems to correct errors effectively.

3. Applications and Future Directions

  • Fault-tolerant quantum computation using logical qubits protected by error correction.
  • Hardware optimization to minimize error rates and improve system reliability.
  • Advanced algorithms to ensure scalability in large-scale quantum systems.

  1. Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.
    This book is a comprehensive reference for understanding quantum mechanics, quantum computation, and quantum error correction techniques.

  2. Preskill, J. (1998). Fault-Tolerant Quantum Computation. Proceedings of the Royal Society of London A, 454(1969), 385–410.
    This paper explores the theoretical foundation of fault tolerance in quantum systems.

  3. Gottesman, D. (1997). Stabilizer Codes and Quantum Error Correction. PhD Thesis, California Institute of Technology.
    A seminal work introducing the stabilizer formalism, a key framework for many error correction codes.

  4. Kitaev, A. Y. (2003). Fault-Tolerant Quantum Computation by Anyons. Annals of Physics, 303(1), 2–30.
    This work discusses the application of topological quantum codes for error correction.

  5. Devitt, S. J., Munro, W. J., & Nemoto, K. (2013). Quantum Error Correction for Beginners. Reports on Progress in Physics, 76(7), 076001.
    A beginner-friendly overview of quantum error correction principles and practical implementations.

Copyright 2025 Quantum Software Development. Code released under the MIT license.

About

A code repository designed to show the best GitHub has to offer.

Topics

Resources

Code of conduct

Security policy

Stars

Watchers

Forks

Sponsor this project

 

Languages