Approximation does not help in quantum unitary time-reversal

TL;DR

This paper proves that allowing approximation does not reduce the fundamental query complexity of quantum unitary time-reversal, maintaining its exponential hardness even with constant error.

Contribution

It establishes a tight lower bound on the query complexity for approximate quantum unitary time-reversal, resolving a key open question in quantum information theory.

Findings

Lower bound of ((1-psilon)d^2) on query complexity with error epsilon

Approximation does not reduce the exponential hardness of unitary time-reversal

Bound applies to adaptive, coherent algorithms with unbounded ancillas

Abstract

Access to the time-reverse $U^{-1}$ of an unknown quantum unitary process $U$ is widely assumed in quantum learning, metrology, and many-body physics. The fundamental task of unitary time-reversal dictates implementing $U^{-1}$ to within diamond-norm error $\epsilon$ using black-box queries to the $d$-dimensional unitary $U$. Although the query complexity of this task has been extensively studied, existing lower bounds either hold only for the exact case (i.e., $\epsilon=0$) or are suboptimal in $d$. This raises a central question: does approximation help reduce the query complexity of unitary time-reversal? We settle this question in the negative by establishing a robust and tight lower bound $\Omega((1-\epsilon)d^2)$ with explicit dependence on the error $\epsilon$. This implies that unitary time-reversal retains optimal exponential hardness (in the number of qubits) even when constant error is allowed. Our bound applies to adaptive and coherent algorithms with unbounded ancillas and holds even when $\epsilon$ is an average-case distance error.