Quantum independent-set problem and non-Abelian adiabatic mixing
Name
PhysRevA.101.012318.pdf
Description
Published version
Size
719.78 KB
Format
Adobe PDF
Checksum (MD5)
38a4e5346d5e36e216463863ad370d47
Author(s) • •
Wu, Biao
Yu, Hongye
Wilczek, Frank
Date Issued
2020
Journal
Physical Review A
Publisher
American Physical Society (APS)
Version
Final published version
Abstract
© 2020 American Physical Society. We present an efficient quantum algorithm for independent-set problems in graph theory, based on non-Abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different types of graphs, with the number of edges proportional to the number of vertices or its square. Our quantum algorithm is compared to the corresponding quantum circuit algorithms and classical algorithms. Non-Abelian adiabatic mixing can be a general technique to aid exploration in a landscape of near-degenerate ground states.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1103/PhysRevA.101.012318