Simulating Sparse Hamiltonians with Star Decompositions

DOI10.1007/978-3-642-18073-6_8zbMath1309.68075arXiv1003.3683OpenAlexW1741741009MaRDI QIDQ3070979

Andrew M. Childs, Robin Kothari

Publication date: 28 January 2011

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (13)

Obtaining a linear combination of the principal components of a matrix on quantum computers ⋮ Context-aware quantum simulation of a matrix stored in quantum memory ⋮ Quantum spin dynamics with pairwise-tunable, long-range interactions ⋮ Efficient quantum circuits for continuous-time quantum walks on composite graphs ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians ⋮ A Quantum Implementation Model for Artificial Neural Networks ⋮ Quantum algorithm design: techniques and applications ⋮ Multiple network alignment on quantum computers ⋮ Product formulas for exponentials of commutators ⋮ A generalized circuit for the Hamiltonian dynamics through the truncated series ⋮ ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS ⋮ Bounding the costs of quantum simulation of many-body physics in real space

This page was built for publication: Simulating Sparse Hamiltonians with Star Decompositions