Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians

DOI10.1142/S0219749916500271MaRDI QIDQ5370945zbMATH OpenOpenAlexWikidataFDO

Authors Apoorva Patel, Anjani Priyadarsini

Publication date 20 October 2017

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.01755

zbMATH Keywords

Chebyshev polynomialsGrover's algorithmprojection operatorHamiltonian evolutionLie-Trotter formuladigital representationreflection operatorsBaker-Campbell-Hausdorff expansion

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Matrix exponential and similar functions of matrices (15A16) Applications of Lie (super)algebras to physics, etc. (17B81) Best approximation, Chebyshev systems (41A50) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)

Abstract: Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points and different series expansions. A choice among these possibilities can then be made to obtain the best computational complexity and control over errors. It is shown how a construction based on Grover's algorithm scales linearly in time and logarithmically in the error bound, and is exponentially superior in error complexity to the scheme based on the straightforward application of the Lie-Trotter formula. The strategy is then extended first to simulation of any Hamiltonian that is a linear combination of two projection operators, and then to any local efficiently computable Hamiltonian. The key feature is to construct an evolution in terms of the largest possible steps instead of taking small time steps. Reflection operations and Chebyshev expansions are used to efficiently control the total error on the overall evolution, without worrying about discretisation errors for individual steps. We also use a digital implementation of quantum states that makes linear algebra operations rather simple to perform.

Recommendations

• scientific article; zbMATH DE number 6131346
• On the efficiency of quantum algorithms for Hamiltonian simulation
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Quantum algorithms for Hamiltonian simulation

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Adiabatic quantum state generation and statistical zero knowledge
• Black-box Hamiltonian simulation and unitary implementation
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems
• Higher order decompositions of ordered operator exponentials
• Mathematical methods for physicists. A comprehensive guide
• Modern computer arithmetic
• Simulating Sparse Hamiltonians with Star Decompositions
• The early proofs of the theorem of Campbell, Baker, Hausdorff, and Dynkin
• Universal Quantum Simulators
• Visualizing quantum scattering on the \(CM-2\) supercomputer

Cited in

(1)

• Riemannian quantum circuit optimization for Hamiltonian simulation

This page was built for publication: Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370945)