Benchmarking Quantum Algorithms on Xanadu, IBM, and Google Quantum Computers

NISQ-era Quantum computers are slowly getting deployed to real-world use cases. Quantum Computation facilitates speedy solutions to a wide range of complex problems. To monitor progress towards more advanced devices, we can characterize their dynamics and analyze their performance using certain benchmarks for determining their computational capabilities. In our research, we simulated and analyzed Bose Hubbard Hamiltonian in Google, IBM, and Xanadu Quantum Computers and calculated the accuracy and speed. Then we solved one of the NP-hard problems called the Maximum clique and computed its execution speed.