Strategies for optimizing double-bracket quantum algorithms
Li Xiaoyue, Matteo Robbiati, Andrea Pasquale, Edoardo Pedicillo,, Andrew Wright, Stefano Carrazza, Marek Gluza

TL;DR
This paper introduces optimization strategies for double-bracket quantum algorithms, improving their efficiency in approximating eigenstates by selecting optimal evolutions and parameters, with practical implementations for current quantum hardware.
Contribution
It proposes novel methods to optimize double-bracket quantum algorithms, including generator and duration selection, and offers practical gate-based parametrizations suitable for current quantum devices.
Findings
Optimized evolution parameters improve eigenstate approximation.
Adaptive and variational approaches enhance convergence.
Gate-based parametrizations facilitate implementation on existing hardware.
Abstract
Recently double-bracket quantum algorithms have been proposed as a way to compile circuits for approximating eigenstates. Physically, they consist of appropriately composing evolutions under an input Hamiltonian together with diagonal evolutions. Here, we present strategies to optimize the choice of the double-bracket evolutions to enhance the diagonalization efficiency. This can be done by finding optimal generators and durations of the evolutions. We present numerical results regarding the preparation of double-bracket iterations, both in ideal cases where the algorithm's setup provides analytical convergence guarantees and in more heuristic cases, where we use an adaptive and variational approach to optimize the generators of the evolutions. As an example, we discuss the efficacy of these optimization strategies when considering a spin-chain Hamiltonian as the target. To propose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
