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

DOI10.1142/S0219749916500271zbMATH Open1375.81072arXiv1503.01755OpenAlexW2341285227WikidataQ114072380 ScholiaQ114072380MaRDI QIDQ5370945FDOQ5370945

Anjani Priyadarsini, Apoorva Patel

Publication date: 20 October 2017

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

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.

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

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
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Universal Quantum Simulators
• Adiabatic quantum state generation and statistical zero knowledge
• Title not available (Why is that?)
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Modern Computer Arithmetic
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
• Title not available (Why is that?)
• Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems
• Simulating Sparse Hamiltonians with Star Decompositions
• The early proofs of the theorem of Campbell, Baker, Hausdorff, and Dynkin
• Higher order decompositions of ordered operator exponentials
• Visualizing quantum scattering on the \(CM-2\) supercomputer
• Title not available (Why is that?)

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)