Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems

• URL: http://arxiv.org/abs/2606.07666v1
• Date: Thu, 04 Jun 2026 04:30:28 GMT
• Title: Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems
• Abstract summary: We present an integrated hardware-aware compilation and data-driven quantum error-detection framework.<n>We show that joint co-design raises algorithmic success probability by up to 68 percent (95 percent CI: 60 percent to 76 percent) over SABRE on an 8-qubit VQE instance with post-selection.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Noisy intermediate-scale quantum (NISQ) processors are entering an early fault-tolerance regime where full quantum error correction carries prohibitive resource costs, yet lightweight error detection can meaningfully improve algorithmic success rates. Existing compilation and error-detection toolchains treat these concerns in isolation, with no principled way to balance detection overhead against success probability under latency constraints. We present an integrated hardware-aware compilation and data-driven quantum error-detection (QED) framework that jointly optimises qubit mapping, SWAP insertion, and syndrome-schedule placement via a noise-weighted cost function and a learned multi-objective scheduler. Simulation experiments on an HPC cluster using GPU-accelerated density-matrix simulation (NVIDIA cuQuantum SDK) across VQE, phase-estimation, and Grover benchmarks, three noise profiles, and circuit sizes of 6-20 qubits (depths 10-160), show that joint co-design raises algorithmic success probability by up to 68 percent (95 percent CI: 60 percent to 76 percent) over SABRE on an 8-qubit VQE instance with post-selection.

Related papers

• Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations [1.242418204665193]
  Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing.<n>We present a device-matched noise-reduction framework for encoded Hamiltonian simulation.<n>We show that machine-learning-guided stabilizer selection can identify verification operators that outperform random choices.
  arXiv  Detail & Related papers  (2026-05-07T18:00:24Z)
• Ensemble-Based Quantum Signal Processing for Error Mitigation [3.5659159991711618]
  Noise remains a central obstacle to deploying quantum algorithms on near-term devices.<n>In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source.<n>We introduce a noise-resilient framework for Quantum Signal Processing that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements.
  arXiv  Detail & Related papers  (2026-01-27T21:35:06Z)
• Modeling Wavelet Transformed Quantum Support Vector for Network Intrusion Detection [9.036718544324573]
  We present a novel quantum-classical framework integrating an enhanced Quantum Support Vector Machine (QSVM) with the Quantum Haar Wavelet Packet Transform (QWPT)<n>Our methodology employs amplitude-encoded quan-tum state preparation, multi-level QWPT feature extraction, and behavioral analysis via Shannon Entropy profiling and Chi-square testing.<n> Evaluation under noiseless and depolarizing noise conditions demonstrates exceptional performance: 96.67% accuracy on BoT-IoT and 89.67% on IoT-23 datasets, surpassing quantum autoencoder approaches by over 7 percentage points.
  arXiv  Detail & Related papers  (2025-12-01T07:23:20Z)
• Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
  We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
  arXiv  Detail & Related papers  (2025-10-15T19:59:05Z)
• Quantum Error Detection For Early Term Fault-Tolerant Quantum Algorithms [1.9556053645976448]
  We present a framework for fault-tolerant compilation and simulation of quantum algorithms.<n>Finding optimal syndrome schedules improves algorithm success probabilities by an average of 6.7x.<n>We propose a simple data-driven approach to predict fault tolerant compilation parameters.
  arXiv  Detail & Related papers  (2025-03-13T18:34:01Z)
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection [0.0]
  We show that the strategic application of QEC primitives without logical encoding can yield significant advantages on superconducting processors.<n>We present a novel protocol for implementing long-range CNOT gates that relies on a unitarily prepared Greenberger-Horne-Zeilinger (GHZ) state as well as a unitary disentangling step.<n>We generate a 75-qubit GHZ state exhibiting genuine multipartite entanglement, the largest reported to date.
  arXiv  Detail & Related papers  (2024-11-22T00:08:23Z)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)

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.