Detailed Quantum Computing Report
Detailed Quantum Computing Report
1. Introduction
A quantum computer performs calculations based on the laws of quantum mechanics,
which govern the behavior of sub-atomic particles.
"I think I can safely say that nobody understands quantum mechanics." – Richard Feynman
2. Data Representation
2.1 Qubits
A qubit is the quantum version of a classical bit and can exist in states |0⟩, |1⟩, or a
superposition of both.
2.2 Superposition
A qubit can be in a superposition: |ψ⟩ = α|0⟩ + β|1⟩, where |α|² + |β|² = 1.
2.4 Entanglement
Entanglement allows qubits to exhibit correlated behavior, meaning measuring one affects
the other.
3. Operations on Qubits
5. Shor’s Algorithm
5.6 Challenges
QFT might yield incorrect period or odd period. Retry with different x.
6. Conclusion
In 2001, a 7-qubit machine used Shor’s algorithm to factor 15.
Open Questions:
- What other algorithms can quantum computers run?
- Can they solve NP-complete problems in polynomial time?
7. Applications of Quantum Computing