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

Title: Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

Abstract

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the XZ and transverse Ising model, respectively. For A qubits BRGC yields 2A positions and is reduced to its 2-local form with O(A) ancillary qubits. H2GC yields 2A/2+1 positions with O(A2) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of k-local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect tomore » lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.« less

Authors:
ORCiD logo; ORCiD logo; ORCiD logo; ORCiD logo
Publication Date:
Research Org.:
Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Nuclear Physics (NP); National Science Foundation (NSF); Heising-Simons Foundation
OSTI Identifier:
1872657
Alternate Identifier(s):
OSTI ID: 1876843
Grant/Contract Number:  
AC02-05CH11231; PHY-2020275; 2017-228; SC0017865
Resource Type:
Published Article
Journal Name:
PRX Quantum
Additional Journal Information:
Journal Name: PRX Quantum Journal Volume: 3 Journal Issue: 2; Journal ID: ISSN 2691-3399
Publisher:
American Physical Society
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; adiabatic quantum optimization; quantum computation; quantum computing models; quantum algorithms; quantum simulation

Citation Formats

Chang, Chia Cheng, McElvain, Kenneth S., Rrapaj, Ermal, and Wu, Yantao. Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers. United States: N. p., 2022. Web. doi:10.1103/PRXQuantum.3.020356.
Chang, Chia Cheng, McElvain, Kenneth S., Rrapaj, Ermal, & Wu, Yantao. Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers. United States. https://doi.org/10.1103/PRXQuantum.3.020356
Chang, Chia Cheng, McElvain, Kenneth S., Rrapaj, Ermal, and Wu, Yantao. Wed . "Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers". United States. https://doi.org/10.1103/PRXQuantum.3.020356.
@article{osti_1872657,
title = {Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers},
author = {Chang, Chia Cheng and McElvain, Kenneth S. and Rrapaj, Ermal and Wu, Yantao},
abstractNote = {We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the XZ and transverse Ising model, respectively. For A qubits BRGC yields 2A positions and is reduced to its 2-local form with O(A) ancillary qubits. H2GC yields 2A/2+1 positions with O(A2) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of k-local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.},
doi = {10.1103/PRXQuantum.3.020356},
journal = {PRX Quantum},
number = 2,
volume = 3,
place = {United States},
year = {Wed Jun 15 00:00:00 EDT 2022},
month = {Wed Jun 15 00:00:00 EDT 2022}
}

Works referenced in this record:

Accurate nucleon-nucleon potential with charge-independence breaking
journal, January 1995

  • Wiringa, R. B.; Stoks, V. G. J.; Schiavilla, R.
  • Physical Review C, Vol. 51, Issue 1
  • DOI: 10.1103/PhysRevC.51.38

Quantum momentum distribution and quantum entanglement in the deep tunneling regime
journal, January 2020

  • Wu, Yantao; Car, Roberto
  • The Journal of Chemical Physics, Vol. 152, Issue 2
  • DOI: 10.1063/1.5133053

Hadamard transform image coding
journal, January 1969

  • Pratt, W. K.; Kane, J.; Andrews, H. C.
  • Proceedings of the IEEE, Vol. 57, Issue 1
  • DOI: 10.1109/PROC.1969.6869

Efficient quantum circuits for diagonal unitaries without ancillas
journal, March 2014


A Closed Set of Normal Orthogonal Functions
journal, January 1923

  • Walsh, J. L.
  • American Journal of Mathematics, Vol. 45, Issue 1
  • DOI: 10.2307/2387224

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

Zur Quantentheorie der Molekeln
journal, January 1927


Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
journal, July 2018


Unit-Distance Error-Checking Codes
journal, June 1958


Further results on snakes in powers of complete graphs
journal, August 1991


Construction of model Hamiltonians for adiabatic quantum computation and its application to finding low-energy conformations of lattice protein models
journal, July 2008


Mean-Field Solution of the Weak-Strong Cluster Problem for Quantum Annealing with Stoquastic and Non-Stoquastic Catalysts
journal, April 2020

  • Takada, Kabuki; Yamashiro, Yu; Nishimori, Hidetoshi
  • Journal of the Physical Society of Japan, Vol. 89, Issue 4
  • DOI: 10.7566/JPSJ.89.044001

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


An algorithm for the machine calculation of complex Fourier series
journal, May 1965


Quantum annealing in the transverse Ising model
journal, November 1998


Unified Approach for Molecular Dynamics and Density-Functional Theory
journal, November 1985


Unit-Distance Binary-Decimal Codes for Two-Track Commutation
journal, September 1956


Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians
journal, June 2020


On Matrix Partitioning and a Class of Algorithms
journal, August 1970


Quantum computing for quantum tunneling
journal, January 2021


A sequency-ordered fast Walsh transform
journal, August 1972


Quantum tunneling splittings from path-integral molecular dynamics
journal, March 2016

  • Mátyus, Edit; Wales, David J.; Althorpe, Stuart C.
  • The Journal of Chemical Physics, Vol. 144, Issue 11
  • DOI: 10.1063/1.4943867

The map method for synthesis of combinational logic circuits
journal, January 1953

  • Karnaugh, M.
  • Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, Vol. 72, Issue 5
  • DOI: 10.1109/TCE.1953.6371932

Volume dependence of the energy spectrum in massive quantum field theories: II. Scattering states
journal, June 1986

  • Lüscher, M.
  • Communications in Mathematical Physics, Vol. 105, Issue 2
  • DOI: 10.1007/BF01211097

Perspectives of quantum annealing: methods and implementations
journal, May 2020

  • Hauke, Philipp; Katzgraber, Helmut G.; Lechner, Wolfgang
  • Reports on Progress in Physics, Vol. 83, Issue 5
  • DOI: 10.1088/1361-6633/ab85b8