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

Understand this faster with AI
Quantum Physics arXiv:2611.21723 (quant-ph) [Submitted on 16 Nov 2026] Title:Black holes as black boxes: a query lower bound on python's lunch decoding Authors:Chris Waddell, Michelle Xu View a PDF of the paper titled Black holes as black boxes: a query lower bound on python's lunch decoding, by Chris Waddell and Michelle Xu View PDF HTML (experimental) 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 $\Omega(2^{m/2})$ queries. Together with the state-independent amplitude amplification upper bound for approximately isometric encodings, this establishes query complexity $\Theta(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. Subjects: Quantum Physics (quant-ph); High Energy Physics - Theory (hep-th) Report number: CERN-TH-2026-298 Cite as: arXiv:2611.21723 [quant-ph] (or arXiv:2611.21723v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.21723 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Chris Waddell [view email] [v1] Mon, 16 Nov 2026 19:00:02 UTC (60 KB) Full-text links: Access Paper: View a PDF of the paper titled Black holes as black boxes: a query lower bound on python's lunch decoding, by Chris Waddell and Michelle XuView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-11 Change to browse by: hep-th References & Citations INSPIRE HEP SciXGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
