Divide and conquer approach to quantum Hamiltonian simulation
From MaRDI portal
Publication:6548211
DOI10.1088/1367-2630/aab1efzbMATH Open1543.81079WikidataQ130200478 ScholiaQ130200478MaRDI QIDQ6548211
Stuart Hadfield, Anargyros Papageorgiou
Publication date: 1 June 2024
Published in: New Journal of Physics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Fermionic quantum computation
- 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
- Simulating quantum mechanics on a quantum computer.
- Error bounds for exponential operator splittings
- Simulating fermions on a quantum computer
- Quantum Ising phases and transitions in transverse Ising models
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Simulating Sparse Hamiltonians with Star Decompositions
- Universal Quantum Simulators
- Simulating quantum dynamics on a quantum computer
- Adiabatic quantum state generation and statistical zero knowledge
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Simulating quantum systems on a quantum computer
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- Quantum algorithm and circuit design solving the Poisson equation
- Higher order decompositions of ordered operator exponentials
- Exponentially more precise quantum simulation of fermions in second quantization
This page was built for publication: Divide and conquer approach to quantum Hamiltonian simulation
