Quantum Algorithms from Foundations to Applications

ended

"Quantum computers are designed to use quantum mechanics to go beyond the power of any standard computer based only on classical physics. Following intensive experimental efforts, it is predicted that a demonstration of so-called ""quantum computational supremacy"" will occur in the near future. However, many urgent questions remain regarding the usefulness of quantum computers for problems of real practical interest, and the timescale on which such usefulness will be achieved. The overall goal of this project is to address the most significant near-term and long-range theoretical challenges involved in bringing quantum algorithms to practical applications. The project comprises three programmes of work, with the following goals: - Design quantum algorithms that accelerate general classical algorithmic frameworks; develop efficient quantum communication protocols; and characterise the features of problems that allow a quantum speedup; - Demonstrate larger quantum-classical separations than previously known, and enable rigorous verification of quantum computational supremacy experiments; - Find new quantum algorithms for key problems in quantum physics, including learning and testing algorithms for large quantum systems. Simulation of quantum-mechanical systems is considered the most important application area for quantum computers, yet current algorithms are still beyond the reach of near-term devices. A unique feature of this project is its approach encompassing the full spectrum of quantum algorithms research, from underpinning mathematics through to detailed analysis of applications. Making progress on the foundations will enable progress on the more technically challenging aspects of applications, while having particular applications in mind will raise interesting new foundational questions. "