Skip to content

Update README.md #92

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Dec 20, 2024
Merged

Update README.md #92

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -50,7 +50,7 @@ A tribute to some of the brightest minds who have shaped the field of quantum co

<br>

## 5.Erwin Schrödinger (1926) 🐈
6. Erwin Schrödinger (1926) 🐈

![Erwin Schrödinger](path/to/image/schrodinger.jpg)

Expand All @@ -66,7 +66,7 @@ A tribute to some of the brightest minds who have shaped the field of quantum co
<br>


6. **Paul Dirac** (1928) ➕➖
7. **Paul Dirac** (1928) ➕➖

- **Formula**:

Expand Down Expand Up @@ -106,28 +106,28 @@ A tribute to some of the brightest minds who have shaped the field of quantum co

<br>

11. **John Bell** (1964) 🔗
12. **John Bell** (1964) 🔗
- **Formula**: \( |E(a, b) + E(a, b') + E(a, b) - E(a', b')| \leq 2 \)
- **Explanation**: Bell's inequality tests if correlations between entangled particles can be explained by local theories.
- **Contribution**: Fundamental for experiments that verified quantum entanglement and non-locality.

<br>

12. **Alexander Holevo** (1973) 🧩
13. **Alexander Holevo** (1973) 🧩
- **Formula**: \( I(X:Y) \leq S(\rho) \)
- **Explanation**: The Holevo bound describes the maximum information extractable from a quantum system.
- **Contribution**: Essential for quantum information theory, with implications in cryptography and quantum data transmission.

<br>

13. **Peter Shor** (1994) 🔓
14. **Peter Shor** (1994) 🔓
- **Formula**: N/A
- **Explanation**: Shor's algorithm enables efficient factorization of large numbers, threatening the security of traditional cryptographic systems.
- **Contribution**: The first quantum algorithm to solve complex problems more efficiently than classical algorithms.

<br>

14. **Lov Grover** (1996) 🔍
15. **Lov Grover** (1996) 🔍
- **Formula**: N/A
- **Explanation**: Grover's algorithm improves search efficiency, reducing search time from \( O(N) \) to \( O(\sqrt{N}) \).
- **Contribution**: Demonstrates how quantum computing can accelerate data search problems faster than classical computing.
Expand Down
Loading