skip to main content
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Quantum-assisted quantum compiling

Abstract

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 T r ( 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.

Authors:
 [1];  [2];  [3]; ORCiD logo [4]; ORCiD logo [4]; ORCiD logo [4]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Louisiana State Univ., Baton Rouge, LA (United States)
  2. Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Michigan State Univ., East Lansing, MI (United States)
  3. Los Alamos National Lab. (LANL), Los Alamos, NM (United States); California Inst. of Technology (CalTech), Pasadena, CA (United States)
  4. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE; Laboratory Directed Research & Development (LDRD)
OSTI Identifier:
1530785
Report Number(s):
LA-UR-18-25861
Journal ID: ISSN 2521-327X
Grant/Contract Number:  
89233218CNA000001
Resource Type:
Accepted Manuscript
Journal Name:
Quantum
Additional Journal Information:
Journal Volume: 3; Journal ID: ISSN 2521-327X
Publisher:
Quantum Science Open Community
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Khatri, Sumeet, LaRose, Ryan, Poremba, Alexander, Cincio, Lukasz, Sornborger, Andrew Tyler, and Coles, Patrick Joseph. Quantum-assisted quantum compiling. United States: N. p., 2019. Web. doi:10.22331/q-2019-05-13-140.
Khatri, Sumeet, LaRose, Ryan, Poremba, Alexander, Cincio, Lukasz, Sornborger, Andrew Tyler, & Coles, Patrick Joseph. Quantum-assisted quantum compiling. United States. doi:10.22331/q-2019-05-13-140.
Khatri, Sumeet, LaRose, Ryan, Poremba, Alexander, Cincio, Lukasz, Sornborger, Andrew Tyler, and Coles, Patrick Joseph. Mon . "Quantum-assisted quantum compiling". United States. doi:10.22331/q-2019-05-13-140. https://www.osti.gov/servlets/purl/1530785.
@article{osti_1530785,
title = {Quantum-assisted quantum compiling},
author = {Khatri, Sumeet and LaRose, Ryan and Poremba, Alexander and Cincio, Lukasz and Sornborger, Andrew Tyler and Coles, Patrick Joseph},
abstractNote = {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 unitary Vas 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 Tr(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.},
doi = {10.22331/q-2019-05-13-140},
journal = {Quantum},
number = ,
volume = 3,
place = {United States},
year = {2019},
month = {5}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Save / Share:

Works referenced in this record:

A simple formula for the average gate fidelity of a quantum dynamical operation
journal, October 2002


Compiling quantum circuits to realistic hardware architectures using temporal planners
journal, February 2018

  • Venturelli, Davide; Do, Minh; Rieffel, Eleanor
  • Quantum Science and Technology, Vol. 3, Issue 2
  • DOI: 10.1088/2058-9565/aaa331

Glassy Phase of Optimal Quantum Control
journal, January 2019


Power of One Bit of Quantum Information
journal, December 1998


Quantum circuit learning
journal, September 2018


Barren plateaus in quantum neural network training landscapes
journal, November 2018


Optimal quantum circuits for general two-qubit gates
journal, March 2004


Asymptotically Optimal Topological Quantum Compiling
journal, April 2014


In situ upgrade of quantum simulators to universal computers
journal, August 2018


Simulating physics with computers
journal, June 1982

  • Feynman, Richard P.
  • International Journal of Theoretical Physics, Vol. 21, Issue 6-7
  • DOI: 10.1007/BF02650179

A software methodology for compiling quantum programs
journal, February 2018

  • Häner, Thomas; Steiger, Damian S.; Svore, Krysta
  • Quantum Science and Technology, Vol. 3, Issue 2
  • DOI: 10.1088/2058-9565/aaa5cc

A variational eigenvalue solver on a photonic quantum processor
journal, July 2014

  • Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter
  • Nature Communications, Vol. 5, Issue 1
  • DOI: 10.1038/ncomms5213

An efficient quantum compiler that reduces T count
journal, September 2018


Quantum computations: algorithms and error correction
journal, December 1997


Adding control to arbitrary unknown quantum operations
journal, August 2011

  • Zhou, Xiao-Qi; Ralph, Timothy C.; Kalasuwan, Pruet
  • Nature Communications, Vol. 2, Issue 1
  • DOI: 10.1038/ncomms1392

Quantum compiling with diffusive sets of gates
journal, July 2018


Learning the quantum algorithm for state overlap
journal, November 2018

  • Cincio, Lukasz; Subaşı, Yiğit; Sornborger, Andrew T.
  • New Journal of Physics, Vol. 20, Issue 11
  • DOI: 10.1088/1367-2630/aae94a

Quantum Computing in the NISQ era and beyond
journal, August 2018


Automated optimization of large quantum circuits with continuous parameters
journal, May 2018


General teleportation channel, singlet fraction, and quasidistillation
journal, September 1999

  • Horodecki, Michał; Horodecki, Paweł; Horodecki, Ryszard
  • Physical Review A, Vol. 60, Issue 3
  • DOI: 10.1103/PhysRevA.60.1888

A review of procedures to evolve quantum algorithms
journal, February 2009


Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
journal, October 1997


Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and T Circuits Using a Constant Number of Ancillary Qubits
journal, May 2013


On the Hardness of Distinguishing Mixed-State Quantum Computations
conference, January 2005

  • Rosgen, B.; Watrous, J.
  • 20th Annual IEEE Conference on Computational Complexity (CCC'05)
  • DOI: 10.1109/CCC.2005.21

Quantum Circuit Simplification and Level Compaction
journal, March 2008

  • Maslov, D.; Dueck, G. W.; Miller, D. M.
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 27, Issue 3
  • DOI: 10.1109/TCAD.2007.911334

Optimization of the Solovay-Kitaev algorithm
journal, May 2013


swap test and Hong-Ou-Mandel effect are equivalent
journal, May 2013


A blueprint for demonstrating quantum supremacy with superconducting qubits
journal, April 2018


Quantum autoencoders for efficient compression of quantum data
journal, August 2017

  • Romero, Jonathan; Olson, Jonathan P.; Aspuru-Guzik, Alan
  • Quantum Science and Technology, Vol. 2, Issue 4
  • DOI: 10.1088/2058-9565/aa8072

Programming languages and compiler design for realistic quantum hardware
journal, September 2017

  • Chong, Frederic T.; Franklin, Diana; Martonosi, Margaret
  • Nature, Vol. 549, Issue 7671
  • DOI: 10.1038/nature23459

Error mitigation extends the computational reach of a noisy quantum processor
journal, March 2019


Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error
journal, May 2018


A generative modeling approach for benchmarking and training shallow quantum circuits
journal, May 2019

  • Benedetti, Marcello; Garcia-Pintos, Delfina; Perdomo, Oscar
  • npj Quantum Information, Vol. 5, Issue 1
  • DOI: 10.1038/s41534-019-0157-8

Variational quantum state diagonalization
journal, June 2019


    Works referencing / citing this record:

    Variational consistent histories as a hybrid algorithm for quantum foundations
    journal, July 2019

    • Arrasmith, Andrew; Cincio, Lukasz; Sornborger, Andrew T.
    • Nature Communications, Vol. 10, Issue 1
    • DOI: 10.1038/s41467-019-11417-0

    Variational quantum state diagonalization
    journal, June 2019


    Variational quantum unsampling on a quantum photonic processor
    journal, January 2020


    Parameterized quantum circuits as machine learning models
    journal, October 2019

    • Benedetti, Marcello; Lloyd, Erika; Sack, Stefan
    • Quantum Science and Technology, Vol. 4, Issue 4
    • DOI: 10.1088/2058-9565/ab4eb5

    Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
    journal, August 2019


    Short-depth circuits for efficient expectation-value estimation
    journal, February 2020