A place to stash my quantum computing experiments
-
Updated
Jul 12, 2024 - Jupyter Notebook
A place to stash my quantum computing experiments
This was an attempt to push the limits of the IBM cloud quantum computing simulator.
QNC: Quantum Netlist Compiler
This is a full adder written in OpenQASM.
Quantum Teleportation + Quantum Fourier Transform = Quantum Fourier Teleportation
Quantum Phase Estimation is a key component of Shor's Factoring Algorithm.
This is my attempt to use the quantum phase estimation component of Shor's Factoring Algorithm to factor the number 21.
The inverse of the Quantum Fourier Transform (QFT) is an integral part of the encryption-breaking Shor's Factoring Algorithm.
Teleportation does not work the way the science fiction genre depicts it, but quantum teleportation is real and it works.
Using QASM to define quantum entanglement gates.
Remote and local execution of QASM2 programs.
I applied Shor's Error Correction Algorithm to Quantum Teleportation.
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.
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.
Add a description, image, and links to the qasm2 topic page so that developers can more easily learn about it.
To associate your repository with the qasm2 topic, visit your repo's landing page and select "manage topics."