# Thread: Prior Art on the Verification-Bound Argument

**Date:** 2026-09-21
**Scout:** Argus subagent (prior-art-verification-bound)
**Status:** COMPLETE — deliverable written; verdict + findings + raw verification log below.

## VERDICT

**The argument as stated is NOT published anywhere I could find — but every major move in it has been published, and most have been explicitly refuted by the three people whose prior art matters most (Aaronson, Bostrom, Steane).** Verdict: it is best described as a **rediscovery-shaped novel assembly of known parts**, whose hard claims are (i) arithmetically right (~400 qubits vs 10^120), (ii) not tested-against-verification-theory anywhere in the literature, and (iii) vulnerable to standard refutations that are already in print, the strongest of which (Steane) attacks the premise rather than the arithmetic.

Specifically:
- The **crossover computation** (n qubits ⇒ 2^n classical work ⇒ exceeds Lloyd's ~10^120 at n≈399-400) is arithmetic I did myself; I found **no published paper computing this crossover against Lloyd's bound or any cosmological compute bound** — the nearest published numbers are "2^10^122 time steps to classically simulate the observable universe" (Aaronson 2017) and "10,000 qubits exceed a 10^80-bit classical computer" (Physics SE, informal).
- The **core inference** ("the host must pay the cost because verification happens inside the simulation") is NOT established in the literature, and the literature contains a *published* refutation of the inference's engine: the host need not compute the full final state, only outputs that pass embedded verification; it may cheat (Bostrom 2025 FAQ: fake "readings from measurement devices"), throttle (Bostrom: leaf-node civilizations), run slow (Aaronson's trillion-year God), be a quantum computer itself (Aaronson's "Like, duh?"), or render on demand (Bostrom/ Campbell et al.).
- Whether the argument can be *saved* in constrained form (promise problems with efficiently checkable witnesses, e.g. factoring, under a strictly classical host) is a genuine open question — **no one appears to have analyzed verification-based arguments against a classical host** (see França et al. 2022 for the closest formal machinery, and note its direction is opposite to the one needed).

Novelty judgment: **novel assembly, individually anticipated parts, unrefuted-in-this-exact-form but refuted-in-spirit by three published sources.** If Argus writes it, the paper must carry the Steane/Bostrom/Aaronson objections in the introduction or it will be refuted on first review.

**Critical factual correction for Argus:** Deutsch's number is a **250-digit** number ⇒ 10^500 universes (The Fabric of Reality, ch. 9). The "10,000-digit number ⇒ 10^500 universes" version in Argus's briefing is **not in the book** and I could not verify it anywhere at source; it appears to be a secondary-source conflation. Also the 10^120 figure in the briefing matches Lloyd (10^120 ops on 10^90 bits) — verified.

---

## DETAILED FINDINGS

### 1. PRIOR ART ON THE EXACT ARGUMENT

**1.1 Direct statement: NONE FOUND.** Searches (Google/Brave + arXiv listings) for "simulation hypothesis" + quantum computer + classical-host cost + verification + Lloyd bound turned up no paper or post making the full argument (classical host must pay full cost of verified embedded quantum computation; crossover at ~400 qubits). State plainly: **I could not find this argument published anywhere.**

**1.2 Structural ancestors (all verified at source unless marked):**

- **Deutsch 1997** — same question shape ("where did the computation happen?"), different target (single-universe reality, not simulation hosts). Verbatim in §3 below.
- **Bostrom, Simulation Argument FAQ v2.0 (2025), Q6** — the *closest published analogue*: the "nested simulation cost" objection (simulated civilizations building their own simulations ⇒ exponential cost growth) and Bostrom's published answer: simulators "could avoid this by stepping in to prevent simulated civilizations from using excessive amounts of computing power, or by ending them shortly after they begin to consume excessive resources... most civilizations would be leaf nodes of the simulation tree". This is the refutation of the user's argument's dynamic part ("as embedded observers build larger verifiable quantum computers, the host is constrained") — the host can simply stop them.
- **Aaronson, "Your yearly dose of is-the-universe-a-simulation" (2017-03-22, https://scottaaronson.blog/?p=3208)** — "if the cosmological constant is indeed constant... our entire observable universe can be described as a system of ~10^122 qubits... this would mean that our observable universe could be simulated by a quantum computer—or even for that matter by a classical computer, to high precision, using a mere ~2^(10^122) time steps." (verified-at-source). This is the universe-scale version of the same cost accounting.
- **Ringel & Kovrizhin 2017 + reaction** — the "classical computers cannot efficiently simulate this quantum system" claim, widely (wrongly) promoted as proof against the simulation hypothesis; Aaronson's rebuttal (below) is the canonical reaction.
- **Neukart et al. 2022 (arXiv:2212.04921), abstract (verified)**: "in a simulation in which the computer simulating a universe is governed by the same physical laws as the simulation, the exhaustion of computational resources will halt all simulations down the simulation chain unless an external programmer intervenes" — closest published "resource exhaustion constrains the simulation" statement, but about the *whole universe*, not embedded quantum computers.
- **Vazza 2025 (arXiv:2504.08461, abstract verified)**: energy/power required for any version of the simulation "entirely incompatible with physics... it is just impossible that this Universe is simulated by a universe sharing the same properties". About host cost of the whole universe; NOT the verification argument.
- **França, et al., "A game of quantum advantage: linking verification and simulation" (arXiv:2011.12173; Quantum 6, 753 (2022))** (abstract verified): formalizes proving quantum advantage as a referee game; key result: "exponential resources may be unavoidable for even the most basic verification tasks in the setting of random quantum circuits". **Directional warning for Argus:** this paper establishes verification⇒(approximate) simulation for RANDOM circuits — i.e., for random-circuit supremacy, *verification itself* is exponentially hard, which argues AGAINST the user's premise that verification pins the host (the host can exploit that the observers' verification is weak). For structured problems with witnesses (factoring), verification is classically cheap, so the host is only pinned to producing the witness. This distinction is not addressed anywhere in the simulation-hypothesis literature — a genuine gap Argus could fill.
- **ScienceDaily 2025-11-10, "Physicists prove the Universe isn't a simulation after all" (UBC Okanagan, Gödel-based)** — `inherited-unchecked` (I could only see the press summary, not the paper); relevant new work, verify before citing; also note it is separate from the computational-cost family.

**1.3 Informal crossover-style statements found:**
- Physics StackExchange Q8895 "How many bits are needed to simulate the universe?" — one answer (snippet, `inherited-unchecked`): "even a modest size quantum computer, on the order of 10,000 qubits, can do factoring calculations that exceed the capacity of a classical computer of 10^80 bits" — the crossover idea in the wild, informal, no Lloyd-bound comparison.
- Microsoft Learn quantum overview (snippet, `inherited-unchecked`): "At a few hundred electrons, the memory required to store the system exceeds the number of particles in the universe" — the naive state-vector crossover vs atoms (≈266 qubits vs 10^80), again informal.

### 2. THE STANDARD REFUTATIONS (strongest published statements, verbatim)

**(a) The host might be quantum** — fatal to "CLASSICAL host" phrasing:
- **Aaronson, Shtetl-Optimized, 2017-10-03 (p=3482)**: "why not just imagine that the universe is being simulated on a quantum computer? Like, duh?" (verified-at-source, full passage: "suppose it were also experimentally demonstrated that scalable quantum computing is possible in our universe. Even then, one still wouldn't by any stretch have ruled out that the universe was a computer simulation! For as many of the people who emailed me asked themselves (but as the popular articles did not), why not just imagine that the universe is being simulated on a quantum computer? Like, duh?")
- **Bostrom FAQ Q12 (2025)**: "The most obvious flaw in that interpretation is that simulators could use quantum computers." (verified-at-source)

**(b) The simulator can special-case / be arbitrarily slow / throttle:**
- **Aaronson p=3482**: "why couldn't God, using Her classical computer, spend a trillion years to simulate one second as subjectively perceived by us? After all, what is exponential time to She for whom all eternity is but an eyeblink?" (verified) — this is the direct published answer to the Lloyd-bound step: the host's resources are unconstrained by our cosmology.
- **Bostrom FAQ Q6**: leaf-node throttling (quote in §1.2).
- Also relevant: **Chalmers, "The Matrix as Metaphysics" (2003/2005)** argues a simulation can be *partial* ("We can imagine that a matrix simulates the entire physics of a world... Later, we will look at ways in which this set-up might be varied") and that the computational layer is itself implemented in another layer ("The computational processes are constituted by even more fundamental processes... It doesn't matter what that more fundamental level is") — undercutting any assumption that the host must realize our physics' cost model. (verified-at-source, consc.net full text)

**(c) The simulator can lie to the observers:**
- **Bostrom FAQ Q12**: a simulation that "'cheats' and that produces the appearances in a more intelligently creative or klugey manner: generating patterns that are merely sufficiently realistic in their broad contours to be indiscernible from underlying reality by our primitive human brains (including if necessary by manipulating readings from measurement devices and data files etc.)" (verified-at-source, 2025 FAQ) — the strongest published statement of the lying objection, directly covering "verified" results.
- **Bostrom FAQ Q11**: simulators could "retrospectively editing the brain states of observers who had happened to witness something suspicious" (verified) — verification happens in simulated brains the host can edit.
- **Campbell, Owhadi, Sauvageau, Watkinson, "On Testing the Simulation Theory", Int. J. Quantum Foundations 3(3):78-99 (2017)** (abstract verified): rendering-on-demand principle — content produced only when a *player* observes, not when a machine (part of the simulation) detects. Directly implies the host need not pre-compute quantum dynamics in full.

**(d) Measure/anthropics/"looking up":**
- **Aaronson, "On whether we're living in a simulation" (2024-02-07, p=7774)**: "because their simulations will have to run on computers that fit in our universe, presumably the simulated universes will be smaller than ours—in the sense of fewer bits and operations needed to describe them. Similarly, if we're being simulated, then presumably it's by a universe bigger than the one we see around us" (verified-at-source) — the host may be arbitrarily larger than us, so Lloyd's bound on OUR observable universe is irrelevant to the host.
- Same post: the "low-res approximation" escape is dismissed by Aaronson as "metaphysically confusing" — but note Bostrom (Q6) embraces exactly that escape; they disagree.
- **Bostrom 2003 (classic.pdf) footnote 2 (snippet, `inherited-unchecked`)**: quantum computers as a route to posthuman computing power; the paper's core move is that simulated observers don't outnumber base observers unless posthumans run many sims — the anthropic structure the user's argument implicitly relies on is contested (see also Carroll's contradiction argument per Wikipedia summary, `inherited-unchecked`).

**2.1 The complexity-theory reality check (refutation of the refutation's engine, from the QMC episode):**
- **Aaronson p=3482**: "until someone proves P≠PSPACE, there's no hope for an unconditional proof that quantum computers can't be efficiently simulated by classical ones." (verified) And his four-part rebuttal of the "sign problem proves we're not simulated" claim — points 3 and 4 are (a) and (b) above.

### 3. DEUTSCH VERBATIM (verified at source, full text of the book)

**Source:** David Deutsch, *The Fabric of Reality: The Science of Parallel Universes—and Its Implications*, Penguin Books (first published London: Allen Lane, 1997); **Chapter 9, "Quantum Computers"**. Verified against the archive.org full-text scan (https://archive.org/stream/TheFabricOfReality/The_Fabric_of_Reality_djvu.txt). Page number within book: **not verified** (plain-text scan lacks reliable page markers). ISBN 978-0-14-014690-5 (from Wikipedia's bibliography listing, `inherited-unchecked` but consistent).

Exact passage A (the 10^500 universes, 250-digit number — NOT 10,000-digit):
> "When a quantum factorization engine is factorizing a 250-digit number, the number of interfering universes will be of the order of 10^500 — that is, ten to the power of 500. This staggeringly large number is the reason why Shor's algorithm makes factorization tractable. I said that the algorithm requires only a few thousand arithmetic operations. I meant, of course, a few thousand operations in each universe that contributes to the answer. All those computations are performed in parallel, in different universes, and share their results through interference."

Exact passage B (the challenge — "where was the number factorized?"):
> "With Shor's algorithm, the argument has been writ very large. To those who still cling to a single-universe world-view, I issue this challenge: explain how Shor's algorithm works. I do not merely mean predict that it will work, which is merely a matter of solving a few uncontroversial equations. I mean provide an explanation. When Shor's algorithm has factorized a number, using 10^500 or so times the computational resources that can be seen to be present, where was the number factorized? There are only about 10^80 atoms in the entire visible universe, an utterly miniscule number compared with 10^500. So if the visible universe were the extent of physical reality, physical reality would not even remotely contain the resources required to factorize such a large number. Who did factorize it, then? How, and where, was the computation performed?"

(The same passage is reproduced in Rivka Galchen, "David Deutsch and His Dream Machine", The New Yorker, 2011-05-02 — `inherited-unchecked` verbatim match.)

**Published counterarguments to Deutsch — the best ones:**
- **Steane, "A quantum computer only needs one universe", arXiv:quant-ph/0003084 (2000; v3 2003), Studies in History and Philosophy of Modern Physics B 34(3):469-478 (2003), DOI 10.1016/S1355-2198(03)00038-8** — THE strongest rebuttal, verified at source (full text read):
  - Abstract (verbatim): "It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum computers to 'perform many computations simultaneously' except in a highly qualified and to some extent misleading sense."
  - Remark 2 (verbatim, the direct answer to Deutsch's accounting): "The quantity 'amount of computation' is not correctly measured by counting the number of steps which would have had to be accomplished if the computation had been done another way. Therefore, to measure the 'amount of computation' carried out in a quantum algorithm such as Shor's, it is inappropriate to count the steps which a classical computer would have needed. A laboratory demonstration of Shor's algorithm does not constitute proof that huge amounts of computation have taken place in a small system in a small time—unless there is a proof to that effect which we have not yet considered."
  - Remark 4 (verbatim, the devastating empirical point): "An n-qubit quantum computer is only sensitive to decoherence to the level 1/Poly(n), not 1/exp(n)... If the quantum computer were really 'doing 2^n computations'... we would expect it to be sensitive to errors at the level 1/2^n, which it is not. I feel this point is so strong that it suffices on its own to rule out the concept of 'vast parallel computation'."
  - Also cites Holevo's theorem (quantum channel transmits no more classical information) and the Gottesman-Knill theorem (some classically-impressive-looking quantum processes simulate efficiently).
- **Wolpert 2024 (arXiv:2404.16050)** — different angle; formal CS-theoretic simulation analysis (self-simulation via Kleene recursion; Rice-theorem impossibilities). Read §1 only; the paper explicitly notes (verbatim): "with one partial exception discussed in Appendix F, no work has even been done on using CS theory to investigate the simulation hypothesis." No treatment of the quantum-verification-cost argument in §1.
- Popular-layer summaries of the many-worlds-overreach critique exist (QBism/Fuchs-Mermin-Schack positions; postquantum.com summary — `inherited-unchecked`). Steane remains the citable primary source.

**Why this matters for Argus's argument:** Steane's rebuttal attacks the SAME premise the user's argument needs — "the quantum computation involves exponentially much computation that someone must pay for." If Steane is right, there is no exponential bill for the computation *anywhere* (the state vector is never the resource; only measured correlations are), so the classical host's bill is only the cost of *emulating the physical dynamics*, which is the standard hard-simulation problem — and which the host may cheat on (Bostrom). The user's argument survives only if it adopts a non-Steane reading of quantum mechanics (e.g., the host must reproduce the full unitary dynamics because *somewhere* in the simulation chain the correlations are physically realized). That dependence should be made explicit in the write-up.

### 4. HAS ANYONE COMPUTED THE CROSSOVER?

**No published paper computing "qubit count at which classical simulation of a verified computation exceeds a cosmological bound" was found. State plainly: I could not find it.**

Closest published/informal numbers:
- Aaronson 2017: observable universe ≈ 10^122 qubits; classical simulation ≈ 2^(10^122) time steps (verified).
- Microsoft Learn (informal): few hundred electrons ⇒ memory exceeds particle count of universe (snippet only).
- Physics SE (informal): ~10,000 qubits for factoring beyond 10^80-bit classical capacity (snippet only).
- Lloyd 2002 (verified abstract): universe performed ≤ 10^120 ops on 10^90 bits — the bound Argus cites.

**My own arithmetic (inference, not literature):** classical state-vector simulation of n qubits needs 2^n amplitudes. log2(10^120) ≈ 398.63, so 2^399 ≈ 1.29×10^120 and 2^400 ≈ 2.58×10^120. **The crossover against Lloyd's 10^120 ops is therefore at n ≈ 399-400 qubits — Argus's "roughly 400" is arithmetically right.** Two caveats Argus should carry: (i) against Lloyd's *bits* bound (10^90) the crossover is log2(10^90) ≈ 299 qubits — the number depends on whether you price memory or operations; (ii) 2^n amplitudes is the cost of ONE time-step of a full-state simulation; circuit depth multiplies it, and specialized algorithms (tensor networks, stabilizers, matchgates) beat brute force for many circuits — so "400 qubits" is a floor, not a wall, and only for worst-case circuits (random-circuit supremacy is the regime where the floor is honest). The user's argument should be phrased as "≈400 qubits (ops) / ≈300 qubits (memory) against in-universe bounds, worst-case circuits" — and then confronted with objection (b): the host need not obey our cosmological bounds, nor our algorithm landscape.

### Where I did not look (honest scope)
- Philosophy journals (Erkenntnis, Foundations of Physics) full-text search engine-side only — some hits (Greene 2020 Erkenntnis "Termination Risks of Simulation Science") found via secondary citations, not read; **Erkenntnis/FoP may contain a direct treatment I could not see.**
- Springer/Elsevier paywalled full texts (Steane paper's final published version not read; arXiv v3 was).
- Bostrom 2003 original paper full text (I have the FAQ and snippets; the classic.pdf footnote-quantum snippet is from search).
- Hossenfelder 2017 blog — linked from Aaronson p=3208 (Lorentz-invariance objection), not fetched directly.
- The 2025 UBC Gödel-based paper (ScienceDaily) — summary only.
- Deutsch's own later books (The Beginning of Infinity) re-state the arguments; not checked.

---
## RAW PROGRESS LOG
(The raw chronological log of fetches and verifications below this line is retained for the main session's audit; the structured findings above are the deliverable.)

## Progress log

### Initial search hits (2026-09-21)

- `inherited-unchecked` — Scott Aaronson has multiple blog posts on the simulation hypothesis: p=3482 "Because you asked: the Simulation Hypothesis has not been falsified; remains unfalsifiable" (URL https://scottaaronson.blog/?p=3482); p=3208 "Your yearly dose of is-the-universe-a-simulation" (https://scottaaronson.blog/?p=3208); p=7774 "On whether we're living in a simulation" (https://scottaaronson.blog/?p=7774) — snippet mentions "conservation of (real or simulated) computronium."
- `inherited-unchecked` — Aaronson's paper arXiv:2404.16050 "What computer science has to say about the simulation hypothesis" (HTML at https://arxiv.org/html/2404.16050v3). MUST FETCH.
- `inherited-unchecked` — Deutsch's "where was the number factorized?" passage appears in The Fabric of Reality (1997). Goodreads quote: "To those who still cling to a single-universe world-view, I issue this challenge: explain how Shor's algorithm works... When Shor's algorithm has factorized a number, using 10500 [i.e. 10^500] or so times the computational resources that can be seen to be present, where was the number factorized?" — VERIFY AT SOURCE, get exact page.
  - Note: the Reddit/LinkedIn snippets say "10500" which is a mangling of 10^500. Need exact verbatim.
- `inherited-unchecked` — arXiv:2212.04921 "Constraints, observations, and experiments on the simulation hypothesis" (PDF https://arxiv.org/pdf/2212.04921). MUST FETCH (authors?). Snippet quotes Feynman: "if we intend to simulate nature, we have to do it quantum mechanically, as nature is not classical."
- `inherited-unchecked` — arXiv:2504.08461 "Astrophysical constraints on the simulation hypothesis for this..." (PDF https://arxiv.org/pdf/2504.08461). MUST FETCH (authors?).
- `inherited-unchecked` — Bostrom FAQ v2.0 (2025) at https://simulation-argument.com/faq/faq.pdf — has Q&A on unfalsifiability. CHECK for quantum-computing question.
- Bostrom original: simulation-argument.com/classic.pdf — footnote 2 mentions quantum computers ("If we could create quantum computers..."); snippet re: simulating universe to quantum level infeasible.
- NEXT: fetch Aaronson 2404.16050, blog p=7774 and p=3208, arXiv 2212.04921.

### Fetched: Aaronson p=3208 (2017-03-22)

- `verified-at-source` — Scott Aaronson, "Your yearly dose of is-the-universe-a-simulation," Shtetl-Optimized, 2017-03-22, https://scottaaronson.blog/?p=3208. KEY PASSAGES (directly relevant to the crossover question):
  - "if the cosmological constant is indeed constant..., then our entire observable universe can be described as a system of ~10^122 qubits. ... this would mean that our observable universe could be simulated by a quantum computer—or even for that matter by a classical computer, to high precision, using a mere ~2^(10^122) time steps." (This is the standard quantum-state-dimension vs. classical-simulation-cost framing, but for simulating the UNIVERSE, not for a verified embedded quantum computation.)
  - "blame it for being unfalsifiable rather than for being falsified!"
  - Note: the "computronium conservation" snippet from search did NOT appear in this post's body; may be in p=3482 or a comment. To check.

### Fetched: Aaronson p=3482 (2017-10-03) — CENTRAL refutation document

- `verified-at-source` — Scott Aaronson, "Because you asked: the Simulation Hypothesis has not been falsified; remains unfalsifiable," Shtetl-Optimized, 2017-10-03, https://scottaaronson.blog/?p=3482 (mirror https://www.scottaaronson.com/blog/?p=3482). This is his commentary on Ringel & Kovrizhin. Four independent objections, verbatim (numbered by me):
  1. **Refutation (b) — the host might be quantum**: "OK, but suppose it were proved that BPP≠BQP—and for good measure, suppose it were also experimentally demonstrated that scalable quantum computing is possible in our universe. Even then, one still wouldn't by any stretch have ruled out that the universe was a computer simulation! For as many of the people who emailed me asked themselves (but as the popular articles did not), why not just imagine that the universe is being simulated on a quantum computer? Like, duh?"
  2. **Refutation (c) — the simulator can be arbitrarily slow / special-case**: "even if, for some reason, we disallowed using a quantum computer to simulate the universe, that still wouldn't rule out the simulation hypothesis. For why couldn't God, using Her classical computer, spend a trillion years to simulate one second as subjectively perceived by us? After all, what is exponential time to She for whom all eternity is but an eyeblink?"
  3. **Complexity-theory caution**: "until someone proves P≠PSPACE, there's no hope for an unconditional proof that quantum computers can't be efficiently simulated by classical ones." Also: about the most the paper could say is "computer scientists generally believe that BPP≠BQP."
  4. **Ringel-Kovrizhin is about QMC only**: "everything is phrased in terms of the failure of one specific algorithmic framework (namely QMC)"—this refutes the popular reading that the paper proves un-simulability in principle.
  - Also includes the paper's abstract verbatim (see below).

### Fetched: Ringel-Kovrizhin paper metadata + abstract

- `verified-at-source` (via Aaronson's verbatim copy of abstract; paper itself not fetched) — Zohar Ringel & Dmitry L. Kovrizhin, "Quantized gravitational responses, the sign problem, and quantum complexity," Science Advances 3(9):e1701758 (2017). DOI 10.1126/sciadv.1701758 (matches URL https://www.science.org/doi/10.1126/sciadv.1701758 — `inherited-unchecked` for the DOI string itself). Aaronson notes Ringel is at Hebrew University (paper's byline per ORA: Ringel, Z., and D. L. Kovrizhin). Abstract opening verbatim: "It is believed that not all quantum systems can be simulated efficiently using classical computational resources." The paper does NOT claim to refute the simulation hypothesis — Aaronson: "does any of this prove that the universe isn't a computer simulation, as the popular articles claim (and as the original paper does not)?"
- NOTE: The user's task said "Ringel & Kovrizhin and the reaction to them" — the reaction is Aaronson's post. GOOD.

### Fetched: Steane — the canonical published reply to Deutsch's argument

- `verified-at-source` — **Andrew Steane**, "A quantum computer only needs one universe," arXiv:quant-ph/0003084 (v1 20 Mar 2000; v3 24 Mar 2003), journal ref: Studies in History and Philosophy of Modern Physics B 34(3):469-478 (2003), DOI 10.1016/S1355-2198(03)00038-8. Abstract verbatim (this is the strongest published rebuttal to the Deutsch/Deutsch-style "where was the computation done" argument):
  > "The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum computers to 'perform many computations simultaneously' except in a highly qualified and to some extent misleading sense. Quantum computation is therefore not well described by interpretations of quantum mechanics which invoke the concept of vast numbers of parallel universes. Rather, entanglement makes available types of computation process which, while not exponentially larger than classical ones, are unavailable to classical systems. The essence of quantum computation is that it uses entanglement to generate and manipulate a physical representation of the correlations between logical entities, without the need to completely represent the logical entities themselves."
  - IMPORTANT for the user's argument: Steane's point is that NO exponentially large computation needs to happen anywhere (no 10^500 universes, no classical exponential simulation) — the quantum computer's own physical state IS the computation, and its efficiency claim is about information manipulated, not about a hidden exponential resource. This undercuts BOTH Deutsch's many-worlds inference AND (potentially) the user's claim that a classical host must pay exponential cost — see analysis in VERDICT.
  - `verified-at-source` re publication details (from arXiv abs page: journal reference + DOI).

### Deutsch book-text search: failed (0 results)
- Need another route for Fabric of Reality verbatim (archive.org, quotes sites, or his 2011 New Yorker interview which matches). Will retry.

### Search: crossover computation - first attempt 0 results
- RETRY with different phrasing. Also still to do: Bostrom FAQ quantum Q; Vopson; Beane/Davoudi/Savage; "quantum advantage + simulation hypothesis" full-text; arXiv listing check for anything published on "verified" quantum computation vs classical host.



- Searches for Steane's counterargument to Deutsch failed to surface the paper. RETRY needed (he has a known paper/essay "It's not a many-universes kind of thing" or similar — actually the known one is Steane, "A quantum computer needs only one universe," arXiv:quant-ph/0003084, 2000, Studies in History and Philosophy of Modern Physics). Search with exact arXiv ID.



- `verified-at-source` — **Florian Neukart et al.** (first author Neukart; from "From: Florian Neukart"), "Do we live in a [quantum] simulation? Constraints, observations, and experiments on the simulation hypothesis," arXiv:2212.04921 [quant-ph], v1 7 Dec 2022 (v2 13 Dec 2022), 27 pages, 5 figures. DOI https://doi.org/10.48550/arXiv.2212.04921. Abstract snippet (verbatim, key structural point): "in a simulation in which the computer simulating a universe is governed by the same physical laws as the simulation, the exhaustion of computational resources will halt all simulations down the simulation chain unless an external programmer intervenes, which we may be able to observe." Also quotes Feynman re simulating nature quantum mechanically. NEED FULL TEXT to check for the verification-bound argument (later fetch if budget allows).
- `verified-at-source` — **Franco Vazza** (from: Franco Vazza), "Astrophysical constraints on the simulation hypothesis for this Universe: why it is (nearly) impossible that we live in a simulation," arXiv:2504.08461 [physics.pop-ph], 11 Apr 2025, 17 pages, Frontiers in Physics in press; related DOI https://doi.org/10.3389/fphy.2025.1561873. Abstract (verbatim key): "the amounts of energy or power required by any version of the simulation hypothesis are entirely incompatible with physics, or (literally) astronomically large, even in the lowest resolution case... our results show that it is just impossible that this Universe is simulated by a universe sharing the same properties, regardless of technological advancements of the far future." This is about the HOST'S ability to compute the whole universe — related to but NOT the verification-bound argument (no embedded-quantum-computer verification logic apparent from abstract).

### Deutsch quote: secondary confirmations

- `inherited-unchecked` (Goodreads + New Yorker quote pages, both rendering "10500" — the classic mangling of 10^500) — the challenge passage appears in: (a) Deutsch, The Fabric of Reality (Allen Lane/Penguin 1997) per Goodreads attribution; (b) rivka Galchen, "David Deutsch and His Dream Machine," The New Yorker, 2011-05-02, which reproduces: "To those who still cling to a single-universe world-view, I issue this challenge: explain how Shor's algorithm works. I do not merely mean predict that it will work, which is merely a matter of solving a few uncontroversial equations. I mean provide an explanation. When Shor's algorithm has factorized a number, using 10500 or so times the computational resources than can be seen to be present, where was the number factorized?"
  - STILL NEED: (1) exact book source (chapter/page) and (2) clean verbatim with proper superscript. The 10^500 figure is widely reported ("factoring a 10,000-digit number would require 10^500 universes"). Try to locate book text online.
- `inherited-unchecked` — Quantum Computing StackExchange question 30445 "Does Shor's algorithm imply the existence of the multiverse?" — discussion of the counterarguments exists there; fetch for the best formulations if useful.
- NEXT: Steane counterargument paper; Ringel-Kovrizhin exact text; Aaronson p=3482; crossover computation search; Fabric of Reality text.



- `inherited-unchecked` — Ringel & Kovrizhin, "Quantized gravitational responses, the sign problem, and quantum complexity," Science Advances 3, e1701758 (2017) — press widely read it as "proving we don't live in a simulation" (quantum Hall effect cannot be efficiently simulated classically). Venue per Slashdot/Cosmos: Science Advances. MUST fetch to get exact words + authors' own simulation-hypothesis sentence. NOTE: press coverage says "impossible in principle" — need the paper's actual nuance.
- `inherited-unchecked` — arXiv:2212.04921 "Constraints, observations, and experiments on the simulation hypothesis" (PDF found; authors? — snippet quotes Richard Feynman re: simulating nature quantum mechanically). Fetch abs page.
- `inherited-unchecked` — arXiv:2504.08461 "Astrophysical constraints on the simulation hypothesis..." (authors?). Fetch abs page.
- `verified-at-source` — Lloyd bound source: Seth Lloyd, "Computational capacity of the universe," arXiv:quant-ph/0110141 (2001), published Phys. Rev. Lett. 88, 237901 (2002). Abstract: "The universe can have performed no more than 10^120 ops on 10^90 bits." PRL PDF URL: https://link.aps.org/pdf/10.1103/PhysRevLett.88.237901 (this matches the user's ~10^120 figure). DOI 10.1103/PhysRevLett.88.237901 verified via URL pattern `inherited-unchecked` (did not fetch the APS page itself).
- `inherited-unchecked` — ScienceDaily 2025-11-10: "Physicists prove the Universe isn't a simulation after all" (UBC Okanagan, Gödel's incompleteness theorem, 'non-algorithmic understanding') — new relevant work, should check.
- NEXT: verify Deutsch quote at source; find published counterarguments to Deutsch (search for Steane "quantum computer needs only one universe" returned 0 — retry different phrasing); Ringel-Kovrizhin exact wording + Aaronson's rebuttal; Bostrom FAQ quantum question; crossover computation search.



- `verified-at-source` — arXiv:2404.16050 is **David H. Wolpert**, "What computer science has to say about the simulation hypothesis" (fetched https://arxiv.org/html/2404.16050v3). Uses Kleene's second recursion theorem (self-simulation lemma), Rice's theorem (impossibility results), physical Church-Turing thesis framing. Notes: "there has been a lot of work in the philosophy of science literature on the simulation hypothesis... with one partial exception discussed in Appendix F, no work has even been done on using CS theory to investigate the simulation hypothesis." Does NOT appear to address the quantum-computation-verification cost argument directly (only saw through Section 1.3; will check appendix refs later if needed). References [14,11,9] = experimental tests. NOT the same paper the search snippet suggested; snippet's "Turing machine" line is verified in text (footnote: "Throughout this paper, I will often refer to a 'Turing machine' as this kind of device, defined in terms classical physics, even though the physical universe is quantum mechanical").
- `verified-at-source` — Scott Aaronson, "On whether we're living in a simulation," Shtetl-Optimized blog, 2024-02-07, https://scottaaronson.blog/?p=7774. Key content: (1) simulation hypothesis unfalsifiable-until-evidence; (2) the "looking up" objection to Bostrom: "because their simulations will have to run on computers that fit in our universe, presumably the simulated universes will be smaller than ours—in the sense of fewer bits and operations needed to describe them. Similarly, if we're being simulated, then presumably it's by a universe bigger than the one we see around us"; (3) the "low-res approximation" escape: "those escapes (involving, e.g. our universe being merely a 'low-res approximation,' with faraway galaxies not simulated in any great detail) all seem metaphysically confusing." This is relevant to refutation (c)/(d) territory. No quantum-computing-cost argument in this post (contrary to search snippet re: computronium — that line must be from p=3208 or a comment).

### Fetched: Beane/Davoudi/Savage + Vopson (metadata via abstracts/search)

- `inherited-unchecked` (arXiv abs snippets from search; abstract same in multiple listings) — **Silas R. Beane, Zohreh Davoudi, Martin J. Savage**, "Constraints on the Universe as a Numerical Simulation," arXiv:1210.1847 (2012), published Eur. Phys. J. A 50, 148 (2014), DOI 10.1140/epja/i2014-14148-0 (DOI from springer URL `inherited-unchecked`). Abstract verbatim: "Observable consequences of the hypothesis that the observed universe is a numerical simulation performed on a cubic space-time lattice or grid are explored." Relevance: lattice-signature search (cosmic-ray anisotropy bound b >= 10^11 GeV inverse lattice spacing); NOT about embedded quantum computers.
- `inherited-unchecked` — **Melvin M. Vopson**, "The second law of infodynamics and its implications for the simulated universe hypothesis," AIP Advances 13, 105308 (2023), URL https://pubs.aip.org/aip/adv/article/13/10/105308/2915332/ . Claim: information entropy of information-bearing states decreases over time via bit self-erasure (memory optimization), read as support for the simulated-universe hypothesis. DIFFERENT argument shape from the verification-bound one; note published pushback exists (papers citing "striking inversion of the thermodynamic second law" critically).

### Bostrom FAQ: PDF fetch returned raw binary
- `inherited-unchecked` (from earlier search snippet only) — Bostrom, "The Simulation Argument FAQ" v2.0 (2025), https://simulation-argument.com/faq/faq.pdf : does contain Q/A on unfalsifiability (Q11: "Isn't the simulation hypothesis unfalsifiable?" with the "YOU ARE LIVING IN A COMPUTER SIMULATION" popup example) and references Hanson 2001 "How to Live in a Simulation" (Journal of Evolution and Technology, Vol. 7). MUST retry fetch as HTML to check whether any FAQ entry addresses quantum-computation cost.

### Fetched: Bostrom FAQ (HTML version, https://simulation-argument.com/faq/) — TRUNCATED at Q10; spill at /tmp/openclaw-web-fetch-7a9989e06a1b7605.log

- `verified-at-source` — **Nick Bostrom, "The Simulation Argument FAQ" (v2.0, 2025)** HTML at https://simulation-argument.com/faq/. Q6 "Isn't it computationally infeasible to simulate an entire universe?" — verbatim key passages (this is THE standard refutation (c)/special-case answer, from Bostrom himself):
  > "Instead, only enough needs to be included in the simulation to make it appear real to the observers inside. This allows many details to be omitted, such as objects that are very small or very far away. Many of the remaining details could be filled in only when somebody is looking at them or performing relevant experiments. Graphics engines typically render only that which is seen by some player character; and some modern computer games use procedural generation, which creates world details as needed depending on where the player goes..."
  > "Critiques based on the assumption that a simulation would have to be fully comprehensive (e.g. Vazza (2025)) thus miss the point. We may also note that even if fully comprehensive detailed simulations are possible—which is not inconceivable, since the physics in the basement universe might allow for vastly more powerful computers than does the physics in our observed universe—it would still be unlikely that we are in a fully comprehensive simulation, since simulators could run vastly more simplified simulations than fully comprehensive ones for a given computational budget."
  > "A related objection is that the computational cost of simulation would increase exponentially over time, as simulated civilizations develop their own simulations... However, simulators could avoid this by stepping in to prevent simulated civilizations from using excessive amounts of computing power, or by ending them shortly after they begin to consume excessive resources... One consequence of this may be that—unless the basement universe allows for infinite computations—most civilizations would be leaf nodes of the simulation tree: they are themselves simulated but they will never run genuine simulations of their own."
  - The last quoted passage is IMPORTANT PRIOR ART: this is Bostrom addressing the nested-cost objection — the closest published analogue to the user's argument I have found so far, but it is about SIMULATIONS WITHIN SIMULATIONS, NOT about embedded quantum computation verification. Note Bostrom's answer: the simulators can simply throttle/terminate the resource consumers ("stepping in to prevent simulated civilizations from using excessive amounts of computing power"). This is refutation (b)/special-case applied to the user's scenario — the simulator could simply prevent or truncate large verified quantum computations.
  - Q4 references: Bostrom, N. (2003): "Are You Living in a Computer Simulation?", Philosophical Quarterly, Vol. 53, No. 211, pp. 243-255. Bostrom & Kulczycki (2011) "A Patch for the Simulation Argument", Analysis, Vol. 71, No. 1, pp. 54-61. Bostrom (2005) "The Simulation Argument: Reply to Brian Weatherson", Philosophical Quarterly, Vol. 55, No. 218, pp. 90-97. Hanson, R. (2001): "How to Live in a Simulation", Journal of Evolution and Technology, Vol. 7.
  - STILL TO READ from spill: Q11 (unfalsifiability) + Q12 (physics experiments) for any quantum mention.

### VERIFIED: Deutsch quote at source (Chapter 9, The Fabric of Reality)

- `verified-at-source` — Full text of Deutsch, The Fabric of Reality (Penguin Books; archive.org scan, https://archive.org/stream/TheFabricOfReality/The_Fabric_of_Reality_djvu.txt ; spill /tmp/openclaw-web-fetch-a9b5a8243d3d7e76.log, lines ~7576-7594). The passage is in **Chapter 9, "Quantum Computers"** (chapter header found at spill line ~6814; passage at lines 7576-7594). VERBATIM (restoring superscript formatting for the OCR-lost "10 500" = 10^500):

  > "When a quantum factorization engine is factorizing a 250-digit number, the number of interfering universes will be of the order of 10^500 — that is, ten to the power of 500. This staggeringly large number is the reason why Shor's algorithm makes factorization tractable. I said that the algorithm requires only a few thousand arithmetic operations. I meant, of course, a few thousand operations in each universe that contributes to the answer. All those computations are performed in parallel, in different universes, and share their results through interference."

  > "With Shor's algorithm, the argument has been writ very large. To those who still cling to a single-universe world-view, I issue this challenge: explain how Shor's algorithm works. I do not merely mean predict that it will work, which is merely a matter of solving a few uncontroversial equations. I mean provide an explanation. When Shor's algorithm has factorized a number, using 10^500 or so times the computational resources that can be seen to be present, where was the number factorized? There are only about 10^80 atoms in the entire visible universe, an utterly miniscule number compared with 10^500. So if the visible universe were the extent of physical reality, physical reality would not even remotely contain the resources required to factorize such a large number. Who did factorize it, then? How, and where, was the computation performed?"

  - IMPORTANT correction to the user's briefing: Deutsch's example is a **250-digit** number -> 10^500 universes, NOT "10,000-digit number" (at least not in this chapter; the 10,000-digit figure circulates in secondary sources but is NOT what the book says — flag this to Argus).
  - Source details: David Deutsch, The Fabric of Reality: The Science of Parallel Universes—and Its Implications, Penguin Books (first published Allen Lane 1997); Chapter 9 "Quantum Computers". Page number within book: NOT VERIFIED (archive.org djvu text stream does not carry page numbers reliably). The passage is also reproduced in: Rivka Galchen, "David Deutsch and His Dream Machine," The New Yorker, 2011-05-02 (secondary, `inherited-unchecked` verbatim consistency check pending).
  - Note the argument SHAPE: Deutsch is NOT talking about a simulated universe — he argues the computation happens in parallel universes (many-worlds). The user's argument is structurally similar in that both ask "where does the required computation actually happen" — but Deutsch's answer (parallel universes) is an escape the user's argument cannot use, and Steane's rebuttal (below) rejects Deutsch's premise that exponential work must happen anywhere.
  - Structural note: the 10^500 figure is a resource-accounting argument against single-universe reality, NOT against a classical-simulation host. The user's argument applies the SAME accounting logic to the host of a simulation. Prior art on the user's exact move: see VERDICT section.

### Bostrom FAQ Q11/Q12 verbatim (from spill, verified-at-source)

- Q11 "Isn't the simulation hypothesis unfalsifiable?": "There are clearly possible observations that would show that we are in a simulation. For example, the simulators could make a 'window' pop up in front of you with the text 'YOU ARE LIVING IN A COMPUTER SIMULATION. CLICK HERE FOR MORE INFORMATION.'"
- Q12 references Ringel & Kovrizhin directly: "Another example of a proposed physics test derives from the Ringel & Kovrizhin (2017) attempt to show that classical computers cannot efficiently simulate certain quantum systems... Some media reported this as 'scientists have found proof that we are not living in a simulation!'. The most obvious flaw in that interpretation is that simulators could use quantum computers. More generally, the previous point applies: that while one way to produce the appearance of a given system of physics could be to run a simulation that faithfully computes all the physics in question, another way would be to run a simulation that 'cheats' and that produces the appearances in a more intelligently creative or klugey manner: generating patterns that are merely sufficiently realistic in their broad contours to be indiscernible from underlying reality by our primitive human brains (including if necessary by manipulating readings from measurement devices and data files etc.)."
  - This is the canonical statement of refutation (c) (the simulator can lie/fake results, including by "manipulating readings from measurement devices and data files") AND refutation (a) (simulators could use quantum computers), from Bostrom himself, 2025 FAQ. CRITICAL prior art FOR the user's argument framing.
  - Also Q12: Greene, P. (2020): "The Termination Risks of Simulation Science". Erkenntnis, Vol. 85, pp. 489-509 (another named refutation vector).

### NEW LEADS (crossover + verification-simulation linkage)

- `inherited-unchecked` — **Daniel Stilck França & one other author, "A game of quantum advantage: linking verification and simulation," arXiv:2011.12173 (2020), published Quantum 6, 753 (2022-06-30), https://quantum-journal.org/papers/q-2022-06-30-753/.** This is the closest thing found so far to formal treatment of the verification/simulation link: "We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee." FETCH the abstract/paper — the user's argument is essentially a game-theoretic claim (referee = embedded observers, prover = physics/host).
- `inherited-unchecked` — Aaronson, "Can Quantum Computing Reveal the True Meaning of Quantum Mechanics?" (NOVA/PBS 2016-04; blog version https://scottaaronson.blog/?p=2343): "My conclusion is that, if you believe in the reality of Bohmian trajectories, you believe that Nature does even more computational work than a quantum computer could efficiently simulate—but then it hides the fruits of its labor where no one..." — the Aaronson/Kalai principle that Nature does LESS computational work than naive quantum mechanics suggests. This is a different but adjacent claim about Nature's computational economy. FETCH for the exact full sentence.
- `inherited-unchecked` — ScienceDaily 2025-11-10 "Physicists prove the Universe isn't a simulation after all" (UBC Okanagan, Gödel-based) — pending check; note: dated Nov 2025, i.e., after the current date of 2026-09? No: 2025 is before 2026. Fine, real.

### Fetched: Franca et al. + Aaronson NOVA routing

- `verified-at-source` — **Daniel Stilck França (submission author; co-author per search result "and 1 other authors" — likely Michael J. Bremner or similar; NOT VERIFIED)**, "A game of quantum advantage: linking verification and simulation," arXiv:2011.12173v2, journal: Quantum 6, 753 (2022), DOI 10.22331/q-2022-06-30-753. 44 pages. Abstract verbatim (key): "We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee. Bob, is sampling from a classical distribution on a quantum device that is supposed to demonstrate a quantum advantage. The other player, the skeptical Alice, is then allowed to propose mock distributions supposed to reproduce Bob's device's statistics. He then needs to provide witness functions to prove that Alice's proposed mock distributions cannot properly approximate his device." AND: "This pinpoints that exponential resources may be unavoidable for even the most basic verification tasks in the setting of random quantum circuits."
  - RELEVANCE: this is the formal state of the art on verification-vs-simulation duality (verifying implies ability to distinguish distributions; distinguishing implies approximate simulation). It is about proving quantum advantage to SKEPTICS in OUR universe — not about the simulation hypothesis. The user's argument is a novel application of this verification-simulation link to a hypothetical classical host. But note: the paper's direction is "verification implies something about simulation resources" — the user's argument claims the CONVERSE-style implication (host must simulate what observers verify). This is a key nuance: the host does not need to reproduce the FULL distribution, only whatever the observers verify. Worth flagging.
- `verified-at-source` — Aaronson p=2343 blog post is just a pointer; the actual essay is at PBS NOVA blog (http://www.pbs.org/wgbh/nova/blogs/physics/2015/06/can-quantum-computing-reveal-the-true-meaning-of-quantum-mechanics/), posted 2015-06-25 (the search snippet's "2016-04" was a repost). The Bohmian-trajectories quote: "if you believe in the reality of Bohmian trajectories, you believe that Nature does even more computational work than a quantum computer could efficiently simulate—but then it hides the fruits of its labor" — `inherited-unchecked` from search snippet; FETCH PBS page if the exact full sentence is needed. Secondary relevance (Nature does less/more computational work than naively assumed) — adjacent to the user's cost-accounting instinct.