QuantEM: The quantum error management compiler

• URL: http://arxiv.org/abs/2509.15505v1
• Date: Fri, 19 Sep 2025 01:04:15 GMT
• Title: QuantEM: The quantum error management compiler
• Authors: Ji Liu, Quinn Langfitt, Mingyoung Jessica Jeng, Alvin Gonzales, Noble Agyeman-Bobie, Kaiya Jones Siddharth Vijaymurugan, Daniel Dilley, Zain H. Saleem, Nikos Hardavellas, Kaitlin N. Smith,
• Abstract summary: Quantum error detection (QED) enables improved reliability with significantly lower overhead.<n>Applying QED to arbitrary quantum circuits remains challenging because of the need for manual insertion of detection subcircuits, ancilla allocation, and hardware-specific mapping and scheduling.<n>We present QuantEM, a modular and scalable compiler designed to automate the integration of QED codes into arbitrary quantum programs.
• Score: 6.576503649817851
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: As quantum computing advances toward fault-tolerant architectures, quantum error detection (QED) has emerged as a practical and scalable intermediate strategy in the transition from error mitigation to full error correction. By identifying and discarding faulty runs rather than correcting them, QED enables improved reliability with significantly lower overhead. Applying QED to arbitrary quantum circuits remains challenging, however, because of the need for manual insertion of detection subcircuits, ancilla allocation, and hardware-specific mapping and scheduling. We present QuantEM, a modular and extensible compiler designed to automate the integration of QED codes into arbitrary quantum programs. Our compiler consists of three key modules: (1) program analysis and transformation module to examine quantum programs in a QED-aware context and introduce checks and ancilla qubits, (2) error detection code integration module to map augmented circuits onto specific hardware backends, and (3) postprocessing and resource management for measurement results postprocessing and resource-efficient estimation techniques. The compiler accepts a high-level quantum circuit, a chosen error detection code, and a target hardware topology and then produces an optimized and executable circuit. It can also automatically select an appropriate detection code for the user based on circuit structure and resource estimates. QuantEM currently supports Pauli check sandwiching and Iceberg codes and is designed to support future QED schemes and hardware targets. By automating the complex QED compilation flow, this work reduces developer burden, enables fast code exploration, and ensures consistent and correct application of detection logic across architectures.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Bosonic quantum computing with near-term devices and beyond [0.0]
  This thesis investigates scalable fault-tolerant quantum computation.<n>We develop bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction.
  arXiv  Detail & Related papers  (2025-12-17T04:01:54Z)
• Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads [0.0]
  Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds.<n>Type 1 architectures consist of small quantum nodes connected via Greenberger-e-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements.<n>Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local.<n>Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as lattice gates, lattice surgery, and teleportation.
  arXiv  Detail & Related papers  (2025-11-17T18:14:38Z)
• Compilation-informed probabilistic quantum error cancellation [2.079863206645103]
  We introduce a quantum error mitigation (QEM) scheme against both compilation errors and logical-gate noise that is circuit-, QEC code-, and compiler-agnostic.<n>It features maximal circuit size and QEC code-distance both independent of the target precision, in contrast to strategies based on QEC alone.<n>Our method significantly reduces quantum resource requirements for high-precision estimations, offering a practical route towards fault-tolerant quantum computation with precision-independent overheads.
  arXiv  Detail & Related papers  (2025-08-27T18:00:10Z)
• Measurement-free, scalable and fault-tolerant universal quantum computing [1.2600261666440378]
  We present a complete toolbox for fault-tolerant universal quantum computing without the need for measurements during algorithm execution. We develop new fault-tolerant, measurement-free protocols to transfer encoded information between 2D and 3D color codes. Our measurement-free approach provides a practical and scalable pathway for universal quantum computing on state-of-the-art quantum processors.
  arXiv  Detail & Related papers  (2024-10-17T14:04:14Z)
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes [4.2955091080396075]
  We propose an automated approach for fault-tolerant state preparation circuits for arbitrary CSS codes.<n>We provide a general construction for non-deterministic state preparation circuits beyond distance 3.<n>The resulting methods are publicly available as part of the Munich Quantum Toolkit.
  arXiv  Detail & Related papers  (2024-08-21T18:00:01Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.