ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS

DOI10.1142/S0129054103002072MaRDI QIDQ5696943zbMATH OpenFDO

Authors Dominik Janzing, Pawel Wocjan, Thomas Beth

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054103002072

zbMATH Keywords

computational powerinteraction graphsquantum complexitysimulation of Hamiltonians

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity
• Simulating Quantum Computation by Contracting Tensor Networks
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• A method for exact simulation of quantum dynamics
• Simulating quantum dynamics on a quantum computer

Cited in

(1)

• Simulating arbitrary pair-interactions by a given Hamiltonian: graph-theoretical bounds on the time-complexity

This page was built for publication: ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696943)