Benchmarking quantum trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo
- URL: http://arxiv.org/abs/2605.02056v2
- Date: Tue, 05 May 2026 14:03:07 GMT
- Title: Benchmarking quantum trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo
- Abstract summary: We present a benchmarking study of quantum trial wavefunctions spanning unitary coupled-cluster, Hamiltonian-informed, Jastrow-inspired, and adaptively constructed ansatze.<n>Our results indicate that the variational energy of an ansatz is not always a reliable indicator of its quality for ph-AFQMC.
- Score: 1.0792803666915127
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) method is a stochastic imaginary-time projection technique for computing ground-state properties of strongly correlated quantum systems, with accuracy that depends critically on the choice of trial wavefunction. Here, we investigate ph-AFQMC with trial states prepared using parameterized quantum circuits. In this work, we present a comprehensive benchmarking study of quantum trial wavefunctions spanning unitary coupled-cluster, Hamiltonian-informed, Jastrow-inspired, and adaptively constructed ansatze. The benchmarking evaluates accuracy, expressibility, and scalability of these ansatze within the QC-AFQMC framework. We test these ansatze on linear hydrogen chains under bond stretching and find that several ansatz families produce chemically accurate ph-AFQMC energies across the dissociation curve. We have performed simulations using the CUDA-Q quantum development platform on the GPU partition of the Perlmutter supercomputer. When comparing ansatze at similar numbers of variational parameters, we find that different ansatz families yield comparable ph-AFQMC results despite exhibiting substantially different variational energies, optimization costs, and circuit depths. Our results indicate that the variational energy of an ansatz is not always a reliable indicator of its quality for ph-AFQMC and reveal instances of over-parameterization. In the strongly correlated regime, trial wavefunctions obtained from adaptive ansatze, exemplified here by ADAPT-VQE with the UCCSD operator pool, can outperform their fixed-ansatz counterparts (UCCSD) in terms of projected energies while using substantially more compact circuits, providing a flexible route to optimize quantum resources within the ph-AFQMC framework.
Related papers
- Beyond Gates: Pulse Level Quantum Fourier Models [1.0482211230201115]
We evaluate quantum Fourier models (QFMs) through the lens of pulse parameters.<n>We show that control over pulse shapes does not significantly alter the global expressibility or structural correlations of the Ansatz.<n>For composite gates, independent pulse scalings replace a single logical angle by multiple independently tunable sub-angles.
arXiv Detail & Related papers (2026-05-06T14:13:44Z) - A unified quantum computing quantum Monte Carlo framework through structured state preparation [0.0]
We extend Quantum Computing Quantum Monte Carlo (QCQMC) beyond ground-state energy estimation.<n>We show that QCQMC can address excited-state spectra via Variational Fast Forwarding and the Variational Unitary Matrix Product Operator (VUMPO)<n> Benchmarks on molecular, condensed-matter, nuclear-structure, and graph-optimization problems demostrate that the QMC diffusion step consistently improves the energy accuracy of the underlying state-preparation method.
arXiv Detail & Related papers (2026-03-26T15:59:54Z) - Spectral Phase Encoding for Quantum Kernel Methods [0.0]
We analyze how quantum feature constructions degrade under controlled additive noise estimation.<n>We introduce Spectral Phase.<n>SPE, a hybrid construc- tion combining a discrete Fourier transform (DFT) front-end with a diagonal phase-only embedding aligned with the geometry of diagonal quantum maps.
arXiv Detail & Related papers (2026-02-23T09:42:42Z) - 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) - Cyclic Variational Quantum Eigensolver: Escaping Barren Plateaus through Staircase Descent [4.517663944296433]
We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation.<n>CVQE departs from conventional VQE by incorporating a measurement-driven feedback cycle.<n>We show that CVQE consistently maintains chemical precision across correlation regimes, outperforms fixed UCCSD by several orders of magnitude, and achieves favorable accuracy-cost trade-offs.
arXiv Detail & Related papers (2025-09-16T13:54:03Z) - Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
arXiv Detail & Related papers (2025-07-09T15:22:17Z) - 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) - HQCC: A Hybrid Quantum-Classical Classifier with Adaptive Structure [7.836610894905161]
We propose a Hybrid Quantum-Classical (HQCC) to advance Quantum Machine Learning (QML)<n>HQCC adaptively optimize the Quantum Circuits (PQCs) through a Long ShortTerm Memory (LSTM) driven dynamic circuit generator.<n>We run simulations on the MNIST and Fashion MNIST datasets, achieving up to 97.12% accuracy.
arXiv Detail & Related papers (2025-04-02T22:49:00Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Quantum circuit architecture search on a superconducting processor [56.04169357427682]
Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry.
However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability.
We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
arXiv Detail & Related papers (2022-01-04T01:53:42Z) - Simulating Many-Body Systems with a Projective Quantum Eigensolver [0.0]
We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster wave functions.
We also introduce a selected variant of PQE (SPQE) that uses an adaptive ansatz built from arbitrary-order particle-hole operators.
arXiv Detail & Related papers (2021-01-31T00:31: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.