Riemannian quantum circuit optimization for Hamiltonian simulation
DOI10.1088/1751-8121/AD2D6EzbMATH Open1548.81074MaRDI QIDQ6561801FDOQ6561801
Christian B. Mendl, Ayse Kotil, Rahul Banerjee, Qunsheng Huang
Publication date: 25 June 2024
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) 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)
Cites Work
- A feasible method for optimization with orthogonality constraints
- The Geometry of Algorithms with Orthogonality Constraints
- Title not available (Why is that?)
- Universal Quantum Simulators
- Simulating quantum systems on a quantum computer
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- On the Numerical Integration of Ordinary Differential Equations by Symmetric Composition Methods
- Practical symplectic partitioned Runge-Kutta and Runge-Kutta-Nyström methods
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Projection-like retractions on matrix manifolds
- An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
- Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
- Practical splitting methods for the adaptive integration of nonlinear evolution equations. I: Construction of optimized schemes and pairs of schemes
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- Operator growth bounds from graph theory
- Optimal compression of quantum many-body time evolution operators into brickwall circuits
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)
