Combinatorial optimization via highly efficient quantum walks
S. Marsh, J. B. Wang
Abstract
This paper presents an approach to quantum approximate combinatorial optimization using interleaved continuous-time quantum walks and solution quality-dependent phase shifts. Combinatorial indexing functions are used to implement a quantum walk over the subspace of feasible solutions.
Topics & Concepts
Quantum walkQuantumMathematicsSubspace topologyQuantum computerQuantum algorithmCombinatorial optimizationComputer scienceCombinatorial methodRandom walkOptimization problemDiscrete mathematicsCombinatorial algorithmsTheoretical computer scienceCombinatoricsPhase (matter)Search engine indexingAlgorithmQuantum annealingQuantum phase estimation algorithmQuantum Computing Algorithms and ArchitectureComplexity and Algorithms in GraphsDNA and Biological Computing