Mapping Binary Functions to a Practical Adiabatic Quantum Computer

Efficiently mapping binary functions to adiabatic quantum computers is an important problem because the resulting circuits can be used as oracles in Grover's algorithm. This paper presents a method for mapping binary functions to a two-dimensional grid of qubits with nearest neighbor interactions which is used in a prototype from D-Wave Systems. This is done by writing the binary function in a special form. This allows the binary function to be implemented by converting each gate into a 3-local Hamiltonian. These 3-local Hamiltonians are then converted into two-local Hamiltonians which are mapped to the grid of qubits.