Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.01555

Efficient certification of time-reversal symmetry requires entanglement

Zhenhuan Liu, Zhenyu Du, Yifan Tang, Zi-Wen Liu, Jens Eisert, Ingo Roth

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Time-reversal symmetry is a fundamental principle of physics describing the invariance of physical laws under reversal of the direction of time. We formulate a Bell-inequality-like test of this antiunitary symmetry using only forward access and trusted quantum operations: entanglement converts temporal input--output relations into measurable spatial exchange symmetry. For $n$-qubit unitary dynamics, we prove that reliably distinguishing the time-reversal-symmetric circular ensembles from Haar-random dynamics requires $Ω(\min\{2^{n/2},2^{n-e}\})$ queries for any classically adaptive protocol. Here, $e=\min\{e_{\mathrm s},e_{\mathrm m}\}$ with $e_{\mathrm s}$ and $e_{\mathrm m}$ representing the probe and measurement logarithmic entanglement negativities, respectively. Maximally entangled probes and SWAP measurements reduce this cost to a constant number of queries. Furthermore, we develop a time-reversal symmetry test for arbitrary fixed, compatible probes and measurements, relate its query complexity to their logarithmic negativities, and match the lower-bound scaling in the high-entanglement regime by optimizing the probe and measurement. Our results establish a quantitative connection between entanglement and time-reversal symmetry, bridging two central concepts in quantum information science and fundamental physics.

AI Summary

The paper studies how entanglement affects certification of dynamical time-reversal symmetry (TRS), defined relative to a known physical antiunitary $\Xi$ by $\Xi U\Xi^{-1}=U^\dagger$. It assumes forward access to an unknown unitary, trusted preparations and measurements, and only classical memory between queries. For an $n$-qubit unitary sampled once from COE, CSE, or Haar and reused, identifying the ensemble with average success probability at least $2/3$ requires $\Omega(\min\{2^{n/2},2^{n-e}\})$ queries, where $e=\min\{e_{\mathrm s},e_{\mathrm m}\}$ bounds probe and measurement logarithmic negativities. The bound allows mixed probes and arbitrary auxiliary dimensions; PPT probes or PPT measurement effects therefore retain an exponential query requirement. The proof combines learning-tree transcript bounds, ensemble moment spectra, and negativity bounds on single-query distinguishability. Maximally entangled probes encode TRS as exchange symmetry of the unitary’s Choi state. SWAP-type measurements yield constant-query ensemble discrimination and one-sided testing of exact symmetry versus a signature deficit at least $\epsilon$, with optimal $\Theta(\epsilon^{-1}\log(1/\delta))$ query scaling. Optimizing compatible fixed probe–measurement pairs gives matching $\Theta(2^{n-e})$ dimension scaling for $n/2\leq e\leq n$. The signature also measures a normalized squared Frobenius TRS defect; its short-time curvature isolates the TRS-odd Hamiltonian component. The lower bounds concern circular-ensemble promises and the classical-memory model, not unrestricted coherent access. Large negativities alone do not ensure probe–measurement compatibility. Single-time symmetry need not imply Hamiltonian TRS. Noise robustness, open-system extensions, and locality, energy, and control restrictions remain outside the guarantees; the Bell-like interpretation is not device independent.

Little sign of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
40 pages, 2 figures

Related papers

Hypothesis testing of symmetry in quantum dynamics

Yu-Ao Chen, Chenghong Zhu, Keming He +2 more

Symmetry plays a crucial role in quantum physics, dictating the behavior and dynamics of physical systems. In this paper, we develop a hypothesis-testing framework for quantum dynamics symmetry using a limited number of queries to the unknown unitary operation and establish the quantum max-relative entropy lower bound for the type-II error. We construct optimal ancilla-free protocols that achieve optimal type-II error probability for testing time-reversal symmetry ($T$ symmetry) and diagonal symmetry ($Z$ symmetry) with limited queries. Contrasting with the advantages of indefinite causal-order strategies in various quantum information processing tasks, we show that parallel, adaptive, and indefinite causal-order strategies have equal power for our tasks. We establish optimal protocols for $T$ symmetry testing and $Z$ symmetry testing for six and five queries, respectively, from which we infer that the type-II error exhibits a decay rate of $O({m}^{\ensuremath{-}2})$ with respect to the number of queries $m$. This represents a significant improvement over the basic repetition protocols without using global entanglement, where the error decays at a slower rate of $O({m}^{\ensuremath{-}1})$.

arXiv:2411.14292•Physical Review A•May 5, 2025•7 citations

The power of time reversal in Hamiltonian property testing

Richard R. Allen, Matthias C. Caro, Yanlin Chen +2 more

Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision $\varepsilon$ using $O(1/\varepsilon)$ total evolution time. However, in Hamiltonian property testing, the best known algorithms have $O(1/\varepsilon^2)$ total evolution time, unless it is possible to $\textit{reverse}$ the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.

quant-pharXiv:2610.04996•Oct 6, 2026•0 citations

Random quantum circuits with time-reversal symmetry

Kabir Khanna, Abhishek Kumar, Romain Vasseur +1 more

Time-reversal (TR) symmetry is crucial for understanding a wide range of physical phenomena, and plays a key role in constraining fundamental particle interactions and in classifying phases of quantum matter. In this work, we introduce an ensemble of random quantum circuits that are representative of the dynamics of generic TR-invariant many-body quantum systems. We derive a general statistical mechanics model describing entanglement, many-body quantum chaos, and quantum information dynamics in such TR-invariant circuits. As an example of application of our formalism, we study the universal properties of measurement-induced phase transitions in monitored TR-invariant systems, with measurements performed in a TR-invariant basis. We find that TR invariance of the unitary part of the dynamics does not affect the universality class, unless measurement outcomes are postselected to satisfy the global TR invariance of each quantum trajectory. We confirm these predictions numerically and find, for both generic and Clifford-based evolutions, critical exponents in the case of “strong,” i.e., global TR invariance where each quantum trajectory is TR invariant.

arXiv:2501.13161•Physical Review Research•Nov 27, 2025•11 citations

Strong unitary designs in optimal depth and space

Teodor Parella-Dilmé, Júlia Barberà-Rodríguez, Salvatore F. E. Oliviero +1 more

Unitary designs provide finite-moment approximations to Haar-random unitaries, with wide-ranging applications across physics and quantum information, from scrambling and black-hole dynamics to foundational primitives in quantum algorithms. Strong unitary designs capture a more demanding operational notion of approximation, requiring indistinguishability from Haar randomness even for quantum algorithms that may access a unitary not only in the forward direction, but also through its inverse, transpose, and complex conjugate. Motivated by the physical requirement that scrambling arise within the system itself, Schuster, Ma, Lombardi, Brandão, and Huang (arXiv:2509.26310) left open whether strong unitary designs can be generated in logarithmic depth using only the system qubits. For every fixed design order $k$ and measurable-error tolerance, we construct strong approximate unitary $k$-designs in optimal $Θ(\log n)$ all-to-all circuit depth using only the $n$ original system qubits. Our new ingredient is a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble, whose layers pair the qubits uniformly at random and apply independent random two-qubit gates. This bound controls the mixed forward-reverse two-query case, which we combine with existing design and gluing results to obtain strong unitary designs of arbitrary fixed order.

quant-pharXiv:2608.13491•Aug 14, 2026•5 citations

Optimal Quantum Junta Testing without Inverse Queries

Jinge Bao, Minbo Gao, Penghui Yao

We study the query complexity of testing quantum juntas. Given an unknown $n$-qubit unitary or quantum channel, the goal is to decide whether it acts nontrivially on at most $k$ qubits or is $\varepsilon$-far from every such operation. For unitaries, we consider the forward-only model, where the tester has access to $U$, but not to $U^\dagger$ or controlled-$U$. We give tight bounds for both unitary and channel junta testing. For sufficiently large $k$, $n \ge 2k$, and a broad range of $\varepsilon$, both problems have query complexity $Θ\left(k/(\varepsilon^2\log k)\right)$. Our upper bounds are achieved by simple nonadaptive testers using product inputs and single-qubit measurements. For junta channels, this closes the gap by Bao and Yao (COLT 23, TPAMI 2025) between an $\widetilde{O}(k)$ upper bound and a $\widetildeΩ(\sqrt{k})$ lower bound at constant $\varepsilon$, establishing the optimal $Θ(k/\log k)$ query complexity. At the heart of both bounds is a strong connection between quantum junta testing and classical support-size testing. For the upper bounds, we reduce quantum junta testing to a generalized support-size problem for distributions over random subsets, and develop a new tester with improved sample complexity. For the lower bounds, we proceed in the reverse direction, reducing classical support-size testing to quantum junta testing through a phase-masked hard ensemble and showing that forward quantum queries can be exactly classicalized on average. Together, these reductions identify support-size testing as the classical core of quantum junta testing and yield matching lower bounds. At constant $\varepsilon$, they also give a separation between $Θ(k/\log k)$ forward queries and $\widetilde{O}(\sqrt{k})$ queries with inverse access.

quant-pharXiv:2609.37926•Sep 30, 2026•1 citation

Approximation Does Not Help in Quantum Unitary Time-Reversal

Kean Chen, Nengkun Yu, Zhicheng Zhang

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 $ε$ 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., $ε=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 $Ω((1-ε)d^2)$ with explicit dependence on the error $ε$. 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 $ε$ is an average-case distance error.

arXiv:2507.05736•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2026•16 citations
Time-reversal symmetry is a fundamental principle of physics describing the invariance of physical laws under reversal of the direction of time. We formulate a Bell-inequality-like test of this antiunitary symmetry using only forward access and trusted quantum operations: entanglement converts temporal input--output relations into measurable spatial exchange symmetry. For nnn-qubit unitary dynamics, we prove that reliably distinguishing the time-reversal-symmetric circular ensembles from Haar-random dynamics requires Ω(min⁡{2n/2,2n−e})Ω(\min\{2^{n/2},2^{n-e}\})Ω(min{2n/2,2n−e}) queries for any classically adaptive protocol. Here, e=min⁡{es,em}e=\min\{e_{\mathrm s},e_{\mathrm m}\}e=min{es​,em​} with ese_{\mathrm s}es​ and eme_{\mathrm m}em​ representing the probe and measurement logarithmic entanglement negativities, respectively. Maximally entangled probes and SWAP measurements reduce this cost to a constant number of queries. Furthermore, we develop a time-reversal symmetry test for arbitrary fixed, compatible probes and measurements, relate its query complexity to their logarithmic negativities, and match the lower-bound scaling in the high-entanglement regime by optimizing the probe and measurement. Our results establish a quantitative connection between entanglement and time-reversal symmetry, bridging two central concepts in quantum information science and fundamental physics.
The paper studies how entanglement affects certification of dynamical time-reversal symmetry (TRS), defined relative to a known physical antiunitary Ξ\XiΞ by ΞUΞ−1=U†\Xi U\Xi^{-1}=U^\daggerΞUΞ−1=U†. It assumes forward access to an unknown unitary, trusted preparations and measurements, and only classical memory between queries.
For an nnn-qubit unitary sampled once from COE, CSE, or Haar and reused, identifying the ensemble with average success probability at least 2/32/32/3 requires Ω(min⁡{2n/2,2n−e})\Omega(\min\{2^{n/2},2^{n-e}\})Ω(min{2n/2,2n−e}) queries, where e=min⁡{es,em}e=\min\{e_{\mathrm s},e_{\mathrm m}\}e=min{es​,em​} bounds probe and measurement logarithmic negativities. The bound allows mixed probes and arbitrary auxiliary dimensions; PPT probes or PPT measurement effects therefore retain an exponential query requirement. The proof combines learning-tree transcript bounds, ensemble moment spectra, and negativity bounds on single-query distinguishability.
Maximally entangled probes encode TRS as exchange symmetry of the unitary’s Choi state. SWAP-type measurements yield constant-query ensemble discrimination and one-sided testing of exact symmetry versus a signature deficit at least ϵ\epsilonϵ, with optimal Θ(ϵ−1log⁡(1/δ))\Theta(\epsilon^{-1}\log(1/\delta))Θ(ϵ−1log(1/δ)) query scaling. Optimizing compatible fixed probe–measurement pairs gives matching Θ(2n−e)\Theta(2^{n-e})Θ(2n−e) dimension scaling for n/2≤e≤nn/2\leq e\leq nn/2≤e≤n. The signature also measures a normalized squared Frobenius TRS defect; its short-time curvature isolates the TRS-odd Hamiltonian component.
The lower bounds concern circular-ensemble promises and the classical-memory model, not unrestricted coherent access. Large negativities alone do not ensure probe–measurement compatibility. Single-time symmetry need not imply Hamiltonian TRS. Noise robustness, open-system extensions, and locality, energy, and control restrictions remain outside the guarantees; the Bell-like interpretation is not device independent.
Symmetry plays a crucial role in quantum physics, dictating the behavior and dynamics of physical systems. In this paper, we develop a hypothesis-testing framework for quantum dynamics symmetry using a limited number of queries to the unknown unitary operation and establish the quantum max-relative entropy lower bound for the type-II error. We construct optimal ancilla-free protocols that achieve optimal type-II error probability for testing time-reversal symmetry (TTT symmetry) and diagonal symmetry (ZZZ symmetry) with limited queries. Contrasting with the advantages of indefinite causal-order strategies in various quantum information processing tasks, we show that parallel, adaptive, and indefinite causal-order strategies have equal power for our tasks. We establish optimal protocols for TTT symmetry testing and ZZZ symmetry testing for six and five queries, respectively, from which we infer that the type-II error exhibits a decay rate of $O({m}^{\ensuremath{-}2})$ with respect to the number of queries mmm. This represents a significant improvement over the basic repetition protocols without using global entanglement, where the error decays at a slower rate of $O({m}^{\ensuremath{-}1})$.
Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision ε\varepsilonε using O(1/ε)O(1/\varepsilon)O(1/ε) total evolution time. However, in Hamiltonian property testing, the best known algorithms have O(1/ε2)O(1/\varepsilon^2)O(1/ε2) total evolution time, unless it is possible to reverse\textit{reverse}reverse the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.
Time-reversal (TR) symmetry is crucial for understanding a wide range of physical phenomena, and plays a key role in constraining fundamental particle interactions and in classifying phases of quantum matter. In this work, we introduce an ensemble of random quantum circuits that are representative of the dynamics of generic TR-invariant many-body quantum systems. We derive a general statistical mechanics model describing entanglement, many-body quantum chaos, and quantum information dynamics in such TR-invariant circuits. As an example of application of our formalism, we study the universal properties of measurement-induced phase transitions in monitored TR-invariant systems, with measurements performed in a TR-invariant basis. We find that TR invariance of the unitary part of the dynamics does not affect the universality class, unless measurement outcomes are postselected to satisfy the global TR invariance of each quantum trajectory. We confirm these predictions numerically and find, for both generic and Clifford-based evolutions, critical exponents in the case of “strong,” i.e., global TR invariance where each quantum trajectory is TR invariant.
Unitary designs provide finite-moment approximations to Haar-random unitaries, with wide-ranging applications across physics and quantum information, from scrambling and black-hole dynamics to foundational primitives in quantum algorithms. Strong unitary designs capture a more demanding operational notion of approximation, requiring indistinguishability from Haar randomness even for quantum algorithms that may access a unitary not only in the forward direction, but also through its inverse, transpose, and complex conjugate. Motivated by the physical requirement that scrambling arise within the system itself, Schuster, Ma, Lombardi, Brandão, and Huang (arXiv:2509.26310) left open whether strong unitary designs can be generated in logarithmic depth using only the system qubits. For every fixed design order kkk and measurable-error tolerance, we construct strong approximate unitary kkk-designs in optimal Θ(log⁡n)Θ(\log n)Θ(logn) all-to-all circuit depth using only the nnn original system qubits. Our new ingredient is a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble, whose layers pair the qubits uniformly at random and apply independent random two-qubit gates. This bound controls the mixed forward-reverse two-query case, which we combine with existing design and gluing results to obtain strong unitary designs of arbitrary fixed order.
We study the query complexity of testing quantum juntas. Given an unknown nnn-qubit unitary or quantum channel, the goal is to decide whether it acts nontrivially on at most kkk qubits or is ε\varepsilonε-far from every such operation. For unitaries, we consider the forward-only model, where the tester has access to UUU, but not to U†U^\daggerU† or controlled-UUU. We give tight bounds for both unitary and channel junta testing. For sufficiently large kkk, n≥2kn \ge 2kn≥2k, and a broad range of ε\varepsilonε, both problems have query complexity Θ(k/(ε2log⁡k))Θ\left(k/(\varepsilon^2\log k)\right)Θ(k/(ε2logk)). Our upper bounds are achieved by simple nonadaptive testers using product inputs and single-qubit measurements. For junta channels, this closes the gap by Bao and Yao (COLT 23, TPAMI 2025) between an O~(k)\widetilde{O}(k)O(k) upper bound and a Ω~(k)\widetildeΩ(\sqrt{k})Ω(k​) lower bound at constant ε\varepsilonε, establishing the optimal Θ(k/log⁡k)Θ(k/\log k)Θ(k/logk) query complexity. At the heart of both bounds is a strong connection between quantum junta testing and classical support-size testing. For the upper bounds, we reduce quantum junta testing to a generalized support-size problem for distributions over random subsets, and develop a new tester with improved sample complexity. For the lower bounds, we proceed in the reverse direction, reducing classical support-size testing to quantum junta testing through a phase-masked hard ensemble and showing that forward quantum queries can be exactly classicalized on average. Together, these reductions identify support-size testing as the classical core of quantum junta testing and yield matching lower bounds. At constant ε\varepsilonε, they also give a separation between Θ(k/log⁡k)Θ(k/\log k)Θ(k/logk) forward queries and O~(k)\widetilde{O}(\sqrt{k})O(k​) queries with inverse access.
Access to the time-reverse U−1U^{-1}U−1 of an unknown quantum unitary process UUU is widely assumed in quantum learning, metrology, and many-body physics. The fundamental task of unitary time-reversal dictates implementing U−1U^{-1}U−1 to within diamond-norm error εεε using black-box queries to the ddd-dimensional unitary UUU. Although the query complexity of this task has been extensively studied, existing lower bounds either hold only for the exact case (i.e., ε=0ε=0ε=0) or are suboptimal in ddd. 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 Ω((1−ε)d2)Ω((1-ε)d^2)Ω((1−ε)d2) with explicit dependence on the error εεε. 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 εεε is an average-case distance error.