Thesis
Quantum algorithms from the near to future term
- Abstract:
-
Many important physical and mathematical problems are difficult to solve on classical computers, resulting in difficulty in finding new advanced materials, simulating quantum field theories and solving large combinatorial optimisation tasks. Quantum computers have shown great promise in being able to solve these (and many other) problems faster than their classical counterparts, and therefore should be thoroughly investigated as a significant tool for enabling the acceleration of scientific progress.
This work develops methods to tackle several problems across the spectrum of quantum algorithms, providing methods suitable for the near-term hardware, to the future where large fault-tolerant quantum computers exist. Therefore, the works in this thesis range from efficiently making use of limited quantum hardware to taking advantage of hardware benefits (e.g. excess qubits) as quantum computation advances.
Covered topics include: an alternative paradigm for the optimisation of variational circuits and quantum neural networks; techniques for improving energy estimation of quantum states through the collection and processing of large amounts of randomised measurement data; the use of entanglement in guiding the automatic discovery of quantum circuits; investigating the role of symmetries in adiabatic state preparation of molecules and the large scale parallelisation of a common fault-tolerant subroutine, potentially producing large runtime speed-ups for the simulation of chemistry on quantum computers.
Although there are many challenges remaining from both hardware and algorithms perspectives before the large-scale utility of quantum computers can be demonstrated, the contributions of this work make steps towards the efficient utilisation of quantum hardware that will be available in the coming years.
Actions
Access Document
- Files:
-
-
(Preview, Dissemination version, pdf, 3.2MB, Terms of use)
-
Authors
Contributors
+ Benjamin, S
- Institution:
- University of Oxford
- Division:
- MPLS
- Department:
- Materials
- Role:
- Supervisor
- ORCID:
- 0000-0002-7766-5348
+ Koczor, B
- Institution:
- University of Oxford
- Division:
- MPLS
- Department:
- Mathematical Institute
- Role:
- Supervisor
- ORCID:
- 0000-0002-4319-6870
+ Engineering and Physical Sciences Research Council
More from this funder
- Funder identifier:
- https://ror.org/0439y7842
- DOI:
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
- Language:
-
English
- Deposit date:
-
2026-04-23
- ARK identifier:
Terms of use
- Copyright holder:
- Gregory Boyd
- Copyright date:
- 2025
- Notes:
- Training variational quantum circuits with CoVaR: covariance root finding with classical shadows and High-dimensional subspace expansion using classical shadows are derived from this thesis.
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record