Running summarizing tools on a new article

Check the paper below, then start its synthesis.


Black holes as black boxes: a query lower bound on python's lunch decoding

Chris Waddell, Michelle Xu

Abstract: The python's lunch conjecture relates the complexity of bulk reconstruction in holographic tensor networks to an exponential cost associated with post-selection. We establish a tight query lower bound for this decoding problem in a Haar random oracle model, with a python's lunch circuit that applies Haar random unitary $U$ to a logical input and fixed ancillas, followed by post-selection on $m$ output qubits. Given one copy of the normalized encoded state and coherent oracle access to $U$ and $U^\dagger$, including controlled queries, we prove that recovering even a single logical bit with constant average advantage requires $Ω(2^{m/2})$ queries. Together with the state-independent amplitude amplification upper bound for approximately isometric encodings, this establishes query complexity $Θ(2^{m/2})$ at constant decoding accuracy. We also comment on the decoding cost for other "admissible'" ensembles of unitaries $U$ which give rise to families of approximately isometric holographic maps.

Submitted to arXiv on 16 Nov. 2026