Concentration for random product formulas

Abstract

Quantum simulation has wide applications in quantum chemistry and physics. Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation. Among them, a simple and powerful technique, called qDRIFT, is known to generate random product formulas for which the average quantum channel approximates the ideal evolution. qDRIFT achieves a gate count that does not explicitly depend on the number of terms in the Hamiltonian, which contrasts with Suzuki formulas. This work aims to understand the origin of this speed-up by comprehensively analyzing a single realization of the random product formula produced by qDRIFT. The main results prove that a typical realization of the randomized product formula approximates the ideal unitary evolution up to a small diamond-norm error. The gate complexity is already independent of the number of terms in the Hamiltonian, but it depends on the system size and the sum of the interaction strengths in the Hamiltonian. Remarkably, the same random evolution starting from an arbitrary, but fixed, input state yields a much shorter circuit suitable for that input state. In contrast, in deterministic settings, such an improvement usually requires initial state knowledge. The proofs depend on concentration inequalities for vector and matrix martingales, and the framework is applicable to other randomized product formulas. Our bounds are saturated by certain commuting Hamiltonians.

Figures (5)

• Figure 1: A pictorial summary of the main results. (left) To sample a product formula that works for all $n$-qubit input states and observables with high probability, the number of gates is larger than sampling a product formula that works for a fixed, yet arbitrary, input state (center). Resampling fresh product formulas every time (right) produces an average channel that requires even fewer gates; this is the original qDRIFT guarantee campbell2019random.
• Figure 2: Illustration of concentration effects for random walks (and their averages) on the unitary group. The expectation $\mathbb{E}[ V_N \cdots V_1 ]$ of a random product formula is not unitary, but it may be very close to the ideal evolution. A sampled random product formula $V_N \cdots V_1$ is unitary, but its distance from the ideal evolution is about $\mathcal{O}(\sqrt{n t^2 \lambda^2 / N})$. The average of the random product formulas results in an error of $\mathcal{O}\left(t^2 \lambda^2 / N\right)$.
• Figure 3: Numerical experiments for simulating 1D Heisenberg model under different gate count $N$. In All input states (left), we consider $\epsilon = \left\lVert U - V_N \ldots V_1\right\rVert_\infty$, which considers the error over all input states and observables. In Fixed input state (right), we consider $\epsilon = \left\lVert U \ket{\psi} - V_N \ldots V_1 \ket{\psi}\right\rVert_{\ell_2}$, which considers the error over all observables. The input state $\ket{\psi}$ is chosen to be the tensor product of single-qubit Haar-random states. For both All input state and Fixed input state, we give an additional plot showing how the error $\epsilon$ increases as the system size $n$ increases for a fixed number of gates $N = 160$. The $y$-axis is normalized using the average error for system size $n = 4$ over $50$ independent runs. Bounds in Theorem \ref{['thm:allinput']} and \ref{['thm:fixedinput']} show that the relative error $\epsilon_n / \epsilon_{n=4}$ scales as $\sqrt{n / 4}$ for All input state and stays as constant $1$ for Fixed input state, which are shown as the dotted lines. The shaded regions are the standard deviation over $50$ independent runs.
• Figure 4: Illustration of the worst-case input for a product formula simulating evolution of a simple Hamiltonian. The Hamiltonian $H = \frac{1}{n} \sum_{k=1}^n Z_k$ produces a time evolution that factorizes into single qubit unitaries $U$ (left). A product formula with fewer than $n/2$ single-site terms (right) is too small to address all qubits; at least $n/2$ of them must remain untouched. These errors accumulate for a GHZ-state comprised of these untouched qubits. If $n$ is large, even small evolution times ($U = \exp (-\mathrm{i} \tfrac{\pi}{n}Z)$) can accumulate and lead to a maximal approximation error ($\langle \mathrm{GHZ}(+), \mathrm{GHZ}(-) \rangle=0$).
• Figure 5: Illustration of the probabilistic proof for the commuting Hamiltonian given in Equation \ref{['eq:CHZs']}. We consider all the $2^n$ computational basis states as the starting state. The probability for one of the starting state to incur at least an error $\epsilon$ is exponentially smaller than the probability for the maximum of the $2^n$ starting states to incur error $> \epsilon$. However the failure probability is exponential suppressed by increasing the gate count $N$. Hence one only need to set $N = n / \epsilon^2$.

Theorems & Definitions (38)

• Theorem 1: qDRIFT: Gate complexity for small diamond distance
• Corollary 1.1: qDRIFT: Error bound in diamond distance
• Theorem 2: qDRIFT: Gate complexity for fixed input
• Corollary 2.1: qDRIFT: Error bound in trace distance
• Theorem 3: general concentration bounds for products of random unitaries
• Corollary 3.1: concentration of randomly permuted Suzuki-formulas
• Lemma 3.1: Mixing lemma
• Corollary 3.2: Randomized compiling without mixing
• Corollary 3.3
• Lemma 3.2