Quantum
Black holes as black boxes: a query lower bound on python's lunch decoding
Publication: quant-ph updates on arXiv.org
Author: Chris Waddell, Michelle Xu
Source published: 18/11/2026, 05:00:00 UTC
Briefing created: 18/11/2026, 05:45:01 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 18/11/2026, 05:13:25 UTC.
Briefings
A new study establishes a tight query lower bound for decoding a specific type of holographic tensor network circuit. The research proves that recovering a single logical bit from a normalized encoded state requires at least 2^(m/2) queries, where m is the number of output qubits. This result applies to a Haar random oracle model and defines the complexity class of the 'python's lunch' problem in this context.
Key points
- The study establishes a tight query lower bound of Omega(2^(m/2)) for recovering a single logical bit from a normalized encoded state in a Haar random oracle model.
- The circuit involves a python's lunch component applying a Haar random unitary to a logical input with fixed ancillas, followed by post-selection on m output qubits.
Context
This research addresses the complexity of bulk reconstruction in holographic tensor networks, specifically relating to the python's lunch conjecture. The findings clarify the exponential cost associated with post-selection in these quantum circuits.
Limitations
The proof relies on a Haar random oracle model and assumes constant decoding accuracy. The evidence is preprint status (arXiv:2611.21723v1) and does not include experimental verification or results from other admissible ensembles of unitaries.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 18/11/2026, 05:45:01 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeieodmhnqniybsnhtnf3htazkqkt2ornjejjzuec5ziwrbokoologu