Speaker
Description
Flow equations, introduced in the 1990s, have proven to be a powerful tool for Hamiltonian diagonalization in various fields, including high-energy physics. Inspired by this classical method, we present double-bracket quantum algorithms (DBQAs) as a quantum counterpart for diagonalizing Hamiltonians.
We explore the compilation of DBQAs into quantum circuits by proposing a quantum circuit synthesis technique that utilizes local Hamiltonian and simple diagonal evolutions. This method offers a more intuitive and computationally efficient approach to the compilation problem.
We demonstrate DBQAs practical application in high-fidelity ground state preparation. By combining DBQAs with other quantum computing techniques, we can significantly improve the quality of results while maintaining computational efficiency, making them suitable for near-term quantum devices.
Short summary
We present double-bracket quantum algorithms for diagonalization and ground state preparation. After introducing the algorithm from a theoretical perspective, we address synthesis and compilation techniques, presenting an application example where, in the context of ground state preparation, these algorithms significantly enhance the results of other quantum computing techniques.
Email Address of submitter
matteo.robbiati@cern.ch
