An HHL-based algorithm for computing hitting probabilities of quantum walks

Guan, J; Wang, Q; Ying, M

An HHL-based algorithm for computing hitting probabilities of quantum walks

Guan, J Wang, Q Ying, M

Permalink

Publisher:: RINTON PRESS, INC
Publication Type:: Journal Article
Citation:: Quantum Information and Computation, 2021, 21, (5-6), pp. 395-408
Issue Date:: 2021-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (364.14 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Guan, J
dc.contributor.author	Wang, Q
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X
dc.date.accessioned	2022-03-10T21:46:39Z
dc.date.available	2022-03-10T21:46:39Z
dc.date.issued	2021-01-01
dc.identifier.citation	Quantum Information and Computation, 2021, 21, (5-6), pp. 395-408
dc.identifier.issn	1533-7146
dc.identifier.issn	1533-7146
dc.identifier.uri	http://hdl.handle.net/10453/155139
dc.description.abstract	We present a novel appliation of the HHL (Harrow-Hassidim-Lloyd) algorithm — a quantum algorithm solving systems of linear equations — in solving an open problem about quantum walks, namely omputing hitting (or absorption) probabilities of a general (not only Hadamard) one-dimensional quantum walks with two absorbing bound-aries. This is ahieved by a simple observation that the problem of omputing hitting probabilities of quantum walks an be redued to inverting a matrix. Then a quantum algorithm with the HHL algorithm as a subroutine is developed for solving the problem, whih is faster than the known lassial algorithms by numerial experiments.
dc.language	English
dc.publisher	RINTON PRESS, INC
dc.relation.ispartof	Quantum Information and Computation
dc.relation.isbasedon	10.26421/QIC21.5-6-4
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	0206 Quantum Physics
dc.subject.classification	Mathematical Physics
dc.title	An HHL-based algorithm for computing hitting probabilities of quantum walks
dc.type	Journal Article
utslib.citation.volume	21
utslib.for	0206 Quantum Physics
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/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access	*
dc.date.updated	2022-03-10T21:46:38Z
pubs.issue	5-6
pubs.publication-status	Published
pubs.volume	21
utslib.citation.issue	5-6

Abstract:

We present a novel appliation of the HHL (Harrow-Hassidim-Lloyd) algorithm — a quantum algorithm solving systems of linear equations — in solving an open problem about quantum walks, namely omputing hitting (or absorption) probabilities of a general (not only Hadamard) one-dimensional quantum walks with two absorbing bound-aries. This is ahieved by a simple observation that the problem of omputing hitting probabilities of quantum walks an be redued to inverting a matrix. Then a quantum algorithm with the HHL algorithm as a subroutine is developed for solving the problem, whih is faster than the known lassial algorithms by numerial experiments.

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

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