학술논문

Reducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 2: The 'split-reduc' method and its application to quantum determination of Ramsey numbers
Document Type
Working Paper
Source
Subject
Quantum Physics
05C50, 11A41, 11A51, 11N35, 11N36, 11N80, 11Y05, 65K10, 65P10, 65Y20, 68Q12, 81P68, 81P94, 94A60, 81-08
B.2.4
B.8.2
C.1.3
C.1.m
F.2.1
F.2.3
F.4.1
G.1.0
G.1.3
G.1.5
G.1.6
G.2.0
G.2.1
I.1.2
I.6.4
C.4
E.3
G.0
J.2
K.2
Language
Abstract
Quantum annealing has recently been used to determine the Ramsey numbers R(m,2) for 3 < m < 9 and R(3,3) [Bian et al. (2013) PRL 111, 130505]. This was greatly celebrated as the largest experimental implementation of an adiabatic evolution algorithm to that date. However, in that computation, more than 66% of the qubits used were auxiliary qubits, so the sizes of the Ramsey number Hamiltonians used were tremendously smaller than the full 128-qubit capacity of the device used. The reason these auxiliary qubits were needed was because the best quantum annealing devices at the time (and still now) cannot implement multi-qubit interactions beyond 2-qubit interactions, and they are also limited in their capacity for 2-qubit interactions. We present a method which allows the full qubit capacity of a quantum annealing device to be used, by reducing multi-qubit and 2-qubit interactions. With our method, the device used in the 2013 Ramsey number quantum computation could have determined R(16,2) and R(4,3) with under 10 minutes of runtime.
Comment: Feedback encouraged. 5 pages