Some first exercises using OPENQASM 2.0.

An Antlr4 Grammar for OPENQASM 2.0

quantum

An experiment done to demonstrate quantum entanglement

qasm tokenizer implemented with chevrotain

A Python module to visualise quantum circuit

Quantum Computing Algorithms Implemented on IBM's 5-Qubit IBMqx4 Hardware. QASM Coding Architecture Built on Python.

Penr Oz - IBM Quantum Experiments

Quantum Compiler Collection

Grover’s Algorithm can be oversimplified as a database search algorithm that is quadratically faster than any classical counterpart. What makes this algorithm interesting is that it determines, with high probability, the unique input when it is the output that is known.

This is a full adder written in OpenQASM.

I heard that the most difficult quantum calculation ever performed (I don't know the year this statement was made) was 3x5, so I decided to try it.

Teleportation does not work the way the science fiction genre depicts it, but quantum teleportation is real and it works.

Simon's Algorithm is usually presented with a secret structure of s=11; so I took the s=110 implementation and translated it into OpenQASM.

The inverse of the Quantum Fourier Transform (QFT) is an integral part of the encryption-breaking Shor's Factoring Algorithm.

Quantum Teleportation + Quantum Fourier Transform = Quantum Fourier Teleportation

At last, generate a pure random number, as nature intended

Quantum Phase Estimation is a key component of Shor's Factoring Algorithm.

I applied Shor's Error Correction Algorithm to Quantum Teleportation.

This is my attempt to use the quantum phase estimation component of Shor's Factoring Algorithm to factor the number 21.