Skip to content

Commit

Permalink
Merge pull request #8 from rawatraghav/master
Browse files Browse the repository at this point in the history
Update README.md
  • Loading branch information
born-2learn authored Oct 31, 2020
2 parents 4415218 + ada7d9f commit 178315b
Show file tree
Hide file tree
Showing 2 changed files with 57 additions and 2 deletions.
9 changes: 8 additions & 1 deletion qiskit/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,14 @@ _add list here_
_add list here_

## Quantum Key Distribution
_add list here_
Quantum key distribution (QKD) is a secure communication method which implements a cryptographic protocol involving components of quantum mechanics. It enables two parties to produce a shared random secret key known only to them, which can then be used to encrypt and decrypt messages. It is often incorrectly called quantum cryptography, as it is the best-known example of a quantum cryptographic task. By using quantum superpositions or quantum entanglement and transmitting information in quantum states, a communication system can be implemented that detects eavesdropping. If the level of eavesdropping is below a certain threshold, a key can be produced that is guaranteed to be secure (i.e., the eavesdropper has no information about it), otherwise no secure key is possible and communication is aborted.

Some great resources to understand the algorithm and implement with qiskit:

- [Qiskit Textbook](https://qiskit.org/textbook/ch-algorithms/quantum-key-distribution.html)
- [Wired](https://www.wired.com/insights/2014/09/quantum-key-distribution/)
- [Implementation](https://www.youtube.com/watch?v=hArTusF4KPg)


## Bernstein Vazirani Algorithm
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1992. It's a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. The Bernstein–Vazirani algorithm was designed to prove an oracle separation between complexity classes BQP and BPP.
Expand Down
50 changes: 49 additions & 1 deletion strawberryfields/README.md
Original file line number Diff line number Diff line change
@@ -1 +1,49 @@
## Strawberry Fields, a Quantum optics framework from Xanadu
## Strawberry Fields, a Quantum optics framework from Xanadu

# QPowerAlgo

# Algorithms with the qiskit framework

## Bell States(Quantum Entanglement)
_add list here_

## Grover's Search
_add list here_

## Shor's Factorization
_add list here_

## Quantum Key Distribution
Quantum key distribution (QKD) is a secure communication method which implements a cryptographic protocol involving components of quantum mechanics. It enables two parties to produce a shared random secret key known only to them, which can then be used to encrypt and decrypt messages. It is often incorrectly called quantum cryptography, as it is the best-known example of a quantum cryptographic task. By using quantum superpositions or quantum entanglement and transmitting information in quantum states, a communication system can be implemented that detects eavesdropping. If the level of eavesdropping is below a certain threshold, a key can be produced that is guaranteed to be secure (i.e., the eavesdropper has no information about it), otherwise no secure key is possible and communication is aborted.

Some great resources to understand the algorithm and implement with qiskit:

- [Qiskit Textbook](https://qiskit.org/textbook/ch-algorithms/quantum-key-distribution.html)
- [Wired](https://www.wired.com/insights/2014/09/quantum-key-distribution/)
- [Implementation](https://www.youtube.com/watch?v=hArTusF4KPg)


## Bernstein Vazirani Algorithm
The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1992. It's a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. The Bernstein–Vazirani algorithm was designed to prove an oracle separation between complexity classes BQP and BPP.

Some great resources to understand the algorithm and implement with qiskit:

- [Qiskit Textbook](https://qiskit.org/textbook/ch-algorithms/bernstein-vazirani.html)
- [Medium](https://medium.com/@lana.bozanic/the-bernstein-vazirani-algorithm-9f5fc9d0518e)
- [Programming with Qiskit](https://www.youtube.com/watch?v=sqJIpHYl7oo)


## Deutsch-Jozsa Algoruithm
_add list here_

## Quantum Teleportation
_add list here_

## Quantum Teleportation
_add list here_

## VQC(Variational Quantum Classifier)
_add list here_

## Other
_add list here_

0 comments on commit 178315b

Please sign in to comment.