Quantum circuit optimization by topological compaction in the surface code
Adam Paetznick, Austin G. Fowler

TL;DR
This paper proposes topological deformation algorithms to optimize quantum circuit implementation in the surface code, reducing resource overhead and computation time on 2D qubit lattices.
Contribution
It introduces two novel algorithms for quantum circuit optimization via topological deformation in the surface code, enhancing efficiency and resource management.
Findings
Algorithms effectively minimize computation time.
Reduction in resource overhead demonstrated.
Applicable to fixed-dimension 2D qubit lattices.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
