Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians
- URL: http://arxiv.org/abs/2511.21867v1
- Date: Wed, 26 Nov 2025 19:48:11 GMT
- Title: Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians
- Authors: Alexey Uvarov, Artur F. Izmaylov,
- Abstract summary: A quantum eigenvalue estimation algorithm was proposed for non-Hermitian Hamiltonians with real spectra.<n>We compare it to the cost of applying standard qubitization to non-transcorrelated Hamiltonians.<n>The ground state energy of the transcorrelated Hamiltonian in the STO-6G basis is more accurate than that of a standard Hamiltonian in the cc-pVQZ basis.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In electronic structure calculations, the transcorrelated method enables a reduction of the basis set size by incorporating the electron-electron correlations directly into the Hamiltonian. However, the transcorrelated Hamiltonian is non-Hermitian, which makes many common quantum algorithms inapplicable. Recently, a quantum eigenvalue estimation algorithm was proposed for non-Hermitian Hamiltonians with real spectra [FOCS 65, 1051 (2024)]. Here we investigate the cost of this algorithm applied to transcorrelated electronic Hamiltonians of second-row atoms and compare it to the cost of applying standard qubitization to non-transcorrelated Hamiltonians. We find that the ground state energy of the transcorrelated Hamiltonian in the STO-6G basis is more accurate than that of a standard Hamiltonian in the cc-pVQZ basis. The T gate counts of the two methods are comparable, while the qubit count of the transcorrelated method is 2.5 times smaller.
Related papers
- Higher order tensor factorizations for block encoding vibrational and vibronic Hamiltonians [0.0]
Fault tolerant quantum simulation via the phase estimation algorithm and qubitization has a T-gate count that scales proportionally to the 1-norm of the Hamiltonian.<n>We introduce the use of tensor factorization methods to reduce the T-gate count of quantum phase estimation.
arXiv Detail & Related papers (2025-04-10T18:43:54Z) - Simultaneously optimizing symmetry shifts and tensor factorizations for cost-efficient Fault-Tolerant Quantum Simulations of electronic Hamiltonians [0.0]
In fault-tolerant quantum computing the cost of calculating Hamiltonian eigenvalues is proportional to the constant scaling of the Hamiltonian matrix block-encoded in a unitary circuit.<n>We present a method to reduce this scaling constant for the electronic Hamiltonians represented as a linear combination of unitaries.
arXiv Detail & Related papers (2024-12-02T10:02:16Z) - Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum.
We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
arXiv Detail & Related papers (2024-10-28T08:43:40Z) - Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another.
We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST.
The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
arXiv Detail & Related papers (2024-05-10T23:46:35Z) - Quantum error mitigation for Fourier moment computation [49.1574468325115]
This paper focuses on the computation of Fourier moments within the context of a nuclear effective field theory on superconducting quantum hardware.
The study integrates echo verification and noise renormalization into Hadamard tests using control reversal gates.
The analysis, conducted using noise models, reveals a significant reduction in noise strength by two orders of magnitude.
arXiv Detail & Related papers (2024-01-23T19:10:24Z) - Quantum Algorithms for Simulating Nuclear Effective Field Theories [38.88664371914129]
We use state-of-the-art Hamiltonian-simulation methods to estimate qubit and gate costs to simulate low-energy effective field theories.<n>We find that the pionless EFT is the least costly to simulate, followed by the one-pion-exchange theory, then the dynamical-pion theory.
arXiv Detail & Related papers (2023-12-08T20:09:28Z) - Orders of magnitude reduction in the computational overhead for quantum
many-body problems on quantum computers via an exact transcorrelated method [0.0]
We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle.
We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm.
Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
arXiv Detail & Related papers (2022-01-09T16:37:32Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Improving the accuracy of quantum computational chemistry using the
transcorrelated method [0.0]
We show that the transcorrelated method can reduce the resources required to obtain accurate energies from electronic structure calculations on quantum computers.
We overcome the limitations introduced by the non-Hermitian Hamiltonian by using quantum algorithms for imaginary time evolution.
arXiv Detail & Related papers (2020-06-19T15:15:07Z) - Quantum simulation of electronic structure with a transcorrelated
Hamiltonian: improved accuracy with a smaller footprint on the quantum
computer [2.640996411999115]
Quantum simulations of electronic structure with a transformed Hamiltonian that includes some electron correlation effects are demonstrated.
A transcorrelated Hamiltonian, paired with extremely compact bases, produces explicitly correlated energies comparable to those from much larger bases.
The use of the very compact transcorrelated Hamiltonian reduces the number of CNOT gates required to achieve cc-pVTZ quality by up to two orders of magnitude, and the number qubits by a factor of three.
arXiv Detail & Related papers (2020-06-03T19:15:32Z)
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.