Generating and optimizing Quantum Circuits with Surface Code Lattice Surgery
Mattias Ehatamm
One of the most promising Quantum Error-Correcting Codes (QECs) is the Surface Code, due to its high fault-tolerance and usability in 2-dimensional nearest-neighbor (2DNN) quantum architecture schemes. The Lattice Surgery technique allows for simplified computation through its splitting and merging of code surfaces. In two dimensions, with the addition of "time", this code gives quantum circuits a natural three-dimensional interpretation, with qubits at grid points and "pipes" between them representing lattice surgery operations. Because this model ignores single-qubit Pauli gates, it translates especially well into the ZX-Calculus, a model of quantum computation as a tensor network.
We present a software tool which significantly simplifies the representation and modification of such circuits for research purposes. It also allows for the optimization of such circuits through a physics-based packing and pathfinding algorithm, which attempts to arrange the necessary pipe junctions equidistantly in 3-d space and generate the least destructive paths. It creates interoperability between Surface Code Lattice Surgery circuits and the ZX-Calculus, which allows for simplification of circuits through ZX rules.
Location
QNC 1201