Exact gate-sequences for universal quantum computation using the XY-interaction alone

Abstract

In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is non- constructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single qubit operations and encoded two-qubit gates. Here we explicitly give the gate-sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.