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.
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{2n/2,2n−e}) queries for any classically adaptive protocol. Here, e=min{es,em} with es and 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.
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})$.
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 ε-far from every such operation. For unitaries, we consider the forward-only model, where the tester has access to U, but not to U† or controlled-U. We give tight bounds for both unitary and channel junta testing. For sufficiently large k, n≥2k, and a broad range of ε, both problems have query complexity Θ(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) upper bound and a Ω(k) lower bound at constant ε, establishing the optimal Θ(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 ε, they also give a separation between Θ(k/logk) forward queries and O(k) queries with inverse access.
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.
Recently, a technique known as quantum symmetry test has gained increasing attention for detecting bipartite entanglement in pure quantum states. In this work we show that, beyond qualitative detection, a family of well-defined measures of bipartite and multipartite entanglement can be obtained with symmetry tests. We propose and benchmark several efficient methods to estimate these measures, and derive near-optimal sampling strategies for each. Despite the nonlinearity of the methods, we demonstrate that the sampling error scales no worse than O(Ntot−1/2) with the total number of copies Ntot, which suggests experimental feasibility. By exploiting symmetries we compute our measures for large number of copies, and derive the asymptotic decay exponents for relevant states in many-body systems. Using these results we identify tradeoffs between estimation complexity and sensitivity of the presented entanglement measures, oriented to practical implementations.
How many uses of an optical device are needed to certify that it preserves quantum information? This article determines the optimal asymptotic number of coherent-light probes under an average photon budget. Matching upper and lower bounds show that a single optical mode carries an unavoidable logarithmic cost, while every fixed higher mode number follows a different power law. Certification task and resource accounting. The device is an arbitrary normal, memoryless bosonic quantum channel. The task distinguishes the identity from channels at least ε away in the energy-constrained diamond norm, defined using the full trace norm and a signal-energy budget Es. This guarantee includes inputs entangled with an unrestricted reference system. The physical probes are fresh coherent states with classically chosen amplitudes. Adaptive choices, retained quantum outputs and a final joint measurement are allowed. Every device call, including a vacuum pulse, is counted, and the actual illumination obeys ∑t=1TEK∥αt∥2≤TEp under every channel in the testing promise. The probe budget Ep is distinct from the signal budget Es defining the certification guarantee. Optimal mean-energy query laws. For fixed positive Es,Ep, fixed finite mode number m, and both testing errors at most δ, the minimax number of calls satisfies Tmean(1)(ε,δ)=ΘEs,Ep(ε−4logε1logδ1),Tmean(m)(ε,δ)=Θm,Es,Ep(ε−(2m+2)logδ1),m≥2. The bounds hold for sufficiently small ε, uniformly over 0<δ≤1/4. Independent probes drawn from a physical positive multiscale source, followed by individual binary target tests, attain these orders. The matching converse covers adaptive coherent-probe protocols with quantum output memory. Thus those additional processing capabilities do not improve the asymptotic order within the stated preparation model. The result specifies matching scaling laws, rather than exact finite-query counts or optimal numerical constants. Why one mode has an extra logarithm. Rare high-photon coherences can strongly affect an energy-bounded quantum input while leaving only a weak signature on coherent probes. The proof retains this interference through a positive coherent-frame Green kernel. Its spectral sum grows as tlogt for one mode and as tm for fixed m≥2. A complementary family of physical channels shows that the single-mode logarithm is necessary, rather than an artifact of the reconstruction bound. What source brightness changes. The optimal mean-only laws contrast with prescribed independent Gaussian modulation, for which logTG=Θ(ε−2) at fixed confidence. A fixed brightness cap gives logTcap=Θ(ε−2log(1/ε)). The article also establishes matching logarithmic orders under stretched-exponential brightness constraints and develops the conversion from average coherent-probe error to thermal Choi-state and energy-constrained worst-input guarantees. These are worst-case certification limits for the specified coherent-probe access model. The channel class retains infinite photon tails and imposes no output-energy bound. This updated, integrated 37-page article contains the main results, two figure groups, complete proofs and references.
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 Θ(logn) 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.