A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series
arXiv:1801.09720 · doi:10.1007/s11128-018-2099-z
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.
arXiv commentMATLAB source code for the circuits can be downloaded from https://github.com/adaskin/circuitforTaylorseries
References in corpus (24)
- Quantum algorithm for solving linear systems of equations
- Random Matrix Theories in Quantum Physics: Common Concepts
- Quantum algorithms: an overview
- Fermionic quantum computation
- General framework for estimating the ultimate precision limit in noisy quantum-enhanced metrology
- Towards Quantum Chemistry on a Quantum Computer
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Efficient quantum algorithms for simulating sparse Hamiltonians
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Quantum autoencoders for efficient compression of quantum data
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Quantum Circuits for General Multiqubit Gates
- Simulating Physical Phenomena by Quantum Networks
- Simulating chemistry using quantum computers
- Gate count estimates for performing quantum chemistry on small quantum computers
- Asymptotically Optimal Quantum Circuits for d-level Systems
- Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
- Using Quantum Computers for Quantum Simulation
- Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
- Simulating sparse Hamiltonians with star decompositions
- Universal Programmable Quantum Circuit Schemes to Emulate an Operator
- An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices
- Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians
Cited by in corpus (4)
- Quantum computing methods for electronic states of the water molecule
- Does the full configuration interaction method based on quantum phase estimation with Trotter decomposition satisfy the size consistency condition?
- Context aware quantum simulation of a matrix stored in quantum memory
- Error analysis of quantum operators written as a linear combination of permutations