Error Analysis of the Variational Quantum Eigensolver Algorithm

Brandhofer, S; Devitt, S; Polian, I

Error Analysis of the Variational Quantum Eigensolver Algorithm

Brandhofer, S Devitt, S

Polian, I

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: 2021 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH), 2021, 00
Issue Date:: 2021-12-16

Closed Access

	Filename	Description	Size
	Error_Analysis_of_the_Variational_Quantum_Eigensolver_Algorithm (1).pdf	Published version	967.34 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	Brandhofer, S
dc.contributor.author	Devitt, S https://orcid.org/0000-0002-5901-1391
dc.contributor.author	Polian, I
dc.date	2021-11-08
dc.date.accessioned	2022-04-13T22:41:23Z
dc.date.available	2022-04-13T22:41:23Z
dc.date.issued	2021-12-16
dc.identifier.citation	2021 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH), 2021, 00
dc.identifier.isbn	9781665409599
dc.identifier.issn	2327-8218
dc.identifier.uri	http://hdl.handle.net/10453/156231
dc.description.abstract	Variational quantum algorithms have been one of the most intensively studied applications for near-term quantum computing applications. The noisy intermediate-scale quantum (NISQ) regime, where small enough algorithms can be run successfully on noisy quantum computers expected during the next 5 years, is driving both a large amount of research work and a significant amount of private sector funding. Therefore, it is important to understand whether variational algorithms are effective at successfully converging to the correct answer in presence of noise. We perform a comprehensive study of the variational quantum eigensolver (VQE) and its individual quantum subroutines. Building on asymptotic bounds, we show through explicit simulation that the VQE algorithm effectively collapses already when single errors occur during a quantum processing call. We discuss the significant implications of this result in the context of being able to run any variational type algorithm without resource expensive error correction protocols.
dc.language	en
dc.publisher	IEEE
dc.relation.ispartof	2021 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH)
dc.relation.ispartof	2021 IEEE/ACM International Symposium on Nanoscale Architectures
dc.relation.ispartofseries	IEEE International Symposium on Nanoscale Architectures
dc.relation.isbasedon	10.1109/nanoarch53687.2021.9642249
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Error Analysis of the Variational Quantum Eigensolver Algorithm
dc.type	Conference Proceeding
utslib.citation.volume	00
utslib.location.activity	AB, Canada
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	closed_access	*
dc.date.updated	2022-04-13T22:41:22Z
pubs.finish-date	2021-11-10
pubs.publication-status	Published
pubs.start-date	2021-11-08
pubs.volume	00

Abstract:

Variational quantum algorithms have been one of the most intensively studied applications for near-term quantum computing applications. The noisy intermediate-scale quantum (NISQ) regime, where small enough algorithms can be run successfully on noisy quantum computers expected during the next 5 years, is driving both a large amount of research work and a significant amount of private sector funding. Therefore, it is important to understand whether variational algorithms are effective at successfully converging to the correct answer in presence of noise. We perform a comprehensive study of the variational quantum eigensolver (VQE) and its individual quantum subroutines. Building on asymptotic bounds, we show through explicit simulation that the VQE algorithm effectively collapses already when single errors occur during a quantum processing call. We discuss the significant implications of this result in the context of being able to run any variational type algorithm without resource expensive error correction protocols.

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

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