Physics Informed Generative Machine Learning for Accelerated Quantum-centric Supercomputing

• URL: http://arxiv.org/abs/2512.06858v1
• Date: Sun, 07 Dec 2025 14:27:12 GMT
• Title: Physics Informed Generative Machine Learning for Accelerated Quantum-centric Supercomputing
• Authors: Chayan Patra, Dibyendu Mondal, Sonaldeep Halder, Dipanjali Halder, Mostafizur Rahaman Laskar, Richa Goel, Rahul Maitra,
• Abstract summary: PIGen-SQD is an efficiently designed quantum supercomputing (QCSC) workflow that utilizes the capability of generative machine learning (ML)<n> PIGen-SQD advances the robustness and scalability of QCSC algorithms, offering a promising pathway toward chemically reliable quantum simulations on utility-scale quantum hardware.
• Score: 0.46906883107634084
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum centric supercomputing (QCSC) framework, such as sample-based quantum diagonalization (SQD) holds immense promise toward achieving practical quantum utility to solve challenging problems. QCSC leverages quantum computers to perform the classically intractable task of sampling the dominant fermionic configurations from the Hilbert space that have substantial support to a target state, followed by Hamiltonian diagonalization on a classical processor. However, noisy quantum hardware produces erroneous samples upon measurements, making robust and efficient configuration-recovery strategies essential for a scalable QCSC pipeline. Toward this, in this work, we introduce PIGen-SQD, an efficiently designed QCSC workflow that utilizes the capability of generative machine learning (ML) along with physics-informed configuration screening via implicit low-rank tensor decompositions for accurate fermionic state reconstruction. The physics-informed pruning is based on a class of efficient perturbative measures that, in conjunction with hardware samples, provide a substantial overlap with the target state. This distribution induces an anchoring effect on the generative ML models to stochastically explore only the dominant sector of the Hilbert space for effective identification of additional important configurations in a self-consistent manner. Our numerical experiments performed on IBM Heron R2 quantum processors demonstrate this synergistic workflow produces compact, high-fidelity subspaces that substantially reduce diagonalization cost while maintaining chemical accuracy under strong electronic correlations. By embedding classical many body intuitions directly into the generative ML model, PIGen-SQD advances the robustness and scalability of QCSC algorithms, offering a promising pathway toward chemically reliable quantum simulations on utility-scale quantum hardware.

Related papers

• Designing quantum technologies with a quantum computer [1.4951795042951048]
  We develop a quantum-computer-aided framework for simulating devices using a general electron spin resonance Hamiltonian.<n>Within this model, we combine Gray-encoded qudit-to-qubit mappings, qubit-wise commuting aggregation, and a multi-reference selected quantum Krylov fast-forwarding algorithm.<n> Numerical simulations demonstrate the computation of autocorrelation functions up to $sim100$ ns, together with microwave absorption spectra.<n>We benchmark the framework against classical simulations and identify the reference-state selection in sQKFF as the primary factor governing accuracy at fixed hardware cost.
  arXiv  Detail & Related papers  (2026-01-29T18:26:54Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• TensorHyper-VQC: A Tensor-Train-Guided Hypernetwork for Robust and Scalable Variational Quantum Computing [50.95799256262098]
  We introduceHyper-VQC, a novel tensor-train (TT)-guided hypernetwork framework for quantum machine learning.<n>Our framework delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.<n>These results positionHyper-VQC as a scalable and noise-resilient framework for advancing practical quantum machine learning on near-term devices.
  arXiv  Detail & Related papers  (2025-08-01T23:37:55Z)
• Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors [64.50565018996328]
  We introduce the concept of predictive surrogates, designed to emulate the mean-value behavior of a given quantum processor with provably computational efficiency.<n>We use these surrogates to emulate a quantum processor with up to 20 programmable superconducting qubits, enabling efficient pre-training of variational quantum eigensolvers.<n> Experimental results reveal that the predictive surrogates not only reduce measurement overhead by orders of magnitude, but can also surpass the performance of conventional, quantum-resource-intensive approaches.
  arXiv  Detail & Related papers  (2025-07-23T12:51:03Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Truncated Variational Hamiltonian Ansatz: efficient quantum circuit design for quantum chemistry and material science [0.0]
  This paper introduces the truncated Variational Hamiltonian Ansatz (tVHA), a novel circuit design for conducting quantum calculations on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>Our proposed ansatz significantly reduces the parameter count and can decrease circuit size substantially, with a trade-off in accuracy.<n>While this paper concentrates on the practical applications of tVHA in quantum chemistry, its underlying principles suggest a wider applicability extending to the broader field of material science computations on quantum computing platforms.
  arXiv  Detail & Related papers  (2025-05-26T09:54:46Z)
• Training Hybrid Deep Quantum Neural Network for Efficient Reinforcement Learning [3.753031740069576]
  Quantum circuits embed data in a Hilbert space whose dimensionality grows exponentially with the number of qubits.<n>We introduce qtDNN, a tangential surrogate that locally approximates a quantum circuit.<n>We design hDQNN-TD3, a hybrid deep quantum neural network for continuous-control reinforcement learning.
  arXiv  Detail & Related papers  (2025-03-12T07:12:02Z)
• Calculating the energy profile of an enzymatic reaction on a quantum computer [0.0]
  Quantum computing provides a promising avenue toward enabling quantum chemistry calculations.<n>Recent research efforts are dedicated to developing and scaling algorithms for Noisy Intermediate-Scale Quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2024-08-20T18:00:01Z)
• Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers [0.0]
  We develop a projective formalism that aims to compute ground-state energies of molecular systems accurately using Noisy Intermediate Scale Quantum (NISQ) hardware. We demonstrate the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems.
  arXiv  Detail & Related papers  (2024-03-13T13:27:40Z)
• GQHAN: A Grover-inspired Quantum Hard Attention Network [53.96779043113156]
  Grover-inspired Quantum Hard Attention Mechanism (GQHAM) is proposed. GQHAN adeptly surmounts the non-differentiability hurdle, surpassing the efficacy of extant quantum soft self-attention mechanisms. The proposal of GQHAN lays the foundation for future quantum computers to process large-scale data, and promotes the development of quantum computer vision.
  arXiv  Detail & Related papers  (2024-01-25T11:11:16Z)
• 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)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Towards a NISQ Algorithm to Simulate Hermitian Matrix Exponentiation [0.0]
  A practical fault-tolerant quantum computer is worth looking forward to as it provides applications that outperform their known classical counterparts. It would take decades to make it happen, exploiting the power of noisy intermediate-scale quantum(NISQ) devices, which already exist, is becoming one of current goals. In this article, a method is reported as simulating a hermitian matrix exponentiation using parametrized quantum circuit.
  arXiv  Detail & Related papers  (2021-05-28T06:37:12Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.