744 citations · 3.7k across the 55 of their papers we have counts for
55 papers
Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
David Jennings, Matteo Lostaglio, Sam Pallister +2
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum li…
Unveiling the non-Abelian statistics of anyons via photonic simulation
Suraj Goel, Matthew Reynolds, Matthew Girling +6
Simulators can realise novel phenomena by separating them from the complexities of a full physical implementation. Here we put forward a scheme that can simulate the exotic statist…
A simple formulation of no-cloning and no-hiding that admits efficient and robust verification
Matthew Girling, Cristina Cirstoiu, David Jennings
Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instance…
General entropic constraints on CSS codes within magic distillation protocols
Rhea Alexander, Si Gvirtz-Chen, Nikolaos Koukoulekidis +1
Magic states are fundamental building blocks on the road to fault-tolerant quantum computing. CSS codes play a crucial role in the construction of magic distillation protocols. Pre…
Faster Born probability estimation via gate merging and frame optimisation
Nikolaos Koukoulekidis, Hyukjoon Kwon, Hyejung H. Jee +2
Outcome probability estimation via classical methods is an important task for validating quantum computing devices. Outcome probabilities of any quantum circuit can be estimated us…
Towards quantum key distribution with noisy communication sources
Adam Walton, Anne Ghesquière, David Jennings +1
A beam emitted by a displaced thermal source, incident on a beam splitter, is used as the source in a central broadcast quantum key distribution protocol. These displaced thermal s…