Quantum circuit optimization by topological compaction in the surface code

Abstract

The fragile nature of quantum information limits our ability to construct large quantities of quantum bits suitable for quantum computing. An important goal, therefore, is to minimize the amount of resources required to implement quantum algorithms, many of which are serial in nature and leave large numbers of qubits idle much of the time unless compression techniques are used. Furthermore, quantum error-correcting codes, which are required to reduce the effects of noise, introduce additional resource overhead. We consider a strategy for quantum circuit optimization based on topological deformation in the surface code, one of the best performing and most practical quantum error-correcting codes. Specifically, we examine the problem of minimizing computation time on a two-dimensional qubit lattice of arbitrary, but fixed dimension, and propose two algorithms for doing so.

26 pages, 14 figures

References in corpus (15)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• Prospects for Spin-Based Quantum Computing
• Magic state distillation with low overhead
• A new quantum ripple-carry addition circuit
• Quantum Circuit Simplification and Level Compaction
• Surface code with decoherence: An analysis of three superconducting architectures
• Two-dimensional cavity grid for scalable quantum computation with superconducting circuits
• Two-Dimensional Arrays of RF Ion Traps with Addressable Interactions
• A bridge to lower overhead quantum computation
• Time-optimal quantum computation
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Global Quantum Circuit Optimization
• Checking the error correction strength of arbitrary surface code logical gates