Rhonda Au-Yeung
Quantum algorithms for scientific computing.
Au-Yeung, Rhonda; Camino, Bruno; Rathore, Omer; Kendon, Viv
Authors
Bruno Camino
Dr Omer Rathore omer.rathore@durham.ac.uk
Post Doctoral Research Associate
Dr Vivien Kendon viv.kendon@durham.ac.uk
Academic Visitor
Abstract
Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in real world applications. Areas that are likely to have the greatest impact on high performance computing (HPC) include simulation of quantum systems, optimization, and machine learning. We draw our examples from electronic structure calculations and computational fluid dynamics which account for a large fraction of current scientific and engineering use of HPC. Potential challenges include encoding and decoding classical data for quantum devices, and mismatched clock speeds between classical and quantum processors. Even a modest quantum enhancement to current classical techniques would have far-reaching impacts in areas such as weather forecasting, engineering, aerospace, drug design, and the design of ``green'' materials for sustainable development. This requires significant effort from the computational science, engineering and quantum computing communities working together.
. [Abstract copyright: Creative Commons Attribution license.]
Citation
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. (2024). Quantum algorithms for scientific computing. Reports on Progress in Physics, 87(11), Article 116001. https://doi.org/10.1088/1361-6633/ad85f0
Journal Article Type | Article |
---|---|
Acceptance Date | Oct 11, 2024 |
Online Publication Date | Oct 29, 2024 |
Publication Date | 2024-11 |
Deposit Date | Nov 1, 2024 |
Publicly Available Date | Nov 1, 2024 |
Journal | Reports on Progress in Physics |
Print ISSN | 0034-4885 |
Electronic ISSN | 1361-6633 |
Publisher | IOP Publishing |
Peer Reviewed | Peer Reviewed |
Volume | 87 |
Issue | 11 |
Article Number | 116001 |
DOI | https://doi.org/10.1088/1361-6633/ad85f0 |
Keywords | quantum computing, quantum algorithms, scientific computing |
Public URL | https://durham-repository.worktribe.com/output/2988924 |
Files
Published Journal Article
(2.8 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
You might also like
Cycle discrete-time quantum walks on a noisy quantum computer
(2024)
Journal Article
Using copies can improve precision in continuous-time quantum computing
(2023)
Journal Article
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
Experimental test of search range in quantum annealing
(2021)
Journal Article
The controlled SWAP test for determining quantum entanglement
(2021)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search