Benchmarking Quantum Simulation Methods
- URL: http://arxiv.org/abs/2510.01710v1
- Date: Thu, 02 Oct 2025 06:35:57 GMT
- Title: Benchmarking Quantum Simulation Methods
- Abstract summary: Quantum Phase Estimation is a cornerstone algorithm for fault-tolerant quantum computation.<n>We quantify the impact of three key parameters on the overall quantum resource costs for the QPE algorithm.
- Score: 8.088728237481323
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum Phase Estimation (QPE) is a cornerstone algorithm for fault-tolerant quantum computation, especially for electronic structure calculations of chemical systems. To accommodate the diverse characteristics of quantum chemical systems, numerous variants of QPE have been developed, each with distinct qubit and gate cost implications. In this paper, we quantify the impact of three key parameters on the overall quantum resource costs for the QPE algorithm: the choice between trotterization and qubitization, the use of molecular orbitals versus plane-wave basis-sets, and the selection of the fermion-to-qubit encoding scheme. From this, we establish clear performance trade-offs and delineate specific parameter regimes that minimize resource costs for relevant molecular systems. When performing phase estimation on large molecules in the fault-tolerant setting, we found the first-quantized qubitization circuit using the plane-wave basis to be the most efficient, with a gate cost scaling of $\tilde{\mathcal{O}}([N^{4/3}M^{2/3}+N^{8/3}M^{1/3}]/\varepsilon)$ for a system of $N$ electrons and $M$ orbitals, which is the best known scaling to date. On the other hand, when only noisy intermediate-scale or near-term fault-tolerant systems are available, the phase estimation of small molecules can be performed with gate cost of $\mathcal{O}(M^{7}/\varepsilon^{2})$ via trotterization in the MO basis. Furthermore, we provide numerical estimations of qubit and T gate costs required to perform QPE for several real-world molecular systems under these different parameter choices.
Related papers
- An Analytically Trained Variational Surrogate for Quantum Phase Estimation on NISQ Hardware [0.3908906925636173]
Quantum Phase Estimation (QPE) is a foundational algorithm for molecular ground-state energy estimation, but its deep circuit requirements make direct hardware execution impractical on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>We present an analytically grounded variational surrogate framework in which a shallow Variational Quantum Circuit (VQC) is trained to reproduce the QPE measurement distribution without any quantum circuit simulation.
arXiv Detail & Related papers (2026-07-23T05:52:17Z) - Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers [0.005390659954881999]
We introduce an algorithm for estimating the distribution complexity of hybrid quantum-classical simulation for electronic structure Hamiltonians.<n>We show that emergent entanglement patterns are induced by the interplay between coherent Gaussian orbital rotations and disordered Coulomb interactions.<n>The framework introduced here enables novel and more efficient quantum-classical application towards utility-scale quantum computing.
arXiv Detail & Related papers (2026-06-18T18:00:16Z) - Enabling Chemically Accurate Quantum Phase Estimation in the Early Fault-Tolerant Regime [0.0]
Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing.<n>Quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices requires millions of physical qubits.<n>Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime.
arXiv Detail & Related papers (2026-03-24T04:12:25Z) - Symmetry-Adapted State Preparation for Quantum Chemistry on Fault-Tolerant Quantum Computers [0.0]
We present a systematic and resource-efficient construction of continuous symmetry projectors for fault-tolerant quantum computations.<n>For the particle number and $S_z$ symmetries, GQSP offers favorable resource usage features owing to its low ancilla qubit requirements.<n>For the total spin projection, the structured decomposition of $hatP_S,M_S$ reduces the projector T gate count.
arXiv Detail & Related papers (2026-01-13T13:17:59Z) - Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
arXiv Detail & Related papers (2025-11-24T16:36:06Z) - Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Molecular Symmetry in VQE: A Dual Approach for Trapped-Ion Simulations
of Benzene [0.2624902795082451]
Near-term strategies hinge on the use of variational quantum eigensolver (VQE) algorithms combined with a suitable ansatz.
We employ several circuit optimization methods tailored for trapped-ion quantum devices to enhance the feasibility of intricate chemical simulations.
These methods, when applied to a benzene molecule simulation, enabled the construction of an 8-qubit circuit with 69 two-qubit entangling operations.
arXiv Detail & Related papers (2023-08-01T17:03:10Z) - Restricting to the chip architecture maintains the quantum neural network accuracy [0.0]
variational quantum algorithms (VQAs) are a prominent strategy for constructing quantum machine learning models.
This article aims to address several critical questions, such as determining the optimal gate sequence, efficient parameter optimization strategies, and understanding the influence of quantum chip architectures on the final results.
arXiv Detail & Related papers (2022-12-29T18:57:05Z) - PANSATZ: Pulse-based Ansatz for Variational Quantum Algorithms [0.0]
We develop and implement a novel pulse-based ansatz for noisy quantum computers.
We find the ground-state energy associated with the electron configuration problem.
We show that this ansatz has structured adaptivity to the entanglement level required by the problem.
arXiv Detail & Related papers (2022-12-25T14:31:34Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - Error Mitigation-Aided Optimization of Parameterized Quantum Circuits:
Convergence Analysis [42.275148861039895]
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors.
gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias.
Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits.
QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
arXiv Detail & Related papers (2022-09-23T10:48:04Z) - Qubit-efficient encoding scheme for quantum simulations of electronic
structure [5.16230883032882]
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits.
We propose a qubit-efficient encoding scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries.
Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era.
arXiv Detail & Related papers (2021-10-08T13:20:18Z) - 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) - Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates.
We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene.
We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
arXiv Detail & Related papers (2020-04-08T18:00:06Z) - Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum
Computer for Quantum Chemistry [6.361119478712919]
We present a framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system.
We show that resource-requirement savings of up to more than $20%$, in small instances, is possible.
arXiv Detail & Related papers (2020-04-08T17:59:13Z)
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.