DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems

Abstract

Tunneling is often claimed to be the key mechanism underlying possible speedups in quantum optimization via quantum annealing (QA), especially for problems featuring a cost function with tall and thin barriers. We present and analyze several counterexamples from the class of perturbed Hamming weight optimization problems with qubit permutation symmetry. We first show that, for these problems, the adiabatic dynamics that make tunneling possible should be understood not in terms of the cost function but rather the semiclassical potential arising from the spin-coherent path-integral formalism. We then provide an example where the shape of the barrier in the final cost function is short and wide, which might suggest no quantum advantage for QA, yet where tunneling renders QA superior to simulated annealing in the adiabatic regime. However, the adiabatic dynamics turn out not be optimal. Instead, an evolution involving a sequence of diabatic transitions through many avoided-level crossings, involving no tunneling, is optimal and outperforms adiabatic QA. We show that this phenomenon of speedup by diabatic transitions is not unique to this example, and we provide an example where it provides an exponential speedup over adiabatic QA. In yet another twist, we show that a classical algorithm, spin-vector dynamics, ismore » at least as efficient as diabatic QA. Lastly, in a different example with a convex cost function, the diabatic transitions result in a speedup relative to both adiabatic QA with tunneling and classical spin-vector dynamics.« less

Authors:
; ;
Publication Date:
Research Org.:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States). Oak Ridge Leadership Computing Facility (OLCF); UT-Batelle, LLC, Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE Office of Science (SC)
OSTI Identifier:
1267545
Alternate Identifier(s):
OSTI ID: 1299215
Grant/Contract Number:  
AC05-00OR22725
Resource Type:
Published Article
Journal Name:
Physical Review. X
Additional Journal Information:
Journal Name: Physical Review. X Journal Volume: 6 Journal Issue: 3; Journal ID: ISSN 2160-3308
Publisher:
American Physical Society
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; tridiagonal transition matrices; mean passage times; model

Citation Formats

Muthukrishnan, Siddharth, Albash, Tameem, and Lidar, Daniel A. Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems. United States: N. p., 2016. Web. doi:10.1103/PhysRevX.6.031010.
Muthukrishnan, Siddharth, Albash, Tameem, & Lidar, Daniel A. Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems. United States. https://doi.org/10.1103/PhysRevX.6.031010
Muthukrishnan, Siddharth, Albash, Tameem, and Lidar, Daniel A. Thu . "Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems". United States. https://doi.org/10.1103/PhysRevX.6.031010.
@article{osti_1267545,
title = {Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems},
author = {Muthukrishnan, Siddharth and Albash, Tameem and Lidar, Daniel A.},
abstractNote = {Tunneling is often claimed to be the key mechanism underlying possible speedups in quantum optimization via quantum annealing (QA), especially for problems featuring a cost function with tall and thin barriers. We present and analyze several counterexamples from the class of perturbed Hamming weight optimization problems with qubit permutation symmetry. We first show that, for these problems, the adiabatic dynamics that make tunneling possible should be understood not in terms of the cost function but rather the semiclassical potential arising from the spin-coherent path-integral formalism. We then provide an example where the shape of the barrier in the final cost function is short and wide, which might suggest no quantum advantage for QA, yet where tunneling renders QA superior to simulated annealing in the adiabatic regime. However, the adiabatic dynamics turn out not be optimal. Instead, an evolution involving a sequence of diabatic transitions through many avoided-level crossings, involving no tunneling, is optimal and outperforms adiabatic QA. We show that this phenomenon of speedup by diabatic transitions is not unique to this example, and we provide an example where it provides an exponential speedup over adiabatic QA. In yet another twist, we show that a classical algorithm, spin-vector dynamics, is at least as efficient as diabatic QA. Lastly, in a different example with a convex cost function, the diabatic transitions result in a speedup relative to both adiabatic QA with tunneling and classical spin-vector dynamics.},
doi = {10.1103/PhysRevX.6.031010},
journal = {Physical Review. X},
number = 3,
volume = 6,
place = {United States},
year = {Thu Jul 21 00:00:00 EDT 2016},
month = {Thu Jul 21 00:00:00 EDT 2016}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record
https://doi.org/10.1103/PhysRevX.6.031010

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

Save / Share:

Works referenced in this record:

Accuracy versus run time in an adiabatic quantum search
journal, November 2010


A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
journal, April 2001


Erratum: Landau-Zener model: Effects of finite coupling duration
journal, December 1996


The fundamental gap for a class of Schrödinger operators on path and hypercube graphs
journal, May 2014

  • Jarret, Michael; Jordan, Stephen P.
  • Journal of Mathematical Physics, Vol. 55, Issue 5
  • DOI: 10.1063/1.4878120

The role of symmetries in adiabatic quantum algorithms
journal, January 2010

  • Schaller, G.; Schutzhold, R.
  • Quantum Information and Computation, Vol. 10, Issue 1&2
  • DOI: 10.26421/QIC10.1-2-9

Path integrals and stationary-phase approximations
journal, April 1979


Matrix Analysis
book, April 2013


Theory of Quantum Annealing of an Ising Spin Glass
journal, March 2002


Bounds for the adiabatic approximation with applications to quantum computation
journal, October 2007

  • Jansen, Sabine; Ruskai, Mary-Beth; Seiler, Ruedi
  • Journal of Mathematical Physics, Vol. 48, Issue 10
  • DOI: 10.1063/1.2798382

Quantum Speedup by Quantum Annealing
journal, July 2012


Strict detailed balance is unnecessary in Monte Carlo simulation
journal, February 1999

  • Manousiouthakis, Vasilios I.; Deem, Michael W.
  • The Journal of Chemical Physics, Vol. 110, Issue 6
  • DOI: 10.1063/1.477973

Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
journal, October 2009

  • Lidar, Daniel A.; Rezakhani, Ali T.; Hamma, Alioscia
  • Journal of Mathematical Physics, Vol. 50, Issue 10
  • DOI: 10.1063/1.3236685

Quantum annealing: A new method for minimizing multidimensional functions
journal, March 1994


Continuous-time quantum algorithms for unstructured problems
journal, January 2014


Landau-Zener model: Effects of finite coupling duration
journal, June 1996


Quantum annealing: The fastest route to quantum computation?
journal, February 2015


Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
journal, September 2002


A family of embedded Runge-Kutta formulae
journal, March 1980


A variable order Runge-Kutta method for initial value problems with rapidly varying right-hand sides
journal, September 1990

  • Cash, J. R.; Karp, Alan H.
  • ACM Transactions on Mathematical Software, Vol. 16, Issue 3
  • DOI: 10.1145/79505.79507

Sherrington-Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations
journal, June 1989


Colloquium : Quantum annealing and analog quantum computation
journal, September 2008


Collective Monte Carlo Updating for Spin Systems
journal, January 1989


Mean passage times for tridiagonal transition matrices
journal, September 1995

  • Stefanov, Valeri T.
  • Journal of Applied Probability, Vol. 32, Issue 3
  • DOI: 10.2307/3215137

Quantum annealing in the transverse Ising model
journal, November 1998


Defining and detecting quantum speedup
journal, June 2014


Necessary condition for the quantum adiabatic approximation
journal, March 2010


Consistency of the Adiabatic Theorem
journal, June 2009


Quantum search by local adiabatic evolution
journal, March 2002


Atomic Coherent States in Quantum Optics
journal, December 1972


Quantum Monte Carlo simulations of tunneling in quantum adiabatic optimization
journal, March 2016


Optimization by Simulated Annealing
journal, May 1983


Mean passage times for tridiagonal transition matrices and a two-parameter ehrenfest urn model
journal, December 1993

  • Krafft, Olaf; Schaefer, Martin
  • Journal of Applied Probability, Vol. 30, Issue 4
  • DOI: 10.2307/3214525

Monte Carlo sampling methods using Markov chains and their applications
journal, April 1970


Quantum versus classical annealing of Ising spin glasses
journal, March 2015


Reexamining classical and quantum models for the D-Wave One processor: The role of excited states and ground state degeneracy
journal, February 2015

  • Albash, T.; Rønnow, T. F.; Troyer, M.
  • The European Physical Journal Special Topics, Vol. 224, Issue 1
  • DOI: 10.1140/epjst/e2015-02346-0