Enhancing computational accuracy with parallel parameter optimization in variational quantum eigensolver
Source abstract
Abstract
Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Quantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Electrical Engineering and Computer Science, Tokyo University of Agriculture and Technology 1 , Koganei, Tokyo 184-8588,
Division of Medical Data Informatics, Human Genome Center, The Institute of Medical Science, The University of Tokyo 2 , Minato, Tokyo 108-8639,
The Graduate School of Information Science and Technology, The University of Tokyo 3 , Bunkyo, Tokyo 113-8656,
References (42)
Show source-provided references
1. Evidence for the utility of quantum computing before fault tolerance10.1038/s41586-023-06096-3 ↗
2. Short-depth QAOA circuits and quantum annealing on higher-order Ising models10.1038/s41534-024-00825-w ↗
3. Quantum computing in the NISQ era and beyond10.22331/q-2018-08-06-79 ↗
4. Variational quantum algorithms10.1038/s42254-021-00348-9 ↗
5. A variational eigenvalue solver on a photonic quantum processor10.1038/ncomms5213 ↗
6. The theory of variational hybrid quantum-classical algorithms10.1088/1367-2630/18/2/023023 ↗
7. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets10.1038/nature23879 ↗
8. Quantum optimization using variational algorithms on near-term quantum devices10.1088/2058-9565/aab822 ↗
9. Training variational quantum algorithms is NP-hard10.1103/physrevlett.127.120502 ↗
10. Particle swarm optimization
11. Parallel quantum annealing10.1038/s41598-022-08394-8 ↗
12. Parallel quantum annealing: A novel approach to solving multiple NP-hard problems concurrently
13. S. Niu and A.Todri-Sanial, “How parallel circuit execution can be useful for NISQ computing?,” arXiv:2112.00387v1 (2021).10.23919/DATE54114.2022.9774512 ↗
14. Enabling multi-programming mechanism for quantum computing in the NISQ era10.22331/q-2023-02-16-925 ↗
15. Accelerating the variational quantum eigensolver using parallelism10.1088/2058-9565/acd0d2 ↗
16. Simultaneous execution of quantum circuits on current and near-future NISQ systems10.1109/TQE.2022.3164716 ↗
17. Parallel hybrid quantum-classical machine learning for kernelized time-series classification10.1007/s42484-024-00149-0 ↗
18. Qiskit: Open-source framework for quantum computing
19. See https://quantum-computing.ibm.com/ for IBM Quantum.
20. Improving variational quantum optimization using CVaR10.22331/q-2020-04-20-256 ↗
21. Variational ansatz preparation to avoid CNOT-gates on noisy quantum devices for combinatorial optimizations10.1063/5.0077706 ↗
22. Performance of hybrid quantum-classical variational heuristics for combinatorial optimization10.1103/physreve.99.013304 ↗
23. Quantum variational optimization: The role of entanglement and problem hardness10.1103/physreva.104.062426 ↗
24. Optimal flight-gate assignment on a digital quantum computer10.1103/physrevapplied.20.064025 ↗
25. J. Bowles , S.Ahmed, and M.Schuld, “Better than classical? The subtle art of benchmarking quantum machine learning models,” arXiv:2403.07059v2 (2024).
26. T. Rohe , D.Schuman, J.Nüßlein, L.Sünkel, J.Stein, and C.Linnhoff-Popien, “The questionable influence of entanglement in quantum optimisation algorithms,” arXiv:2407.17204v1 (2024).10.1109/QCE60285.2024.00176 ↗
27. Cost function dependent barren plateaus in shallow parametrized quantum circuits10.1038/s41467-021-21728-w ↗
28. Sequential minimal optimization for quantum-classical hybrid algorithms10.1103/physrevresearch.2.043158 ↗
29. CoolMomentum: A method for stochastic optimization by Langevin dynamics with simulated annealing10.1038/s41598-021-90144-3 ↗
30. D. P. Kingma and J. L.Ba, “Adam: A method for stochastic optimization,” arXiv:1412.6980v9 (2014).
31. Multivariate stochastic approximation using a simultaneous perturbation gradient approximation10.1109/9.119632 ↗
32. CoolMomentum mitigating local minima in variational quantum eigensolvers10.35848/1347-4065/acea0a ↗
33. Efficient Z gates for quantum computing10.1103/physreva.96.022330 ↗
34. A quantum engineer’s guide to superconducting qubits10.1063/1.5089550 ↗
35. G. B. Mbeng , R.Fazio, and G. E.Santoro, “Quantum annealing: A journey through digitalization, control, and hybrid quantum variational schemes,” arXiv:1906.08948v3 (2019).
36. M. M. Wauters , G. B.Mbeng, and G. E.Santoro, “Polynomial scaling of QAOA for ground-state preparation of the fully-connected p-spin ferromagnet,” arXiv:2003.07419v2 (2020).
37. Scalable mitigation of measurement errors on quantum computers10.1103/prxquantum.2.040326 ↗
38. mthree (2.8.1) user guide available on-line at https://qiskit.github.io/qiskit-addon-mthree/index.html.
39. Variational quantum algorithm with information sharing10.1038/s41534-021-00452-9 ↗
40. Multiobjective variational quantum optimization for constrained problems: An application to cash handling10.1088/2058-9565/ace474 ↗
41. Entanglement-variational hardware-efficient ansatz for eigensolvers10.1103/physrevapplied.21.034059 ↗
42. E. Farhi , J.Goldstone, and S.Gutmann, “A quantum approximate optimization algorithm,” arXiv:1411.4028v1 (2014).