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...
Main Authors: | S. Marsh, J. B. Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2020-06-01
|
Series: | Physical Review Research |
Online Access: | http://doi.org/10.1103/PhysRevResearch.2.023302 |
Similar Items
-
On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
by: Yizhou Liu, et al.
Published: (2023-06-01) -
Quantum walk-based portfolio optimisation
by: N. Slate, et al.
Published: (2021-07-01) -
Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
by: Mingrui Jiang, et al.
Published: (2023-09-01) -
Efficient quantum walk on a quantum processor
by: Xiaogang Qiang, et al.
Published: (2016-05-01) -
Solving Combinatorial Optimization Problems on Quantum Computers
by: Vyacheslav Korolyov, et al.
Published: (2020-07-01)