A generalized circuit for the Hamiltonian dynamics through the truncated series
From MaRDI portal
Publication:1993874
Estimates of eigenvalues in context of PDEs (35P15) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Linear operators in algebras (47C05) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Molecular physics (81V55) Analytic circuit theory (94C05)
Abstract: In this paper, we present a method for the Hamiltonian simulation in the context of eigenvalue estimation problems which improves earlier results dealing with Hamiltonian simulation through the truncated Taylor series. In particular, we present a fixed-quantum circuit design for the simulation of the Hamiltonian dynamics, , through the truncated Taylor series method described by Berry et al. cite{berry2015simulating}. The circuit is general and can be used to simulate any given matrix in the phase estimation algorithm by only changing the angle values of the quantum gates implementing the time variable in the series. The circuit complexity depends on the number of summation terms composing the Hamiltonian and requires number of quantum gates for the simulation of a molecular Hamiltonian. Here, is the number of states of a spin orbital, and is the number of terms in the molecular Hamiltonian and generally bounded by . We also discuss how to use the circuit in adaptive processes and eigenvalue related problems along with a slight modified version of the iterative phase estimation algorithm. In addition, a simple divide and conquer method is presented for mapping a matrix which are not given as sums of unitary matrices into the circuit. The complexity of the circuit is directly related to the structure of the matrix and can be bounded by for a matrix with sparsity.
Recommendations
- A universal quantum circuit scheme for finding complex eigenvalues
- scientific article; zbMATH DE number 6131346
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Simulating quantum dynamics on a quantum computer
- On the efficiency of quantum algorithms for Hamiltonian simulation
Cites work
- An ancilla-based quantum simulation framework for non-unitary matrices
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Exponentially more precise quantum simulation of fermions in second quantization
- Fermionic quantum computation
- Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems
- Householder factorizations of unitary matrices
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 647297 (Why is no real title available?)
- On the Product of Semi-Groups of Operators
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Simulating Sparse Hamiltonians with Star Decompositions
- Structured Eigenvalue Problems
- Using quantum computers for quantum simulation
Cited in
(6)- A universal quantum circuit scheme for finding complex eigenvalues
- Context-aware quantum simulation of a matrix stored in quantum memory
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Space-time circuit-to-Hamiltonian construction and its applications
- Riemannian quantum circuit optimization for Hamiltonian simulation
- Error analysis of quantum operators written as a linear combination of permutations
This page was built for publication: A generalized circuit for the Hamiltonian dynamics through the truncated series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993874)