Architectural Foundations for Checkpointing and Restoration in Quantum HPC Systems

• URL: http://arxiv.org/abs/2602.09325v1
• Date: Tue, 10 Feb 2026 01:37:58 GMT
• Title: Architectural Foundations for Checkpointing and Restoration in Quantum HPC Systems
• Authors: Qiang Guan, Qinglei Cao, Xiaoyi Lu, Siyuan Niu,
• Abstract summary: Rather than attempting to checkpoint quantum states, our approach redefines checkpointing as a control flow and algorithmic state problem.<n>This design aligns naturally with iterative and staged quantum algorithms such as variational eigensolvers, quantum approximate optimization, and time-stepping methods commonly used in quantum simulation and scientific computing.
• Score: 4.257175682386421
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we explore the design of the checkpointing and restoration for quantum HPC that leverages dynamic circuit technology to enable restartable and resilient quantum execution. Rather than attempting to checkpoint quantum states, our approach redefines checkpointing as a control flow and algorithmic state problem. By exploiting mid-circuit measurements, classical feed forward, and conditional execution supported by dynamic circuits, we capture sufficient program state to allow correct restoration of quantum workflows after interruption or failure. This design aligns naturally with iterative and staged quantum algorithms such as variational eigensolvers, quantum approximate optimization, and time-stepping methods commonly used in quantum simulation and scientific computing.

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)
• Analog Quantum Phase Estimation with Single-Mode Readout [0.46040036610482665]
  Eigenvalue estimation is a central problem for demonstrating quantum advantage.<n>We present an analog quantum phase estimation protocol that extracts the eigenenergies of a target Hamiltonian.<n>Our results provide a resource-efficient and scalable framework for implementing quantum phase estimation in near-term quantum platforms.
  arXiv  Detail & Related papers  (2025-06-18T17:50:42Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey [12.996911561121937]
  Review surveys the latest developments in fault-tolerant quantum computing.<n>Special attention is given to the potential quantum advantages achievable through these algorithms.<n>The review concludes with a discussion of future directions.
  arXiv  Detail & Related papers  (2025-02-04T09:12:00Z)
• RH: An Architecture for Redesigning Quantum Circuits on Quantum Hardware Devices [6.959884576408311]
  We present an architecture that enables the redesign of large-scale quantum circuits on quantum hardware.<n>By prepending a random quantum circuit module to the standard EQ-GAN framework, we extend its capability from quantum state learning to unitary transformation learning.
  arXiv  Detail & Related papers  (2024-12-30T12:05:09Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Advancing Hybrid Quantum-Classical Computation with Real-Time Execution [10.818632836746668]
  We describe a next-generation implementation of classical computation embedded within quantum programs. It enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits.
  arXiv  Detail & Related papers  (2022-06-26T19:50:15Z)
• 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)
• Gradient Ascent Pulse Engineering with Feedback [0.0]
  We introduce feedback-GRAPE, which borrows some concepts from model-free reinforcement learning to incorporate the response to strong measurements. Our method yields interpretable feedback strategies for state preparation and stabilization in the presence of noise.
  arXiv  Detail & Related papers  (2022-03-08T18:46:09Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

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.