Determining Ramsey numbers on a quantum computer
Abstract
We present a quantum algorithm for computing the Ramsey numbers whose computational complexity grows superexponentially with the number of vertices of a graph on a classical computer. The problem is mapped to a decision problem on a quantum computer, and a probe qubit is coupled to a register that represents the problem and detects the energy levels of the problem Hamiltonian. The decision problem is solved by detecting the decay dynamics of the probe qubit.
 Publication:

Physical Review A
 Pub Date:
 March 2016
 DOI:
 10.1103/PhysRevA.93.032301
 arXiv:
 arXiv:1510.01884
 Bibcode:
 2016PhRvA..93c2301W
 Keywords:

 Quantum Physics
 EPrint:
 10 pages, 3 figures