Black-box quantum state preparation without arithmetic
Quantum Physics
2019-02-01 v2
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.
Cite
@article{arxiv.1807.03206,
title = {Black-box quantum state preparation without arithmetic},
author = {Yuval R. Sanders and Guang Hao Low and Artur Scherer and Dominic W. Berry},
journal= {arXiv preprint arXiv:1807.03206},
year = {2019}
}
Comments
This version is identical in content to the published version. Presentation much improved and Table I added