A simple quantum simulation algorithm with near-optimal precision scaling
Amir Kalev, Itay Hen

TL;DR
This paper introduces a simple quantum simulation algorithm that achieves near-optimal precision scaling, making quantum simulations more feasible on early fault-tolerant quantum hardware.
Contribution
It presents a straightforward quantum Hamiltonian simulation method with near-optimal precision scaling, improving upon complex existing techniques.
Findings
Algorithm is simpler to implement than prior methods.
Achieves near-optimal scaling in simulation precision.
Potentially more practical for early fault-tolerant quantum hardware.
Abstract
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer from suboptimal scaling with respect to simulation precision, existing simulation techniques are, for the most part, too intricate to implement on early fault-tolerant quantum hardware. We propose a quantum Hamiltonian dynamics simulation algorithm that aims to be both straightforward to implement and, at the same time, have near-optimal scaling in simulation precision.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
