Rhetorical Quantum-State Vector-Length Question

Rhetorical Quantum-State Vector-Length Question

Definitions and mathematical statement

Shared notation.

Standard number systems are $\mathbb N,\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$. Specialized notation and index ranges follow the cited source and the definitions below.

A pure $n$-qubit state is a unit vector in a complex vector space of dimension $2^n$. Its coordinate list in a product basis has $2^n$ entries; a short description or preparation circuit is a different representation.

Record scope and qualifications.

The catalogue title is retained as metadata. Named certificates, contracts, bounds or frameworks in that title are not asserted as results of the original source extract. The supplied registry flags this extraction as unrecoverable. It is displayed as a literal source fragment; the definitions provide context rather than a replacement formal statement.

The extracted title does not provide a distinct open mathematical assertion, and the vector dimension alone does not imply a lower bound on concise state descriptions.

Source-record limitation: Source flags the statement as unrecoverable: This is the title-level rhetorical framing of the abstract, not a standalone mathematical statement; the actual tree-size conjectures are recorded separately as OWR-831-012. No separate clean statement is promoted; the original remains retained for provenance. The source text below is rendered literally where necessary; damaged formulas and composite extracts are not silently repaired into a new mathematical claim. The supplied catalogue marks this record as unrecoverable. Its extract and terminology are documented, but a complete original problem has not been reconstructed.

Statement recorded in the supplied source.

Are quantum states exponentially long vectors? [S2]

Source status.

The supplied catalogue labels this source record open; that metadata was checked against the supplied snapshot on 2026-10-11. The label is preserved for provenance and is not an independent verification of present open status or mathematical correctness. The catalogue literature assessment is dated 2026-08-21.

Short English statement

This is a rhetorical question about the representation of quantum states.

Sources

• S1 Ulam AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 30000238 (OWR-831-010). Catalogue curation and metadata: CC BY 4.0. The source extract is retained; definitions, English summaries and qualifications are editorial additions. https://huggingface.co/datasets/ulamai/UnsolvedMath.
• S2 Complexity Theory $2006$, Oberwolfach Reports, DOI 10.4171/owr/2005/26, pp. 1431--1504 https://doi.org/10.4171/owr/2005/26.
• S3 Aaronson quantum states paper https://arxiv.org/abs/quant-ph/0507242.
• Source-specific Oberwolfach Reports licences, including CC BY-SA 4.0 where applicable, are retained; see THIRD_PARTY_NOTICES.md.

Preparation and review.

The original source and UnsolvedMath contributors retain attribution for the source extract. Codex (GPT-6; exact serving revision not exposed) assisted with definitions, English summaries, scope notes and formatting. No new human mathematical authorship or independently verified solution is asserted. Permanent source ID 30000238 and code OWR-831-010 checked against the complete supplied registry and current repository. Distinct upstream records, including repeated questions and broad or damaged extracts, are retained for complete coverage of the source CS category. A repeated record is not a new independent conjecture. Complete mathematical-equivalence and current-literature review has not been performed. Preparation and final review follow contribution prompts C and D, with source gaps disclosed. Structural and rendering checks do not establish a new theorem or open status.

Research attempt

Literature, source context and scope

The full original catalogue body and source qualifications are preserved above. The relevant primary workshop passages were read in the cached publisher report. Historical claims and subsequent attributed results are distinguished from the mathematical work below. A restricted example, standard lemma or known theorem is not counted as new progress on the entire original target. Missing assumptions and repeated or rhetorical extracts are not silently turned into different solved problems.

A finite description-counting test of the rhetorical question

The source's question about classical skepticism and quantum computing is rhetorical rather than a single quantified theorem. One concrete premise that can be tested is the claim that every $n$-qubit state has a short exact classical description. Fix any decoding convention that maps each finite binary description to at most one state up to global phase. No computability assumption is needed for the following count. Thus, for example, descriptions of length $L=2^n-2$ cannot cover even this finite family. However this says nothing about efficient preparation, approximation, physically available states, or advantage on a computational task. The product state $|+\rangle^{\otimes n}$ has a state tree with exactly $n$ leaves despite having $2^n$ nonzero amplitudes. Its upper bound follows by tensoring the $n$ one-qubit vectors. Any state tree on all $n$ labeled qubits has at least one leaf for each qubit, so this bound is exact.

Verification and remaining gaps

For $n=3$, the sign family has 128 states, whereas descriptions of at most four bits supply only 31 strings. These finite counts were checked directly. The attempted inference from a large coordinate list to an impossibility of compact representation fails on the product state; the counting argument only establishes existence of some hard-to-describe states in a chosen exact-description convention. It does not settle a position about quantum mechanics, a complexity separation, or the source's particular code and algorithmic state families. No formal theorem is substituted for the whole rhetorical agenda.

References and source attribution

Primary workshop report: https://doi.org/10.4171/owr/2005/26. Relevant passages read: 2005/26 pp. 1464--1465, the rhetorical quantum-state question and tree-size motivation.

All retrievals were checked on 11 October 2026. Original question attribution remains in the preserved Sources section. External theorems are attributed and not claimed as new discoveries or fully verified merely by citation.

Integration review.

Codex (GPT-6; exact serving revision not exposed) reviewed the written arguments and expanded layout and source-reference wrappers. Repository metadata and the production web renderer were checked using Python 3.13 and JavaScript with MathJax 3.2.2. This model-assisted review is not independent human proof verification; no PDF compilation or formal proof checking is asserted.

Completion Estimate

COMPLETION: 0% No substantiated new progress toward the entire original target is claimed. The worked results and failed route are delimited above; a known result, illustrative model, or auxiliary obstruction is not counted as original-target completion.

Final status and attribution

Attempt status: unresolved. This describes this research attempt, not a new ruling on the source catalogue's status or on external literature claims. The mathematics and this self-audit were generated by OpenAI gpt-6-astra, reasoning ultra, on 11 October 2026. Codex (GPT-6; exact serving revision not exposed) orchestrated the batch and contributed formatting/repository review. No human mathematical authorship, independent human proof checking, or formal verification is claimed. The historical preparation paragraphs in the reproduced catalogue body concern that body only.

Contribution prompt A was applied to the complete definition and supplied source record, followed by the adversarial checks of prompt B. Local reproduction files are batch016/checks.py, computations.json, and the per-ID audit JSON. They were not public links at preparation time. Numerical checks are finite and do not prove unrestricted results. No LaTeX engine was found locally; compilation was not performed by this research agent.