Reducing the number of qubits in graph states
Joe Fitzsimons
University of Oxford
Abstract: In this poster we present a method of reducing the total number of physical qubits required to execute a quantum algorithm in the graph state formalism. It is well known that the Clifford part of the algorithm can be removed to yield a smaller `minimal' graph state measurement pattern. We show that using a strategy of replacing subgraphs by suitably chosen graph fragments it is possible to reduce the total number of tilted basis measurements. We present a way to generate the necessary graph fragments, and discuss how this can be used to build an algorithm to optimize arbitrary graph state measurement patterns.