Recognition: unknown
Optimal Hamiltonian Simulation by Quantum Signal Processing
read the original abstract
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly simulation of physical systems. Surprisingly, this has been challenging, with current Hamiltonian simulation algorithms remaining abstract and often the result of sophisticated but unintuitive constructions. We contend that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation. Specifically, we show that the query complexity of implementing time evolution by a $d$-sparse Hamiltonian $\hat{H}$ for time-interval $t$ with error $\epsilon$ is $\mathcal{O}(td\|\hat{H}\|_{\text{max}}+\frac{\log{(1/\epsilon)}}{\log{\log{(1/\epsilon)}}})$, which matches lower bounds in all parameters. This connection is made through general three-step "quantum signal processing" methodology, comprised of (1) transducing eigenvalues of $\hat{H}$ into a single ancilla qubit, (2) transforming these eigenvalues through an optimal-length sequence of single-qubit rotations, and (3) projecting this ancilla with near unity success probability.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Gauss law codes and vacuum codes from lattice gauge theories
Gauss law codes identify the full gauge-invariant sector as the code space while vacuum codes restrict to the matter vacuum, with the two shown to be unitarily equivalent for finite gauge groups.
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
Monte Carlo-assisted tightening of the energy-based boson truncation bound substantially reduces volume dependence in (1+1)D scalar field theory and (2+1)D U(1) gauge theory.
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
A Monte Carlo-assisted analytic method tightens energy-based bounds on boson truncation errors, substantially reducing the volume dependence of the required cutoff in scalar and gauge theories.
-
Finite-Depth, Finite-Shot Guarantees for Constrained Quantum Optimization via Fej\'er Filtering
CE-QAOA with finite layers achieves dimension-free success probability bounds q0 ≥ x/(1+x) via Fejér filtering under a wrapped phase-separation condition.
-
Unitaria: Quantum Linear Algebra via Block Encodings
Unitaria is a new open-source Python library that provides a high-level, composable interface for block encodings in quantum computing, enabling automatic circuit generation and classical simulation-based verification.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.