Limitations on the simulation of non-sparse Hamiltonians
From MaRDI portal
Publication:3172449
zbMATH Open1234.81133arXiv0908.4398MaRDI QIDQ3172449FDOQ3172449
Authors: Andrew M. Childs, Robin Kothari 
Publication date: 5 October 2011
Full work available at URL: https://arxiv.org/abs/0908.4398
Recommendations
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Simulating Sparse Hamiltonians with Star Decompositions
- Hamiltonian simulation with nearly optimal dependence on spectral norm
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)
Cited In (10)
- Quantum algorithm design: techniques and applications
- Simulating Sparse Hamiltonians with Star Decompositions
- Quantum algorithm for classical multidimensional scaling
- An introduction to quantum computing for statisticians and data scientists
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Quantum-circuit design for efficient simulations of many-body quantum dynamics
- Efficient quantum circuits for Szegedy quantum walks
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Quantum Fourier transform in computational basis
- Divide and conquer approach to quantum Hamiltonian simulation
This page was built for publication: Limitations on the simulation of non-sparse Hamiltonians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172449)
