Limitations on the simulation of non-sparse Hamiltonians

MaRDI QIDQ3172449zbMATH OpenFDO

Authors Andrew M. Childs, Robin Kothari

Publication date 5 October 2011

Full work available at URL https://arxiv.org/abs/0908.4398

zbMATH Keywords

Hamiltonian simulationlower bounds

Mathematics Subject Classification ID

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)

Recommendations

• Efficient quantum algorithms for simulating sparse Hamiltonians
• Simulating Sparse Hamiltonians with Star Decompositions
• Hamiltonian simulation with nearly optimal dependence on spectral norm

Cited in

(11)

• Quantum algorithm design: techniques and applications
• Efficient quantum circuits for Szegedy quantum walks
• Quantum Fourier transform in computational basis
• Efficient quantum circuits for continuous-time quantum walks on composite graphs
• Simulating Sparse Hamiltonians with Star Decompositions
• Hamiltonian sparsification and gap-simulation
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Divide and conquer approach to quantum Hamiltonian simulation
• Quantum algorithm for classical multidimensional scaling
• An introduction to quantum computing for statisticians and data scientists
• Quantum lower bounds by sample-to-query lifting

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)