Experimental evaluation of an adiabiatic quantum system for combinatorial optimization

Authors:
Catherine C. McGeoch;Cong Wang
Affiliations:
Amherst College, Amherst MA;Simon Fraser University, Burnaby BC, CA
Venue:
Proceedings of the ACM International Conference on Computing Frontiers
Year:
2013

Citing 7
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
How Powerful is Adiabatic Quantum Computation?

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

Journal of Heuristics
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

Quantum Information Processing
New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences

New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences
Quantum adiabatic algorithms, small gaps, and different paths

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an experimental study of a novel computing system (algorithm plus platform) that carries out quantum annealing, a type of adiabatic quantum computation, to solve optimization problems. We compare this system to three conventional software solvers, using instances from three NP-hard problem domains. We also describe experiments to learn how performance of the quantum annealing algorithm depends on input.