Black-box quantum state preparation without arithmetic

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

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


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.
Original languageEnglish
Article number020502
Pages (from-to)020502-1-020502-5
Number of pages5
JournalPhysical Review Letters
Issue number2
Publication statusPublished - 16 Jan 2019


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


Dive into the research topics of 'Black-box quantum state preparation without arithmetic'. Together they form a unique fingerprint.

Cite this