Black-Box Quantum State Preparation without Arithmetic.

Sanders, YR; Low, GH; Scherer, A; Berry, DW

Black-Box Quantum State Preparation without Arithmetic.

Sanders, YR Low, GH Scherer, A Berry, DW

Permalink

Publisher:: AMER PHYSICAL SOC
Publication Type:: Journal Article
Citation:: Phys Rev Lett, 2019, 122, (2), pp. 020502
Issue Date:: 2019-01-18

Closed Access

	Filename	Description	Size
	PhysRevLett.122.020502.pdf	Published version	149.29 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Sanders, YR
dc.contributor.author	Low, GH
dc.contributor.author	Scherer, A
dc.contributor.author	Berry, DW
dc.date.accessioned	2022-10-05T14:36:00Z
dc.date.available	2022-10-05T14:36:00Z
dc.date.issued	2019-01-18
dc.identifier.citation	Phys Rev Lett, 2019, 122, (2), pp. 020502
dc.identifier.issn	0031-9007
dc.identifier.issn	1079-7114
dc.identifier.uri	http://hdl.handle.net/10453/162333
dc.description.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.
dc.format	Print
dc.language	eng
dc.publisher	AMER PHYSICAL SOC
dc.relation.ispartof	Phys Rev Lett
dc.relation.isbasedon	10.1103/PhysRevLett.122.020502
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 02 Physical Sciences, 09 Engineering
dc.subject.classification	General Physics
dc.title	Black-Box Quantum State Preparation without Arithmetic.
dc.type	Journal Article
utslib.citation.volume	122
utslib.location.activity	United States
utslib.for	01 Mathematical Sciences
utslib.for	02 Physical Sciences
utslib.for	09 Engineering
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access	*
dc.date.updated	2022-10-05T14:35:57Z
pubs.issue	2
pubs.publication-status	Published
pubs.volume	122
utslib.citation.issue	2

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/162333