Quantum computing simulations

What are these plots? Classical quantum computing algorithms.

Do I understand them? Not enough.

Did I generate them, run them on my computer, and no one else has the code that I used for them? Yes.

Are they easy to replicate? For someone who understands QC, they are probably trivial.

Are they correct, or wrong? Both, but likely mostly wrong.

Why am I putting these here? If I put these plots here, then I will be more enticed to learn more about the underlying potential physics and algorithms.

• Boson Sampling: boson_sampling.py
• Classical Metropolis (Ising Model): classical_metropolis.py
• Continuous-Time Quantum Walk (CTQW): ctqw.py
• Deutsch-Jozsa Algorithm: deutsch_jozsa.py
• Hamiltonian Simulation: hamiltonian_simulation.py
• Harrow-Hassidim-Lloyd (HHL) Algorithm: hhl.py
• Quantum Autoencoder (QAE): qae.py
• Quantum Approximate Optimization Algorithm (QAOA): qaoa.py
• Quantum Fourier Transform (QFT): qft.py
• Quantum Principal Component Analysis (qPCA): qpca.py
• Quantum Phase Estimation (QPE): qpe.py
• Quantum Support Vector Machine (QSVM) – Kernel Method: qsvm_kernel.py
• Quantum Counting Algorithm: quantum_counting.py
• Discrete-Time Quantum Walk (DTQW): quantum_walk.py
• Shor’s Algorithm (Period Finding Subroutine): shors_period_finding.py