Quantum-assisted quantum compiling

By Sumeet Khatri, Ryan Larose, Alexander Poremba, Lukasz Cincio, Andrew T. Sornborger, Patrick J. Coles. Quantum, 2018

413 citations recorded by the source corpus.

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitaryUand a trainable unitaryVas the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlapTr(V†U)but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/6253c3bd7d3d929d209267204b43b53725744dbe

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Variational Quantum Linear Solver (2019, methodology): “The global cost function is given by Moreover, it is known that approximating ∆ HS to within inverse polynomial precision is DQC1 - hard [33], and hence the result follows.”
General parameter-shift rules for quantum gradients (2021, background): “…[7], they have evolved to cover topics such as optimization [8], quantum chemistry [9, 10, 11, 12, 13], integer factorization [14], compilation [15], quantum control [16], matrix diagonaliza-David Wierichs: wierichs@thp.uni-koeln.de tion [17, 18], and variational quantum machine learning [19,…”
Parameterized quantum circuits as machine learning models (2019, background): “Khatari et al. [102] propose to train a hardware-eﬃcient variational circuit U θ to approximately execute the same action as a target unitary U = e − i H t .”
Connecting ansatz expressibility to gradient magnitudes and barren plateaus (2021, background): “[7] Sumeet Khatri, Ryan LaRose, Alexander Poremba, Lukasz Cincio, Andrew T Sornborger, and Patrick J Coles, “Quantum-assisted quantum compiling,” Quantum 3, 140 (2019).”
Variational quantum algorithms (2020, methodology): “Hence, several VQAs have been introduced that can potentially be used to accelerate this task [103, 126–129].”
Barren plateaus in variational quantum computing (2024, positive): “For example, one only picks entangling gates that follow the device connectivity to avoid compiling overhead 87,109,110 .”
Noise-induced barren plateaus in variational quantum algorithms (2020, background): “By keeping the quantum circuit depth relatively short, VQAs mitigate hardware noise and may enable near-term applications including electronic structure [5–8], dynamics [9– 12], optimization [13–16], linear systems [17, 18], metrology [19, 20], factoring [21], compiling [22–24], and others [25–30].”
Error mitigation with Clifford quantum-circuit data (2020, methodology): “It also includes variational quantum algorithms [3, 10, 18, 34, 40], some of which can be used to remove the eﬀects of in-coherent noise [9, 29–31 , 42].”
Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe (2022, background): “The corresponding gate sequences can be subjected to optimization, for example to minimize the depth of the circuit on noisy quantum processors [333] or to reduce the approximation error [409].”
Robust data encodings for quantum classifiers (2020, methodology): “Deﬁnition 11.”
Absence of Barren Plateaus in Quantum Convolutional Neural Networks (2020, background): “[19] S.”
Diagnosing Barren Plateaus with Tools from Quantum Optimal Control (2021, methodology): “The HEA has been employed to prepare the ground state of molecules [64], to study Hamiltonians that are similar to the device’s interactions [100], and in several other variational quantum algorithms [21, 49, 101, 102].”
Quantum variational algorithms are swamped with traps (2022, positive): “…setting of qUSQ , we can evaluate the commonly used procedure of measuring the inner product or average ﬁ delity of n -qubit states between a target unitary U * and a variationally chosen unitary V ( θ ) using statistical queries analogous to a swap test on actual quantum hardware 39,56 – 58 .”