Aug 2026· 3 citations· ⚡ 1 influential· 36 references
Physics
TL;DR
Numerical experiments confirm the predicted uniform angle accuracy and show low overhead in practice, making them strong candidates for practical amplitude estimation in the early fault-tolerant regime, with applications such as overlap certification, trial-state verification, and Monte Carlo methods.
Abstract
We develop a class of amplitude estimation algorithms with tunable circuit depth $M$ and circuit repetitions $N$, requiring neither ancilla qubits nor controlled Grover operations. For additive error $\epsilon$ in the Grover angle, they attain the nearly optimal query-depth tradeoff $M^2N\in\widetilde{O}(\epsilon^{-2})$ uniformly over $\lambda\in[0,\pi/2]$, spanning the full range from classical sampling at $M=1$ to the Heisenberg limit at $M=\Theta(\epsilon^{-1})$. While prior depth-tunable work establishes comparable angle-accuracy guarantees only away from the boundaries $\lambda\to0$ or $\pi/2$ or at discrete depth tradeoffs, our guarantee extends to both boundaries, so the quantum speedup persists there rather than degrading to classical sampling. Numerical experiments confirm the predicted uniform angle accuracy and show low overhead in practice, making them strong candidates for practical amplitude estimation in the early fault-tolerant regime, with applications such as overlap certification, trial-state verification, and Monte Carlo methods.
The main idea behind the algorithm is a local correlation criterion that identifies gates in the final layer without learning their entire backward light cones, avoiding a bottleneck in the previous approaches.
We achieve the first constant-depth circuit for arbitrary single-qubit gate synthesis. Unlike prior approaches, the construction is fully unitary and requires no pre-supplied catalyst. For any constant $\delta>0$, it $\varepsilon$-approximates an arbitrary single-qubit gate using $O(\log^{1+\delta}(1/\varepsilon))$ cle...
We prove that, for $n\geq3$ parties, the minimum Greenberger-Horne-Zeilinger (GHZ) extractability at normalized Mermin-Ardehali-Belinskii-Klyshko (MABK) score $t\in[0,1]$ is $(1+t)/2$ over all states and binary measurements, allowing arbitrary local dimensions. The extractability $\Xi_n(\rho)$ of a state $\rho$ is the...
Avraham Kreindel, Aryeh Lev Zabokritskiy· 0 citations
Mid-circuit measurements with feedforward reduce the optimal worst-case quantum depth for exact $n$-qubit unitary synthesis from $\Theta(n)$ to $O(1)$, using arbitrary one- and two-qubit gates and unrestricted ancillary space. Measurements and resets without feedforward remain subject to the circuit causal-cone bound....
We construct Clifford+$T$ circuits implementing arbitrary $n$-qubit unitaries with worst-case $T$-count $\widetilde{O}(N^{8/7})$ at constant operator-norm error, where $N=2^n$, improving the previous exponent $5/4$. The construction uses $\widetilde{O}(N^{6/7})$ clean ancillas. The main idea is to reduce the data addre...
Diyi Liu, Shu-Chen Zhu, Wibe A. de Jong et al.· 1 citation
A deterministic classical algorithm that estimates x to additive error $\varepsilon$ in $\mathrm{poly}(n, 1/\varepsilon)$ time improves over prior state-of-the-art algorithms that takes $n^{O(log(n))}$ time for the same task.
Matthew Coudron, M. Gullans, Jon Nelson et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.