Lower bounds on quantum annealing times
The adiabatic theorem provides sufficient conditions for the time needed to prepare a target
ground state. While it is possible to prepare a target state much faster with more general …
ground state. While it is possible to prepare a target state much faster with more general …
Gate-based counterdiabatic driving with complexity guarantees
D van Vreumingen - arXiv preprint arXiv:2406.08064, 2024 - arxiv.org
We propose a general, fully gate-based quantum algorithm for counterdiabatic driving. The
algorithm does not depend on heuristics as in previous variational methods, and exploits …
algorithm does not depend on heuristics as in previous variational methods, and exploits …