Recompiling QAOA Circuits on Various Rotational Directions
Open Access
- 13 October 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 309-324
Abstract
The quantum approximate optimization algorithm (QAOA) is introduced to efficiently solve combinatorial optimization problems. Despite the promise of QAOA, the cost of executing QAOA circuits at scale for quantum advantage may still be excessive for the near-future quantum device. We observe the increasing overhead of QAOA circuit execution in the native gate translation. To execute QAOA circuits on a real quantum computing device, Hamiltonians composed of predefined specific rotations (e.g., ZZ and X) should be decomposed into finite native gates. By adopting rotational combinations that utilize native gates more directly than the standard QAOA circuit model, the execution cost on real quantum devices can be reduced. In this study, we propose Racoon (Rotational Space Virtualization for QAOA Ansatz), an algorithm-hardware co-design approach that revisits the synthesis conditions of QAOA circuits and selects alternative candidates with different rotational combinations. Our analysis of six commercial quantum processors demonstrates that applying Racoon to QAOA circuits for the 4-node Sherrington-Kirkpatrick model reduces the number of native gates by an average of 23% and up to 79%. Consequently, using Racoon results in 43% fewer training epochs, 41% lower training energy consumption, and a 6% improvement in inference on average compared to standard QAOA. Racoon consistently reduces circuit depth as the number of qubits and layers increases, achieving 123 × more circuit depth reduction compared to the recently proposed Depth First Search (DFS)-based method. Furthermore, we confirm that Racoon’s method can be extended to State-of-The-Art QAOAs with modified ansätze and to the variational quantum eigensolver (VQE).Keywords
Funding Information
- National Research Foundation of Korea (NRF) (No. RS-2023-00303229)
This publication has 69 references indexed in Scilit:
- Transfer of Logistics Optimizations to Material Flow Resource Optimizations using Quantum ComputingProcedia Computer Science, 2024
- Quantum variational distance-based centroid classifierNeurocomputing, 2024
- First Attempts at Cryptanalyzing a (Toy) Block Cipher by Means of Quantum Optimization ApproachesJournal of Computational Science, 2023
- Benchmarking the performance of portfolio optimization with QAOAQuantum Information Processing, 2022
- Multi-angle quantum approximate optimization algorithmScientific Reports, 2022
- Lower bounds on circuit depth of the quantum approximate optimization algorithmQuantum Information Processing, 2021
- Quantum approximate optimization of non-planar graph problems on a planar superconducting processorNature Physics, 2021
- Quantum computing for finance: Overview and prospectsReviews in Physics, 2019
- Smart pattern to generate small–world networksChaos, Solitons & Fractals, 2018
- Quantenmechanik der Sto vorg ngeThe European Physical Journal A, 1926