Black-box quantum state preparation without arithmetic

Yuval Sanders, Guang Hao Low, Artur Scherer, Dominic Berry

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286–374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer to reality.
LanguageEnglish
Article number020502
Pages020502-1-020502-5
Number of pages5
JournalPhysical Review Letters
Volume122
Issue number2
DOIs
Publication statusPublished - 16 Jan 2019

Fingerprint

subroutines
quantum computers
boxes
preparation
physics
simulation

Keywords

  • quantum algorithm
  • quantum computing
  • quantum simulation
  • quantum search

Cite this

Sanders, Yuval ; Low, Guang Hao ; Scherer, Artur ; Berry, Dominic. / Black-box quantum state preparation without arithmetic. In: Physical Review Letters. 2019 ; Vol. 122, No. 2. pp. 020502-1-020502-5.
@article{ce0b89ce266a4d62bb4f04dce2c9237b,
title = "Black-box quantum state preparation without arithmetic",
abstract = "Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286–374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer to reality.",
keywords = "quantum algorithm, quantum computing, quantum simulation, quantum search",
author = "Yuval Sanders and Low, {Guang Hao} and Artur Scherer and Dominic Berry",
year = "2019",
month = "1",
day = "16",
doi = "10.1103/PhysRevLett.122.020502",
language = "English",
volume = "122",
pages = "020502--1--020502--5",
journal = "Physical Review Letters",
issn = "0031-9007",
publisher = "American Physical Society",
number = "2",

}

Black-box quantum state preparation without arithmetic. / Sanders, Yuval; Low, Guang Hao; Scherer, Artur; Berry, Dominic.

In: Physical Review Letters, Vol. 122, No. 2, 020502, 16.01.2019, p. 020502-1-020502-5.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Black-box quantum state preparation without arithmetic

AU - Sanders, Yuval

AU - Low, Guang Hao

AU - Scherer, Artur

AU - Berry, Dominic

PY - 2019/1/16

Y1 - 2019/1/16

N2 - Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286–374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer to reality.

AB - Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286–374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer to reality.

KW - quantum algorithm

KW - quantum computing

KW - quantum simulation

KW - quantum search

UR - http://purl.org/au-research/grants/arc/DP160102426

U2 - 10.1103/PhysRevLett.122.020502

DO - 10.1103/PhysRevLett.122.020502

M3 - Article

VL - 122

SP - 020502-1-020502-5

JO - Physical Review Letters

T2 - Physical Review Letters

JF - Physical Review Letters

SN - 0031-9007

IS - 2

M1 - 020502

ER -