Compiling quantum algorithms to 2D nearest neighbor architectures
Austin Fowler
Stairway Invest
In this talk we will describe the latest techniques and compilation tools to compile a quantum algorithm for a quantum computer with a 2D square array of qubits and only nearest neighbor interactions. The focus will be the tqec open source group. The general philosophy is to start with an arbitrary quantum algorithm, convert it to Clifford and T gates, convert this to an optimized ZX graph, then implement this graph using lattice surgery. We will also describe open problems and opportunities for collaboration.
Back to Bridging the Gap Between NISQ and FTQC