arXiv Analytics

Sign in

arXiv:2007.11212 [quant-ph]AbstractReferencesReviewsResources

Speedup of the Quantum Adiabatic Algorithm using Delocalization Catalysis

Chenfeng Cao, Jian Xue, Nic Shannon, Robert Joynt

Published 2020-07-22Version 1

We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization. This is applied to antiferromagnetic Heisenberg spin models. The algorithm is catalyzed in such a way that the evolution approximates such models in the middle of its course, and the model is in a delocalized phase. We show numerically that we can speed up the standard algorithm for finding the ground state of the random-field Ising model using this idea. We can also show that the speedup is due to gap amplification, even though the underlying model is not frustration-free. Our method is verified by experimental results from IBM quantum computer. Even though only relatively small systems can be investigated, the evidence suggests that the scaling of the method with system size is favorable. The cost of the catalytic method compared to the standard algorithm is only a constant factor.

Related articles: Most relevant | Search more
arXiv:2012.11660 [quant-ph] (Published 2020-12-21)
Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
arXiv:0811.0416 [quant-ph] (Published 2008-11-04)
Training a Binary Classifier with the Quantum Adiabatic Algorithm
arXiv:1712.05642 [quant-ph] (Published 2017-12-15)
Five Experimental Tests on the 5-Qubit IBM Quantum Computer