Quantum computing has long promised to offer capabilities beyond classical computing, with potential applications ranging from simulation of molecules, to cryptography, to decision making in finance. To successfully harness the unique power of quantum phenomena, algorithms must be carefully designed. On the other hand, practical implementation of quantum algorithms is subject to physical constraints on quantum devices such as limited coherence time and imperfect operations. In the near term, quantum-classical hybrid algorithms have been invented to bypass certain limitations. Recent improvements on quantum hardware present us with great opportunities. We may start to see practical use of quantum computing, and test fault-tolerant algorithms that were previously beyond our reach. While encouraging the design of fault-tolerant quantum algorithms, this also prompts us to reflect on near-term approaches and study their utility in different regimes. The tutorial will feature speakers who are experts on quantum-classical hybrid algorithms, quantum simulation in physics and chemistry, quantum algorithms on differential equations, and computational complexity in quantum algorithms. The lectures will include techniques, applications, and challenges for both quantum-classical hybrid algorithms and fault-tolerant quantum algorithms.
Topics
- Quantum-classical hybrid algorithms: With a focus on variational quantum algorithms, their application in physics and chemistry.
- Features of hybrid algorithms: Analysis of variational quantum algorithms, including ansatz features and challenges in optimization. Quantum machine learning.
- Quantum simulation: State-of-the-art algorithms for Hamiltonian simulation, including techniques such as linear combination of unitaries and block encoding, the computational complexity associated with the algorithms.
- Techniques in fault-tolerant quantum algorithms: Including quantum Fourier transformation and phase estimation, quantum signal processing, quantum singular value transformation.
Who should attend?
Graduate students and researchers new to the field of quantum algorithms, researchers from other disciplines who would like to apply quantum computing in their research. The lectures will introduce the basic principles in designing quantum algorithms, review the state-of-the-art techniques, and discuss the outstanding challenges in this fast-growing field.
Organizer
- Yanzhu Chen, Florida State University
Presenters
- Nicholas Mayhall, Virginia Tech
- Di Fang, Duke University
- Dominic Berry, Macquarie University
- Zoë Holmes, EPFL