Quantum independent-set problem and non-Abelian adiabatic mixing
© 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...
| Principais autores: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
American Physical Society (APS)
2021
|
| Acesso em linha: | https://hdl.handle.net/1721.1/134034 |