Guided sampling ansätzes for variational quantum computing

• URL: http://arxiv.org/abs/2508.13926v1
• Date: Tue, 19 Aug 2025 15:21:23 GMT
• Title: Guided sampling ansätzes for variational quantum computing
• Authors: Daniel Gunlycke, John P. T. Stenger, Andrii Maksymov, Ananth Kaushik, Martin Roetteler, C. Stephen Hellberg,
• Abstract summary: We introduce a class of guided sampling ansatzes that depend on the system interactions and measured state samples as well as a parameter space.<n>With only 200 circuit executions per structure on the IonQ Aria quantum computer, our calculations produced total energies around the relaxed structure with errors well below $1.59times10-3$ Ha.
• Score: 1.055551340663609
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum computing is a promising technology because of the ability of quantum computers to process vector spaces with dimensions that increase exponentially with the simulated system size. Extracting the solution, however, is challenging as the number of quantum gate operations and quantum circuit executions must still scale at most polynomially. Consequently, choosing a good ansatz--a polynomial subset of the exponentially many possible solutions--will be critical to maintain accuracy for larger systems. To address this challenge, we introduce a class of guided sampling ans\"atzes (GSAs) that depend on the system interactions and measured state samples as well as a parameter space. We demonstrate a minimal ansatz for the hydronium cation H$_3$O$^+$ and found that with only 200 circuit executions per structure on the IonQ Aria quantum computer, our calculations produced total energies around the relaxed structure with errors well below $1.59\times10^{-3}$ Ha, thus exceeding chemical accuracy.

Related papers

• Simulating high-accuracy nuclear motion Hamiltonians in discrete variable representation using Walsh-Hadamard QROM with fault-tolerant quantum computers [0.0]
  We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers.<n>The quantum volume required for computing the rovibrational spectrum of water can be reduced by up to $105$ times.
  arXiv  Detail & Related papers  (2025-10-21T20:31:12Z)
• Entropy-driven entanglement forging [0.0]
  We show how entropy-driven entanglement forging can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices. Our findings indicate that our method, entropy-driven entanglement forging, can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2024-09-06T16:54:41Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• High-Entanglement Capabilities for Variational Quantum Algorithms: The Poisson Equation Case [0.07366405857677226]
  This research attempts to resolve problems by utilizing the IonQ Aria quantum computer capabilities. We propose a decomposition of the discretized equation matrix (DPEM) based on 2- or 3-qubit entanglement gates and is shown to have $O(1)$ terms with respect to system size. We also introduce the Globally-Entangling Ansatz which reduces the parameter space of the quantum ansatz while maintaining enough expressibility to find the solution.
  arXiv  Detail & Related papers  (2024-06-14T16:16:50Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer [2.562863293556441]
  A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems around the hundred-qubit mark.<n>Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations.<n>Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.
  arXiv  Detail & Related papers  (2024-05-08T14:08:07Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Simulating large-size quantum spin chains on cloud-based superconducting quantum computers [0.46040036610482665]
  We report on cloud simulations performed on several of IBM's superconducting quantum computers. We find that the ground-state energies extracted from realizations reach the expected values to within errors that are small. By using a 102-qubit system, we have been able to successfully apply up to 3186 CNOT gates in a single circuit.
  arXiv  Detail & Related papers  (2022-07-20T15:55:29Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59: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.