How do we quantify the utility of quantum algorithms?

Devitt, SJ

How do we quantify the utility of quantum algorithms?

Devitt, SJ

Permalink

Publisher:: Cambridge University Press (CUP)
Publication Type:: Journal Article
Citation:: Research Directions Quantum Technologies, 2023, 1
Issue Date:: 2023

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (129.96 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Devitt, SJ
dc.date.accessioned	2024-02-06T04:15:34Z
dc.date.available	2024-02-06T04:15:34Z
dc.date.issued	2023
dc.identifier.citation	Research Directions Quantum Technologies, 2023, 1
dc.identifier.issn	2752-9444
dc.identifier.issn	2752-9444
dc.identifier.uri	http://hdl.handle.net/10453/175363
dc.description.abstract	<jats:p>Quantum computing advantage emerges not from brute force power, but from subtle differences in information processing that can occur for key bottleneck subroutines. In 2019, the Google Quantum AI team performed a landmark experiment demonstrating quantum computational supremacy (Arute et al., 2019) where they performed a quantum computation that, at the time, could not be done on a classical supercomputer. This was remarkable because it was achieved by a processor with only 53 qubits, an observation that emerged from theoretical work which identified that quantum computers could have a massive advantage for certain specially designed benchmarking tasks (Boixo et al., 2018; Bremner et al., 2016).</jats:p>
dc.language	en
dc.publisher	Cambridge University Press (CUP)
dc.relation.ispartof	Research Directions Quantum Technologies
dc.relation.isbasedon	10.1017/qut.2022.7
dc.rights	info:eu-repo/semantics/openAccess
dc.title	How do we quantify the utility of quantum algorithms?
dc.type	Journal Article
utslib.citation.volume	1
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	open_access	*
dc.date.updated	2024-02-06T04:15:33Z
pubs.publication-status	Published
pubs.volume	1

Abstract:

Quantum computing advantage emerges not from brute force power, but from subtle differences in information processing that can occur for key bottleneck subroutines. In 2019, the Google Quantum AI team performed a landmark experiment demonstrating quantum computational supremacy (Arute et al., 2019) where they performed a quantum computation that, at the time, could not be done on a classical supercomputer. This was remarkable because it was achieved by a processor with only 53 qubits, an observation that emerged from theoretical work which identified that quantum computers could have a massive advantage for certain specially designed benchmarking tasks (Boixo et al., 2018; Bremner et al., 2016).

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

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