Sketching the Best Approximate Quantum Compiling Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Sketching the Best Approximate Quantum Compiling Problem

Abstract

This paper considers the problem of quantum compilation from an optimization perspective by fixing a circuit structure of CNOTs and rotation gates then optimizing over the rotation angles. We solve the optimization problem classically and consider algorithmic tools to scale it to higher numbers of qubits. We investigate stochastic gradient descent and two sketch-and-solve algorithms. For all three algorithms, we compute the gradient efficiently using matrix-vector instead of matrix-matrix computations. Allowing for a runtime on the order of one hour, our implementation using either sketch-and-solve algorithm is able to compile 9 qubit, 27 CNOT circuits; 12 qubit, 24 CNOT circuits; and 15 qubit, 15 CNOT circuits. Without our algorithmic tools, standard optimization does not scale beyond 9 qubit, 9 CNOT circuits, and, beyond that, is theoretically dominated by barren plateaus.

Dates and versions

hal-03664784 , version 1 (11-05-2022)

Identifiers

Cite

Liam Madden, Albert Akhriev, Andrea Simonetto. Sketching the Best Approximate Quantum Compiling Problem. 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), Sep 2022, Broomfield, CO, United States. ⟨10.1109/QCE53715.2022.00071⟩. ⟨hal-03664784⟩
33 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More