Tight Bound for Quantum Unitary Time-Reversal
July 08, 2025 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Kean Chen, Nengkun Yu, Zhicheng Zhang
arXiv ID
2507.05736
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT
Citations
4
Venue
arXiv.org
Last Checked
5 months ago
Abstract
Time-reversal of unitary evolution is fundamental in quantum information processing. Many scenarios, particularly those in quantum learning and metrology, assume free access to the time-reverse of an unknown unitary. In this paper, we settle the query complexity of the unitary time-reversal task: approximately implementing $U^{-1}$ given only black-box access to an unknown $d$-dimensional unitary $U$. We provide a tight query lower bound $Ξ©((1-Ξ΅)d^2)$ for the unitary time-reversal to within diamond norm error $Ξ΅$. Notably, our lower bound applies to general coherent protocols with unbounded ancillas, and holds even when $Ξ΅$ is an average-case distance error and access to control-$U$ is available.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted