Stabilizers for Compiling Logical Circuits under Hardware Constraints
Jack Weinberg, Narayanan Rengaswamy

TL;DR
This paper presents a novel framework for quantum circuit compilation that leverages error-correcting codes to optimize implementation under hardware constraints, reducing costly operations.
Contribution
It introduces a method to select optimal logical operators via least squares, enabling native realization of targets without extra swaps.
Findings
Framework reduces the need for costly swap operations.
Closed-form solution for optimal logical operator selection.
Application demonstrated on the $[[4,2,2]]$ quantum code.
Abstract
To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we realize an arbitrary quantum algorithm given the basic operations available on the quantum device at hand? We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter. Specifically, we explicitly leverage the fact that error-correcting codes introduce redundancy which renders physically distinct operators logically indistinguishable. In terms of computation, it suffices to implement any operator logically equivalent to some target, yet from a compilation perspective, certain choices may be preferable to others. Our novel contribution is making this intuition precise in the general setting of…
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.
