Higher order tensor factorizations for block encoding vibrational and vibronic Hamiltonians
- URL: http://arxiv.org/abs/2504.08065v1
- Date: Thu, 10 Apr 2025 18:43:54 GMT
- Title: Higher order tensor factorizations for block encoding vibrational and vibronic Hamiltonians
- Authors: Hirsh Kamakari, Emil Zak,
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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, the cost of block encoding the Hamiltonian, and inversely proportionally to the desired accuracy. Tensor factorization methods have been successfully used to reduce T-gate counts in the ground state electronic structure problem. Here we introduce the use of tensor factorization methods to reduce the T-gate count of quantum phase estimation. In particular, we show how Canonical Polyadic and Tucker decompositions of the tensors representing the vibrational and vibronic Hamiltonians can be utilized to rewrite the Hamiltonian in terms of linear combination of bosonic position operators representing nuclear vibrations. We demonstrate the use of these factorization methods on the water and monodeutered methane molecules.
Related papers
- Fast quantum simulation of electronic structure by spectrum amplification [0.020255670159345252]
We develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes.<n>We show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable.
arXiv Detail & Related papers (2025-02-21T19:01:12Z) - 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) - Perturbative Framework for Engineering Arbitrary Floquet Hamiltonian [0.0]
We develop a systematic perturbative framework to engineer an arbitrary target Hamiltonian in the Floquet phase space.<n>The high-order errors in the engineered Floquet Hamiltonian are mitigated by adding high-order driving potentials perturbatively.
arXiv Detail & Related papers (2024-10-14T12:58:55Z) - Assessing the query complexity limits of quantum phase estimation using symmetry aware spectral bounds [0.0]
computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian.
We introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms.
arXiv Detail & Related papers (2024-03-07T18:38:49Z) - Block-Invariant Symmetry Shift: Preprocessing technique for
second-quantized Hamiltonians to improve their decompositions to Linear
Combination of Unitaries [0.0]
We propose a preprocessing procedure that reduces the norm of the Hamiltonian without changing its eigenspectrum for the target states of a particular symmetry.
The new procedure, Block-Invariant Symmetry Shift (BLISS), builds an operator T such that the cost of implementing H-T is reduced compared to that of H, yet H-T acts on the subspaces of interest the same way as H does.
arXiv Detail & Related papers (2023-04-26T18:33:46Z) - 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) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - 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) - Rotating Majorana Zero Modes in a disk geometry [75.34254292381189]
We study the manipulation of Majorana zero modes in a thin disk made from a $p$-wave superconductor.
We analyze the second-order topological corner modes that arise when an in-plane magnetic field is applied.
We show that oscillations persist even in the adiabatic phase because of a frequency independent coupling between zero modes and excited states.
arXiv Detail & Related papers (2021-09-08T11:18:50Z) - 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) - Operator-algebraic renormalization and wavelets [62.997667081978825]
We construct the continuum free field as the scaling limit of Hamiltonian lattice systems using wavelet theory.
A renormalization group step is determined by the scaling equation identifying lattice observables with the continuum field smeared by compactly supported wavelets.
arXiv Detail & Related papers (2020-02-04T18:04:51Z)
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.