ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures

Brandhofer, S; Devitt, S; Polian, I

ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures

Brandhofer, S Devitt, S

Polian, I

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: 2021 IEEE European Test Symposium (ETS), 2021, 2021-May
Issue Date:: 2021-06-29

Closed Access

	Filename	Description	Size
	ArsoNISQ_Analyzing_Quantum_Algorithms_on_Near-Term_Architectures.pdf	Published version	2.78 MB	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	Brandhofer, S
dc.contributor.author	Devitt, S https://orcid.org/0000-0002-5901-1391
dc.contributor.author	Polian, I
dc.date	2021-05-24
dc.date.accessioned	2022-06-07T00:51:28Z
dc.date.available	2022-06-07T00:51:28Z
dc.date.issued	2021-06-29
dc.identifier.citation	2021 IEEE European Test Symposium (ETS), 2021, 2021-May
dc.identifier.isbn	9781665418492
dc.identifier.issn	1530-1877
dc.identifier.issn	1558-1780
dc.identifier.uri	http://hdl.handle.net/10453/157984
dc.description.abstract	While scalable, fully error corrected quantum computing is years or even decades away, there is considerable interest in noisy intermediate-scale quantum computing (NISQ). In this paper, we introduce the ArsoNISQ framework that determines the tolerable error rate of a given quantum algorithm computation, i.e. quantum circuits, and the success probability of the computation given a success criterion and a NISQ computer. ArsoNISQ is based on simulations of quantum circuits subject to errors according to the Pauli error model.ArsoNISQ was evaluated on a set of quantum algorithms that can incur a quantum speedup or are otherwise relevant to NISQ computing. Despite optimistic expectations in recent literature, we did not observe quantum algorithms with intrinsic robustness, i.e. algorithms that tolerate one error on average, in this evaluation. The evaluation demonstrated, however, that the quantum circuit size sets an upper bound for its tolerable error rate and quantified the difference in tolerate error rates for quantum circuits of similar sizes. Thus, the framework can assist quantum algorithm developers in improving their implementation and selecting a suitable NISQ computing platform. Extrapolating the results into the quantum advantage regime suggests that the error rate of larger quantum computers must decrease substantially or active quantum error correction will need to be deployed for most of the evaluated algorithms.
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	2021 IEEE European Test Symposium (ETS)
dc.relation.ispartof	2021 IEEE European Test Symposium
dc.relation.ispartofseries	Proceedings of the European Test Symposium
dc.relation.isbasedon	10.1109/ets50041.2021.9465414
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	08 Information and Computing Sciences, 09 Engineering
dc.title	ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures
dc.type	Conference Proceeding
utslib.citation.volume	2021-May
utslib.location.activity	Bruges, Belgium
utslib.for	08 Information and Computing 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/Strength - QSI - Centre for Quantum Software and Information
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-06-07T00:51:27Z
pubs.finish-date	2021-05-28
pubs.publication-status	Published
pubs.start-date	2021-05-24
pubs.volume	2021-May

Abstract:

While scalable, fully error corrected quantum computing is years or even decades away, there is considerable interest in noisy intermediate-scale quantum computing (NISQ). In this paper, we introduce the ArsoNISQ framework that determines the tolerable error rate of a given quantum algorithm computation, i.e. quantum circuits, and the success probability of the computation given a success criterion and a NISQ computer. ArsoNISQ is based on simulations of quantum circuits subject to errors according to the Pauli error model.ArsoNISQ was evaluated on a set of quantum algorithms that can incur a quantum speedup or are otherwise relevant to NISQ computing. Despite optimistic expectations in recent literature, we did not observe quantum algorithms with intrinsic robustness, i.e. algorithms that tolerate one error on average, in this evaluation. The evaluation demonstrated, however, that the quantum circuit size sets an upper bound for its tolerable error rate and quantified the difference in tolerate error rates for quantum circuits of similar sizes. Thus, the framework can assist quantum algorithm developers in improving their implementation and selecting a suitable NISQ computing platform. Extrapolating the results into the quantum advantage regime suggests that the error rate of larger quantum computers must decrease substantially or active quantum error correction will need to be deployed for most of the evaluated algorithms.

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

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