The challenge is to simulate coupled classical oscillators using quantum computing to obtain exponential speedups. The challenge repository - https://github.com/quantumcoalition/qrise2024-classiq-challenge
The progress of quantum computers in the last few years has been immense, with better and better quantum computers being developed each year. Nowadays there are quantum computers with hundreds of qubits that can compute quantum algorithms with circuit depth of up to a few thousand and still receive a significant signal. One of the key challenges is the development of efficient and novel quantum algorithms that are useful and offer exponential advantage over classical methods. One of the very few algorithms we know of under this definition is the Exponential Quantum Speedup in Simulating Coupled Classical Oscillators work, presented in 2023 by Ryan Babbush et al.
Like most quantum algorithms papers, this is a theoretical work. Taking a theoretical paper and implementing it in practice is a massive challenge with many obstacles that need to be overcome, both practical and theoretical.
Research Paper link -
https://journals.aps.org/prx/pdf/10.1103/PhysRevX.13.041041- Ramachandran Sekanipuram Srikanthan
- Hirmay Sandesara
- Aman Gupta
We have made a short presentation explaning our work and the slides are added in this Git - inside Submission/Slides directory. We have also added our video presentation in Youtube and can be viewed in the below link.
Throughout this challenge our aim was to practically demonstrate the quantum speedup of the algorithm by {Babbush_2023}.
We wanted to do this by running an instance of this algorithm which is proven by the authors to be BQP complete and try to ensure scalability to show practical demonstration on a 70+ qubit system (depending on the quantum simulator), possibly showcasing quantum supremacy.
We believe that we have managed to do that for a specific case which only takes polynomial number of resources and would fit within the depth range of 10^4, 3*10^4
- State_EnDecode_Couple_HO.ipynb - Contains state preparation approaches and the measurement of fidelity of the final state. It also contains parsing of state vector back to classical values.
- state_preparation_classiq.ipynb - Testing our state preparation approach using Classiq framework.
- Hamiltonian_formation.ipynb - Contains our proposed determinsitic way of computing hamiltonian matrix
- Structural_Foundation.ipynb - Gives the overall picture from state preparation, hamiltonian formulation, quantum circuit generation, time evolution using various approaches and fidelity measurement.
- Manual Simulation.pdf - Manual derivation of the hamiltonian for a simple example
- Submission/hamiltonian_simulation_classiq.ipynb - Describes the full process of simulation of coupled classical oscillator using Classiq.
- Submission/Complete_run.ipynb - Code for performing a simulation using Classiq where user can edit the values of masses and spring constants.
- Submission/Complete_run_with_save.ipynb - Containts code for a complete run along with qmod qprog file generation for saving.
- Submission/output.zip - Contains the saved qmod and qprog file for the run in Submission/Complete_run.ipynb
We thank QRISE and Classiq for providing us with this wonderful opportunity.