Stabilizers for Compiling Logical Circuits under Hardware Constraints

• URL: http://arxiv.org/abs/2604.25042v1
• Date: Mon, 27 Apr 2026 22:48:46 GMT
• Title: Stabilizers for Compiling Logical Circuits under Hardware Constraints
• Abstract summary: To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance and compilation.<n>We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter.<n>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.
• Score: 0.8594140167290097
• License: http://creativecommons.org/licenses/by/4.0/
• 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 the special unitary group. In particular, we describe how to reduce the problem of making a compilation-ideal choice to a least squares problem and provide a closed form solution thereof. Using our framework, it is possible to circumvent inserting costly swaps to adhere to hardware connectivity; instead, we could realize the logical target through a distinct physical Hamiltonian that is natively accessible. We elucidate our approach using the $[[4,2,2]]$ code. We discuss connections to compressed sensing that may pave the way to efficient compilation leveraging physical degrees of freedom.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Operator Learning for efficient Quantum Computation [0.0]
  An efficient implementation of quantum algorithms is often hindered by the lack of efficient primitives for operators and state preparation.<n>We propose a full-stack variational framework that transforms arbitrary operators to compact quantum circuits.<n>The framework is validated for both quantum mechanical and engineering applications.
  arXiv  Detail & Related papers  (2026-06-18T12:58:25Z)
• Learning Logical Operations for Arbitrary Quantum Error Correction Codes [6.03176175302545]
  We present a learning-based framework that constructs physical implementations of logical operations while enforcing structural properties.<n>We then extend it to a co-design procedure, dubbed variational early fault-tolerant quantum computing (VarEFTQC)<n>A software library implements the complete learning pipeline, including loss-function variants, ansatz families, and optimization routines.
  arXiv  Detail & Related papers  (2026-05-27T08:44:55Z)
• Exploiting Movable Logical Qubits for Lattice Surgery Compilation [43.290156259065554]
  We introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate.<n> Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth.<n>An open-source implementation of our method is available on GitHub.
  arXiv  Detail & Related papers  (2025-12-03T19:00:04Z)
• Hardware-tailored logical Clifford circuits for stabilizer codes [1.2116854758481392]
  Quantum error correction is the art of protecting fragile quantum information.<n>It is notoriously difficult to manipulate encoded quantum data without introducing uncorrectable errors.<n>We introduce a mathematical framework for constructing hardware-tailored quantum circuits.
  arXiv  Detail & Related papers  (2025-05-26T17:40:52Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Dependency-Aware Compilation for Surface Code Quantum Architectures [7.543907169342984]
  We study the problem of compiling quantum circuits for quantum computers implementing surface codes.<n>We solve this problem efficiently and near-optimally with a novel algorithm.<n>Our evaluation shows that our approach is powerful and flexible for compiling realistic workloads.
  arXiv  Detail & Related papers  (2023-11-29T19:36:19Z)
• Tangling schedules eases hardware connectivity requirements for quantum error correction [3.0040661953201475]
  We introduce a method of tangled syndrome extraction circuits, which enables measurement of observables between distant qubits. We show how to measure the aforementioned irregular non-local stabilisers, without physically modifying the hardware itself.
  arXiv  Detail & Related papers  (2023-07-19T17:21:50Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.