Online Seminar: Dr Viv Kendon, Durham University, UK

Strategies for quantum optimisation algorithms with short run-times.

abstract colourful light wave pattern and circular pattern in the centre

Image: Wallpapers Cave

Quantum computing using continuous-time evolution

SPEAKER: Dr Viv Kendon

AFFILIATION:  Durham University, Durham, UK

HOSTED BY: Dr Peter Rohde, UTS Centre for Quantum Software and Information

ABSTRACT: 
Continuous-time quantum computing includes computation by continuous-time quantum walk (QW), adiabatic quantum computing (AQC), quantum annealing (QA), and special purpose quantum simulators.
All evolve the initial quantum state to the final quantum state using a continuous-time process.  This is a natural way to compute with quantum systems.
In the setting of the quantum search algorithm, interpolating between AQC and QW computation provides a family of continuous-time quantum algorithms, and also shows that QW is optimal under ideal conditions for large systems.
The structure of correlations can be exploited by choosing the encoding to match, providing further advantages for more realistic problems, such as spin-glasses.
Many repeats of short QW runs is effective for solving hard problems such as spin-glasses and MAX2SAT, providing a more practical approach than AQC in hardware with limited coherence times.
Hybrid strategies combining time-dependent controls with QW-like short timescales can significantly improve success rates over pure QW and we have recently developed tools to guide algorithm development in this setting.

Back to QSI Seminars & Events
Acknowledgement of Country

UTS acknowledges the Gadigal people of the Eora Nation, the Boorooberongal people of the Dharug Nation, the Bidiagal people and the Gamaygal people, upon whose ancestral lands our university stands. We would also like to pay respect to the Elders both past and present, acknowledging them as the traditional custodians of knowledge for these lands.