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

Title: Learning the quantum algorithm for state overlap

Abstract

Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap $$\mathrm{Tr}(\rho \sigma )$$ between two quantum states ρ and σ. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to ρ = σ, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has a constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate sets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error—compared to the Swap Test—on these computers.

Authors:
; ; ;
Publication Date:
Research Org.:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE; LANL Laboratory Directed Research and Development (LDRD) Program
OSTI Identifier:
1482266
Alternate Identifier(s):
OSTI ID: 1482937
Report Number(s):
LA-UR-18-21984
Journal ID: ISSN 1367-2630
Grant/Contract Number:  
89233218CNA000001
Resource Type:
Journal Article: Published Article
Journal Name:
New Journal of Physics
Additional Journal Information:
Journal Name: New Journal of Physics Journal Volume: 20 Journal Issue: 11; Journal ID: ISSN 1367-2630
Publisher:
IOP Publishing
Country of Publication:
United Kingdom
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Computer Science; Information Science; Mathematics; quantum computing algorithms

Citation Formats

Cincio, Lukasz, Subaşı, Yiğit, Sornborger, Andrew T., and Coles, Patrick J. Learning the quantum algorithm for state overlap. United Kingdom: N. p., 2018. Web. doi:10.1088/1367-2630/aae94a.
Cincio, Lukasz, Subaşı, Yiğit, Sornborger, Andrew T., & Coles, Patrick J. Learning the quantum algorithm for state overlap. United Kingdom. https://doi.org/10.1088/1367-2630/aae94a
Cincio, Lukasz, Subaşı, Yiğit, Sornborger, Andrew T., and Coles, Patrick J. 2018. "Learning the quantum algorithm for state overlap". United Kingdom. https://doi.org/10.1088/1367-2630/aae94a.
@article{osti_1482266,
title = {Learning the quantum algorithm for state overlap},
author = {Cincio, Lukasz and Subaşı, Yiğit and Sornborger, Andrew T. and Coles, Patrick J.},
abstractNote = {Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap $\mathrm{Tr}(\rho \sigma )$ between two quantum states ρ and σ. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to ρ = σ, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has a constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate sets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error—compared to the Swap Test—on these computers.},
doi = {10.1088/1367-2630/aae94a},
url = {https://www.osti.gov/biblio/1482266}, journal = {New Journal of Physics},
issn = {1367-2630},
number = 11,
volume = 20,
place = {United Kingdom},
year = {Thu Nov 01 00:00:00 EDT 2018},
month = {Thu Nov 01 00:00:00 EDT 2018}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record at https://doi.org/10.1088/1367-2630/aae94a

Citation Metrics:
Cited by: 96 works
Citation information provided by
Web of Science

Figures / Tables:

Figure 1. Figure 1.: Machine-learning approach to discovering and optimizing quantum algorithms.Weoptimize an algorithm for a given set of resources, which includes input resources (ancilla and data qubits) and measurement resources (i.e. which qubits can be measured). The algorithm is then determined by the quantum gate sequence and the classical post-processing ofmore » the measurement results. To find the algorithm that computes the function $$x$$→$$f$$ ($$x$$),we minimize a cost function that quantifies the discrepancy between the desired output $$f$$ ($$x$$( $$i$$)) and the actual output $$y$$( $$i$$) for a set of training data inputs {$$x$$( $$i$$) }. If the training data are sufficiently general, the algorithm that minimizes the cost should be a general algorithm that computes $$f$$ ($$x$$) for any input $$x$$.« less

Save / Share:

Works referenced in this record:

Generating three-qubit quantum circuits with neural networks
journal, October 2017


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


Entanglement spectroscopy on a quantum computer
journal, November 2017


Evolutionary Approach to Quantum and Reversible Circuits Synthesis
journal, December 2003


On the CNOT -cost of TOFFOLI gates
journal, May 2009


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


Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms
journal, February 2005


Quantum circuit learning
journal, September 2018


Basic circuit compilation techniques for an ion-trap quantum machine
journal, February 2017


Surface codes: Towards practical large-scale quantum computation
journal, September 2012


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


A quantum Fredkin gate
journal, March 2016


Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate
journal, April 1996


Faster phase estimation
journal, March 2014


A software methodology for compiling quantum programs
journal, February 2018


Implementation of a quantum Fredkin gate using an entanglement resource
conference, May 2013


Simulating the transverse Ising model on a quantum computer: Error correction with the surface code
journal, March 2013


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


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


Designing High-Fidelity Single-Shot Three-Qubit Gates: A Machine-Learning Approach
journal, November 2016


Deep Learning for Logic Optimization Algorithms
conference, January 2018


Quantum Fingerprinting
journal, September 2001