Logical Compilation for Multi-Qubit Iceberg Patches
Cordell Mazzetti, Sayam Sethi, Rich Rines, Pranav Gokhale, Jonathan Mark Baker

TL;DR
This paper introduces a novel compiler framework for high-rate quantum error correction codes, optimizing qubit mapping and logical gate compilation to enhance circuit fidelity and reduce depth and gate counts.
Contribution
It presents the first method for mapping and compiling for high-rate quantum codes, combining logical-to-physical translation with a heuristic search for optimal qubit assignments.
Findings
Reduced circuit depth by 34% across benchmarks
Gate counts decreased by up to 31% for one-qubit gates
Improved total variation distance by 1.75 times
Abstract
Recent advancements in quantum computing have enabled practical use of quantum error detecting and correcting codes. However, current architectures and future proposals of quantum computer design suffer from limited qubit counts, necessitating the use of high-rate codes. Such codes, with their code parameters denoted as , have more than logical qubit per code (i.e., ). This leads to reduced error tolerance of the code, since errors on any of the physical qubits can affect the logical state of all logical qubits. Therefore, it becomes critical to optimally map the input qubits of a quantum circuit to these codes, in such a way that the circuit fidelity is maximized. \par However, the problem of mapping program qubits to logical qubits for high-rate codes has not been studied in prior work. A brute force search to find the optimal…
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.
