UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms

Lao, L; Browne, DE; (2022) 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms. In: ISCA '22: Proceedings of the 49th Annual International Symposium on Computer Architecture. (pp. pp. 351-365). ACM Green open access

[thumbnail of Browne_2QAN_Compiler__ISCA22_.pdf]
Preview
PDF
Browne_2QAN_Compiler__ISCA22_.pdf - Accepted Version

Download (1MB) | Preview

Abstract

Simulating quantum systems is one of the most important potential applications of quantum computers. The high-level circuit defning the simulation needs to be compiled into one that complies with hardware limitations such as qubit architecture (connectivity) and instruction (gate) set. General-purpose quantum compilers work at the gate level and have little knowledge of the mathematical properties of quantum applications, missing further optimization opportunities. Existing application-specifc compilers only apply advanced optimizations in the scheduling procedure and are restricted to the CNOT or CZ gate set. In this work, we develop a compiler, named 2QAN, to optimize quantum circuits for 2-local qubit Hamiltonian simulation problems, a framework which includes the important quantum approximate optimization algorithm (QAOA). In particular, we exploit the flexibility of permuting different operators in the Hamiltonian (no matter whether they commute) and propose permutation-aware techniques for qubit routing, gate optimization and scheduling to minimize compilation overhead. 2QAN can target different architectures and different instruction sets. Compilation results on four applications (up to 50 qubits) and three quantum computers (namely, Google Sycamore, IBMQ Montreal and Rigetti Aspen) show that 2QAN outperforms state-of-theart general-purpose compilers and application-specifc compilers. Specifcally, 2QAN can reduce the number of inserted SWAP gates by 11.5X, reduce overhead in hardware gate count by 68.5X, and reduce overhead in circuit depth by 21X. Experimental results on the Montreal device demonstrate that benchmarks compiled by 2QAN achieve the highest fdelity.

Type: Proceedings paper
Title: 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
Event: ISCA '22: The 49th Annual International Symposium on Computer Architecture
ISBN-13: 9781450386104
Open access status: An open access version is available from UCL Discovery
DOI: 10.1145/3470496.3527394
Publisher version: https://doi.org/10.1145/3470496.3527394
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
UCL classification: UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Physics and Astronomy
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL
URI: https://discovery.ucl.ac.uk/id/eprint/10152955
Downloads since deposit
217Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item