Jemma Bennett jemma.e.bennett@durham.ac.uk
PGR Student Doctor of Philosophy
Using copies can improve precision in continuous-time quantum computing
Bennett, Jemma; Callison, Adam; O’Leary, Tom; West, Mia; Chancellor, Nicholas; Kendon, Viv
Authors
Adam Callison
Tom O’Leary
Mia West
Dr Nicholas Chancellor nicholas.chancellor@durham.ac.uk
Teaching Fellow QO
Dr Vivien Kendon viv.kendon@durham.ac.uk
Academic Visitor
Abstract
In the quantum optimisation setting, we build on a scheme introduced by Young et al (2013 Phys. Rev. A 88 062314), where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logical system's robustness to error. We introduce several innovations that improve the error suppression of this scheme under a special model of control noise, designed to understand how limited precision could be overcome. First, we note that only one copy needs to be correct by the end of the computation, since solution quality can be checked efficiently. Second, we find that ferromagnetic links do not generally help in this 'one correct copy' setting, but anti-ferromagnetic links do help on average, by suppressing the chance of the same error being present on all of the copies. Third, we find that minimum-strength anti-ferromagnetic links perform best, by counteracting the spin-flips induced by the errors. We have numerically tested our innovations on small instances of spin glasses from Callison et al (2019 New J. Phys.21 123022), and we find improved error tolerance for three or more copies in configurations that include frustration. Interpreted as an effective precision increase, we obtain several extra bits of precision on average for three copies connected in a triangle. This provides proof-of-concept of a method for scaling quantum annealing beyond the precision limits of hardware, a step towards fault tolerance in this setting.
Citation
Bennett, J., Callison, A., O’Leary, T., West, M., Chancellor, N., & Kendon, V. (2023). Using copies can improve precision in continuous-time quantum computing. Quantum Science and Technology, 8(3), Article 035031. https://doi.org/10.1088/2058-9565/acdcb5
Journal Article Type | Article |
---|---|
Acceptance Date | Jun 8, 2023 |
Online Publication Date | Jul 3, 2023 |
Publication Date | 2023-07 |
Deposit Date | Aug 17, 2023 |
Publicly Available Date | Aug 17, 2023 |
Journal | Quantum Science and Technology |
Electronic ISSN | 2058-9565 |
Publisher | IOP Publishing |
Peer Reviewed | Peer Reviewed |
Volume | 8 |
Issue | 3 |
Article Number | 035031 |
DOI | https://doi.org/10.1088/2058-9565/acdcb5 |
Keywords | Electrical and Electronic Engineering; Physics and Astronomy (miscellaneous); Materials Science (miscellaneous); Atomic and Molecular Physics, and Optics |
Public URL | https://durham-repository.worktribe.com/output/1720353 |
Files
Published Journal Article
(1.2 Mb)
PDF
Licence
http://creativecommons.org/licenses/by/4.0/
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
Original content from this work may be used under the terms of the Creative Commons Attribution 4.0 license. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
You might also like
Quantum algorithms for scientific computing.
(2024)
Journal Article
Cycle discrete-time quantum walks on a noisy quantum computer
(2024)
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 © 2025
Advanced Search