Can I read Quantum-assisted Quantum Compiling on EtoBox?

Quantum-assisted Quantum Compiling by Khatri, Sumeet; LaRose, Ryan; Poremba, Alexander; Cincio, Lukasz; Sornborger, Andrew T.; Coles, Patrick J. is a scholarly article available to read on EtoBox.

What is Quantum-assisted Quantum Compiling about?

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 unitary $U$ and a trainable unitary $V$ as 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 overlap ${\rm Tr} (V^\dagger 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 dem

Author

Khatri, Sumeet; LaRose, Ryan; Poremba, Alexander; Cincio, Lukasz; Sornborger, Andrew T.; Coles, Patrick J.

Published

2018

Language

EN