Combinatorial optimization via highly efficient quantum walks
We present a highly efficient quantum circuit for performing continuous time quantum walks (CTQWs) over an exponentially large set of combinatorial objects, provided that the objects can be indexed efficiently. CTQWs form the core mixing operation of a generalized version of the quantum approximate...
| Автори: | , |
|---|---|
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
American Physical Society
2020-06-01
|
| Серія: | Physical Review Research |
| Онлайн доступ: | http://doi.org/10.1103/PhysRevResearch.2.023302 |