Riemannian quantum circuit optimization for Hamiltonian simulation

DOI10.1088/1751-8121/AD2D6EMaRDI QIDQ6561801zbMATH OpenFDO

Authors Ayse Kotil, Rahul Banerjee, Qunsheng Huang, Christian B. Mendl

Publication date 25 June 2024

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1088/1751-8121/AD2D6E

zbMATH Keywords

quantum circuit optimizationquantum simulationRiemannian optimizationtrotterization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Nonlinear programming (90C30)

Recommendations

• Practical circuit optimization algorithm for quantum simulation based on template matching
• On the efficiency of quantum algorithms for Hamiltonian simulation
• A generalized circuit for the Hamiltonian dynamics through the truncated series
• Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
• An algebraic quantum circuit compression algorithm for Hamiltonian simulation

Cites work

• A feasible method for optimization with orthogonality constraints
• A Riemannian conjugate gradient method for optimization on the Stiefel manifold
• An algebraic quantum circuit compression algorithm for Hamiltonian simulation
• General theory of fractal path integrals with applications to many-body theories and statistical physics
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• On the Numerical Integration of Ordinary Differential Equations by Symmetric Composition Methods
• Operator growth bounds from graph theory
• Optimal compression of quantum many-body time evolution operators into brickwall circuits
• Practical splitting methods for the adaptive integration of nonlinear evolution equations. I: Construction of optimized schemes and pairs of schemes
• Practical symplectic partitioned Runge-Kutta and Runge-Kutta-Nyström methods
• Projection-like retractions on matrix manifolds
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Simulating quantum systems on a quantum computer
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• The Geometry of Algorithms with Orthogonality Constraints
• Universal Quantum Simulators

Cited in

(3)

• Optimised Trotter decompositions for classical and quantum computing
• Practical circuit optimization algorithm for quantum simulation based on template matching
• Lax dynamics for Cartan decomposition with applications to Hamiltonian simulation

This page was built for publication: Riemannian quantum circuit optimization for Hamiltonian simulation

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