QASER: Breaking the Depth vs. Accuracy Trade-Off for Quantum Architecture Search

• URL: http://arxiv.org/abs/2511.16272v1
• Date: Thu, 20 Nov 2025 11:53:38 GMT
• Title: QASER: Breaking the Depth vs. Accuracy Trade-Off for Quantum Architecture Search
• Authors: Ioana Moflic, Alexandru Paler, Akash Kundu,
• Abstract summary: Quantum computing faces a key challenge: balancing the need for low circuit depth with the high accuracy required for complex computations.<n>We introduce a novel reinforcement learning approach featuring engineered reward functions, called textbfQASER.<n>We achieve up to 50% improved accuracy, while reducing 2-qubit gate counts and depths by 20%.
• Score: 43.72215866683917
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing faces a key challenge: balancing the need for low circuit depth (crucial for fault tolerance) with the high accuracy required for complex computations like quantum chemistry and error correction, which typically require deeper circuits. We overcome this trade-off by introducing a novel reinforcement learning approach featuring engineered reward functions, called \textbf{QASER}, that take into account seemingly contradictory optimization goals. This reward enables the compilation of circuits with lower depth and higher accuracy, significantly outperforming state-of-the-art techniques. Benchmarks on quantum chemistry state preparation circuits demonstrate stable compilations. We achieve up to 50\% improved accuracy, while reducing 2-qubit gate counts and depths by 20\%. This advancement enables more efficient and reliable quantum compilation.

Related papers

• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Circuit compression for 2D quantum dynamics [6.9629737395580715]
  Quantum algorithms for the dynamics of quantum systems typically require deep quantum circuits.<n>We leverage Pauli propagation techniques to develop a strategy for compressing circuits.<n>Our circuit compression scheme brings us one step closer to a practical quantum advantage.
  arXiv  Detail & Related papers  (2025-07-02T16:52:21Z)
• Approximate Quantum Error Correction with 1D Log-Depth Circuits [0.824969449883056]
  We construct quantum error-correcting codes based on one-dimensional, logarithmic-depth random Clifford encoding circuits with a two-layer circuit structure.<n>We show that the error correction inaccuracy decays exponentially with circuit depth, resulting in negligible errors for these logarithmic-depth circuits.
  arXiv  Detail & Related papers  (2025-03-22T12:54:04Z)
• AI-Powered Algorithm-Centric Quantum Processor Topology Design [10.53761034955718]
  We introduce a novel approach to dynamically tailor qubit topologies to the unique specifications of individual quantum circuits.<n>Our method marks a significant departure from previous methods that have been constrained to mapping circuits onto a fixed processor topology.
  arXiv  Detail & Related papers  (2024-12-18T12:53:16Z)
• 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)
• Efficient and Scalable Architectures for Multi-Level Superconducting Qubit Readout [0.8999666725996978]
  Many processor modalities are inherently multi-level systems. This leads to occasional leakage into energy levels outside the computational subspace.<n>We propose a scalable, high-fidelity three-level readout that reduces FPGA resource usage by $60times$ compared to the baseline.<n>Our design supports efficient, real-time implementation on off-the-shelf FPGAs, delivering a 6.6% improvement in readout accuracy over the baseline.
  arXiv  Detail & Related papers  (2024-05-14T22:32:51Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits [26.130594925642143]
  Quantum noise is the key challenge in Noisy Intermediate-Scale Quantum (NISQ) computers. We propose and experimentally implement QuantumNAS, the first comprehensive framework for noise-adaptive co-search of variational circuit and qubit mapping. For QML tasks, QuantumNAS is the first to demonstrate over 95% 2-class, 85% 4-class, and 32% 10-class classification accuracy on real quantum computers.
  arXiv  Detail & Related papers  (2021-07-22T17:58:13Z)
• 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)
• Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation [3.961270923919885]
  Approximation errors must be taken into account when compiling quantum programs into a low-level gate set. We present a methodology that tracks such errors automatically and then optimize accuracy parameters to guarantee a specified overall accuracy. We develop two prototype implementations, one in C++ based on Clang/LLVM, and another using the Q# compiler infrastructure.
  arXiv  Detail & Related papers  (2020-03-18T18:00:24Z)

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.