Compiling Quantum Algorithms to 2D Nearest Neighbor Architectures

Explore advanced quantum algorithm compilation techniques in this 42-minute conference talk that demonstrates how to adapt quantum algorithms for 2D nearest neighbor quantum computer architectures. Learn about the latest compilation tools and methodologies used to transform arbitrary quantum algorithms into formats suitable for quantum computers with 2D square qubit arrays that only support nearest neighbor interactions. Discover the systematic approach of converting quantum algorithms to Clifford and T gates, optimizing them using ZX graph representations, and implementing the results through lattice surgery techniques. Gain insights into the tqec open source group's philosophy and methodology for quantum algorithm compilation. Examine current open problems in the field and identify potential opportunities for collaborative research in quantum computing architecture optimization.