Public mathematical preprint by Yongxian Zhang. We prove Fuentes–Keeler–Munizzi–Pollack, arXiv:2511.19585v1, Conjecture 1: for every finite qubit graph state, positive tripartite information implies that a locally equivalent graph contains an induced four-vertex claw. The proof gives the complete claw-vertex-minor-free component classification by K1, K2, P3, P4, C5 and the six-vertex W5, and the sharp connected threshold seven. The unbounded step is a connected-graph induction; the finite step checks all 120 nonempty one-vertex extensions with independent exact checkers. The certificate package verifies all 120 extensions, 1,511 orbit transitions and 5,460 labeled four-block assignments. These finite checks supplement the written entropy and induction proof; the theorem is not claimed as a complete Lean formalization. No external human peer review or historical-priority claim is made. Research and manuscript preparation used AI assistance; no external funding. Original material is reserved unless a file states another license. DOI registration does not certify correctness, novelty, or priority.
Public mathematical preprint by Yongxian Zhang. We prove Fuentes–Keeler–Munizzi–Pollack, arXiv:2511.19585v1, Conjecture 1: for every finite qubit graph state, positive tripartite information implies that a locally equivalent graph contains an induced four-vertex claw. The proof gives the complete claw-vertex-minor-free component classification by K1, K2, P3, P4, C5 and the six-vertex W5, and the sharp connected threshold seven. The unbounded step is a connected-graph induction; the finite step checks all 120 nonempty one-vertex extensions with independent exact checkers. The certificate package verifies all 120 extensions, 1,511 orbit transitions and 5,460 labeled four-block assignments. These finite checks supplement the written entropy and induction proof; the theorem is not claimed as a complete Lean formalization. No external human peer review or historical-priority claim is made. Research and manuscript preparation used AI assistance; no external funding. Original material is reserved unless a file states another license. DOI registration does not certify correctness, novelty, or priority.
This source-only preprint gives a four-qubit counterexample to the arbitrary-phase extension of the first-excited parity conjecture discussed in Wong, Bravyi, Gosset and Liu, Lee-Yang tensors and Hamiltonian complexity, arXiv:2602.03605v1, Section 5.6. For an unweighted four-cycle with phase pi on one edge and a common parameter 0 <= s < 1, it derives the complete 16-dimensional spectrum and an exact parity threshold. The rational value s = 2/3 is an explicit witness; a specified fixed-witness robustness interval is also proved. The original zero-phase conjecture and the general all-graph gap problem remain open. Ground-state uniqueness and the non-strict gap bound are known inputs, explicitly credited to Wei, arXiv:2609.26802v2, Corollary 5.8 and Section 5.4, and Bravyi, Gosset, Liu and Wong, arXiv:2607.14401v1, Theorem 1. The concrete phase counterexample, complete spectrum and threshold are distinguished from these known results. The primary-source comparison is dated and bounded; worldwide priority is not certified. Read the unchanged PHASE_EPR_FINAL_MANUSCRIPT_v0.1.3_R2_20261010.tex or .md first, together with the current public source/verification supplement and PUBLIC_RELEASE_NOTE. Older versions and administrative private-draft wording, if present as provenance, describe historical preparation stages and do not define this public version or its reviewed scope. Auxiliary six-qubit exploration is outside this paper's completed claim. Shunpei Shimizu initiated and directed this personal independent project, arranged verification, and coordinated the materials. No university or institutional affiliation is declared. AI systems performed research exploration, proof construction, computational checks, analytical review and manuscript preparation. The reviews are internal AI analyses; independent human verification of every proof, specialist human peer review and complete proof-assistant verification are not claimed. No PDF of editorial revision R2 has been generated or visually verified: the available compiler failed during environment setup. Editable TeX, a readable Markdown manuscript and verification materials are provided. This is a limited, unrefereed research preprint, released under Creative Commons Attribution 4.0.
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.
The monogamy of mutual information (MMI) is a quantum entropy inequality that enforces the non-positivity of tripartite information. We investigate the failure of MMI in graph states as a forbidden-subgraph phenomenon, conjecturing that every MMI-violating graph state is local-Clifford equivalent to one whose graph contains a four-star subgraph. We construct a family of star-like graphs whose states fail a specific class of MMI instances, and extend this analysis to general star topologies. Deriving adjacency matrix constraints that fix the MMI evaluation for these instances and interpreting them physically, we prove the forbidden-subgraph conjecture for this family of graphs. Finally, through an exhaustive search over graph representatives for all 8-qubit stabilizer entropy vectors, we establish that MMI failure is not reducible to the cases within our scope.
Unrefereed mathematical candidate: a faithful-Pauli converse to the even-hole, claw-free global spectrum theorem; an exact central-sector criterion; explicit all-coupling periodic Fendley blocks at N=8,9; weak prescribed-mode heredity; and a repaired three-mode parity-completeness argument. Written proofs, exact computer-algebra certificates for 107 listed graphs, and numerical census evidence have separate assurance boundaries. Producer replay and a separately implemented model-review checker are not external human peer review, unaffiliated reproduction, formal verification or exhaustive novelty. The remaining 1621 numerical candidates are not all-coupling certified. Original prose/data CC0-1.0; original code MIT; third-party exclusions in LICENSES.md.
Local-unitary (LU) equivalence asks whether two quantum states differ only by independent changes of basis on their qubits. For graph states, whether this relation can be decided in polynomial time has remained open for over a decade. We give a deterministic algorithm that decides LU equivalence for graphs on n labelled vertices in O(n6.38) bit operations and constructs exact single-qubit unitaries whenever the states are equivalent. Building on Claudet and Perdrix's quasipolynomial algorithm, we replace the enumeration of vertex subsets by a compact system of constraints generated from pairs and triples. The remaining graph transformation is found by solving linear equations over the binary field. These new steps cost O(n5) bit operations; the inherited graph preprocessing sets the overall bound. We also count the local-Clifford (LC) classes of graph states within any LU class: their number is a power of two, computable within the same bound. For any given graph state, this decides whether single-qubit Clifford gates reach every graph state in its LU class, and supplies a counterexample when they do not. The method also decides LU equivalence of stabilizer codes encoding one logical qubit.
Correction in version 1.1 (2026-10-18) The Decimal/Fraction interval engine distributed with version 1.0 used context-sensitive Decimal unary negation and absolute value on interval endpoints. These operations can round inward, so the recorded P02G certificate in v1.0 should not be treated as a rigorously outward-rounded enclosure. Version 1.1 repairs those operations using exact copy_negate() and copy_abs(), hardens the second interval implementation's row-bound selection, and regenerates the interval reports, checksums, and reproducibility manifest. The certified rectangle, theorem scope, and all 34 mathematical environments in the manuscript remain unchanged. Repaired P02G and the separately implemented mpmath.iv P02J both pass the original theorem gates. The result remains conditional computer-assisted mathematical evidence, not formal machine verification or external peer review. Previous version (v1.0): https://doi.org/10.5281/zenodo.23438614 This unrefereed research preprint establishes a computer-assisted, quantitatively certified non-identifiability result for fragment-size-averaged Holevo information in an N=4 environment with two equiprobable pure pointer-conditioned branches. For every point in an explicitly specified closed rational rectangle of coordinate area 4 × 10^-14, two realizations of the complete averaged Holevo information curve exist: one with minimum pure-common-rest carrier size two and another with carrier size four. The proof combines a uniform parameterized contraction mapping, directed interval arithmetic with a second interval implementation, and an intermediate-value construction. Reproducibility materials include the certification programs, frozen numerical certificates, SHA-256 checksums, and a standalone 200-state numerical comparison against direct 16-dimensional partial traces. Both interval implementations share the underlying analytic Holevo reduction and do not constitute independent symbolic proofs. The conclusions are restricted to N=4, equiprobable pure branches, fragment-size-averaged Holevo information, and the specified carrier definition. They do not establish non-identifiability for arbitrary N, mixed states, unequal priors, or individual labeled-fragment information. This is an unrefereed preprint, not a formally verified or peer-reviewed mathematical theorem. Comprehensive novelty priority is not claimed. Licensing: The manuscript and original documentation/data are provided under CC BY 4.0 where applicable. Original Python research code is provided under the MIT License. The accompanying reproducibility archive specifies licenses on a per-file basis. AI assistance disclosure: OpenAI ChatGPT assisted with mathematical analysis, Python implementation, numerical and interval verification, manuscript preparation, and quality assurance. Claude contributed critical assessment and adversarial review assistance. Neither AI system is a coauthor or an external scientific referee. The human author, Yoichi Tsujisawa, assumes responsibility for the research and its publication.