Investigation into the Potential of Parallel Quantum Annealing for Simultaneous Optimization of Multiple Problems: A Comprehensive Study (2403.05764v1)
Abstract: Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multiple independent problems in a single annealing cycle. This study provides insights into the potential and the limitations of this parallelization method. The experiments consisting of two different problems are integrated, and various problem dimensions are explored including normalization techniques using specific methods such as DWaveSampler with Default Embedding, DWaveSampler with Custom Embedding and LeapHybridSampler. This method minimizes idle qubits and holds promise for substantial speed-up, as indicated by the Time-to-Solution (TTS) metric, compared to traditional quantum annealing, which solves problems sequentially and may leave qubits unutilized.
- A. Lucas, Ising formulations of many np problems, Frontiers in physics 2, 5 (2014).
- I. Hen and F. M. Spedalieri, Quantum annealing for constrained optimization, Physical Review Applied 5, 034007 (2016).
- M. Lewis and F. Glover, Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis, Networks 70, 79 (2017).
- A. K. Bishwas, A. Mani, and V. Palade, An all-pair quantum svm approach for big data multiclass classification, Quantum information processing 17, 1 (2018).
- A. K. Bishwas, A. Mani, and V. Palade, Gaussian kernel in quantum learning, International Journal of Quantum Information 18, 2050006 (2020a).
- A. K. Bishwas, A. Mani, and V. Palade, Big data classification with quantum multiclass svm and quantum one-against-all approach, in 2016 2nd International Conference on Contemporary Computing and Informatics (IC3I) (IEEE, 2016) pp. 875–880.
- A. K. Bishwas, A. Mani, and V. Palade, An investigation on support vector clustering for big data in quantum paradigm, Quantum Information Processing 19, 108 (2020b).
- A. K. Bishwas, A. Mani, and V. Palade, 4 from classical to quantum machine learning, Quantum Machine Learning 6, 67 (2020c).
- E. Pelofske, G. Hahn, and H. N. Djidjev, Solving larger maximum clique problems using parallel quantum annealing, Quantum Information Processing 22, 219 (2023).
- E. Pelofske, G. Hahn, and H. N. Djidjev, Parallel quantum annealing, Scientific Reports 12, 4499 (2022).
- T. Berry and J. Sharpe, Asset–liability modelling in the quantum era, British Actuarial Journal 26, e7 (2021).
- E. Pelofske, G. Hahn, and H. Djidjev, Decomposition algorithms for solving np-hard problems on a quantum annealer, Journal of Signal Processing Systems 93, 405 (2021).
- E. Stogiannos, C. Papalitsas, and T. Andronikos, Experimental analysis of quantum annealers and hybrid solvers using benchmark optimization problems, Mathematics 10, 10.3390/math10081294 (2022).
- D. S. Steiger, T. F. Rønnow, and M. Troyer, Heavy tails in the distribution of time to solution for classical and quantum annealing, Physical review letters 115, 230501 (2015).
- T. Albash and D. A. Lidar, Demonstration of a scaling advantage for a quantum annealer over simulated annealing, Physical Review X 8, 031016 (2018).
- E. Grant, T. S. Humble, and B. Stump, Benchmarking quantum annealing controls with portfolio optimization, Physical Review Applied 15, 014012 (2021).