Divide and conquer approach to quantum Hamiltonian simulation
From MaRDI portal
Publication:6548211
Recommendations
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6131346 (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
- Error bounds for exponential operator splittings
- Exponentially more precise quantum simulation of fermions in second quantization
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- Fermionic quantum computation
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- 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
- Limitations on the simulation of non-sparse Hamiltonians
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Quantum Ising phases and transitions in transverse Ising models
- Quantum algorithm and circuit design solving the Poisson equation
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Simulating Sparse Hamiltonians with Star Decompositions
- Simulating fermions on a quantum computer
- Simulating quantum dynamics on a quantum computer
- Simulating quantum mechanics on a quantum computer.
- Simulating quantum systems on a quantum computer
- Universal Quantum Simulators
This page was built for publication: Divide and conquer approach to quantum Hamiltonian simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548211)
