analiza aiqbench
This paper establishes optimal query bounds for decoding information from black hole radiation within the Haar random oracle model, resolving fundamental limits on recovery when the remnant is small. By proving that successful decoding requires queries proportional to the Hilbert-space dimension of the remaining system, it advances theoretical quantum complexity and cryptography through applications like EFI pairs and quantum commitments.
Black Hole Radiation Decoding in the Haar Random Oracle Model
arXiv:2610.07124v1 Announce Type: new Abstract: We prove optimal query bounds for recovering a single qubit from black-hole radiation in the Haar random oracle model, when the remaining black hole contains at most one sixteenth of the system's qubits. Recovery with any constant Haar-averaged advantage over trivial decoding requires queries proportional to the Hilbert-space dimension of the remaining black hole. The lower bound is unconditional for decoders chosen independently of the sampled unitary, allows arbitrary computation between queries, and access to $U, U^\dagger, U^*, U^\mathsf T$ along with the controlled variants. An existing decoder using only forward and inverse queries attains a matching bound. The proof uses a path recording oracle to compare real and maximally mixed states. As applications, we obtain an efficiently preparable, statistically far, computationally indistinguishable (EFI) pair and quantum commitments relative to a public Haar oracle, as well as prove a tight linear rank lower bound for Uhlmann transformation on a fixed-target family.
Abstract:We prove optimal query bounds for recovering a single qubit from black-hole radiation in the Haar random oracle model, when the remaining black hole contains at most one sixteenth of the system's qubits. Recovery with any constant Haar-averaged advantage over trivial decoding requires queries proportional to the Hilbert-space dimension of the remaining black hole. The lower bound is unconditional for decoders chosen independently of the sampled unitary, allows arbitrary computation between queries, and access to $U, U^\dagger, U^*, U^\mathsf T$ along with the controlled variants. An existing decoder using only forward and inverse queries attains a matching bound. The proof uses a path recording oracle to compare real and maximally mixed states. As applications, we obtain an efficiently preparable, statistically far, computationally indistinguishable (EFI) pair and quantum commitments relative to a public Haar oracle, as well as prove a tight linear rank lower bound for Uhlmann transformation on a fixed-target family.
Quantum Physics (quant-ph); Computational Complexity (cs.CC); Cryptography and Security (cs.CR)
arXiv:2610.07124 [quant-ph]
(or arXiv:2610.07124v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.07124 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 252 cuvinte
Subiecte conexe
Page transition for the complexity of an evaporating black hole
arXiv · 27 iul. 2026
Free fermionic black holes as polarised mirrors
arXiv · 5 oct. 2026

Non-stabilizerness and violations of CHSH inequalities
Quantum Journal · 21 sept. 2026
On the stabilizer complexity of Hawking radiation
arXiv · 4 aug. 2026