{"id":"341ca343-624e-49c5-a717-e78624b59127","arxiv_id":"2607.10615","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":5.5,"correctness_risk":"low","formal_verification":"none","parameter_count":5,"one_line_summary":"A reproducible unanchored Lie-exponential AMUB optimizer recovers exact 3-MUB configurations in d=6, a recurrent partial-exact hub-and-triangle for n=4, and no near-exact pairs for n=5 or 6 across 100-seed campaigns.","lead":"The authors ship a portable, artifact-exporting optimizer for approximate mutually unbiased bases that treats every basis symmetrically via Lie-algebra unitaries. In dimension six it recovers exact triples, a recurrent four-basis hub-and-triangle pattern, and no near-exact pairs for five or six bases under their protocol, while showing current QPUs cannot resolve the fine structure.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified beyond the authors' own scoping of finite sampling.","rationale":"The manuscript is a mathematical-software contribution whose strongest claim is an empirical description of what a fully specified optimizer reaches, not a proof about the full non-convex landscape. The authors repeatedly emphasize this scope (abstract, §1, §5.10, conclusion). Public code, artifact directories, and pairwise diagnostics allow independent verification of the reported structures. The QPU experiment is correctly framed as a noise-floor check rather than a certification of classical defects. The reader's weakest_assumption is accurate but already mitigated by the paper's own language; therefore no verdict adjustment is warranted. CONDITIONAL remains appropriate solely because of the acknowledged finite sampling, not because of any internal flaw.","tokens_in":24792,"tokens_out":464,"duration_ms":4874,"concrete_test":"Re-run the n=5 and n=6 complex128 campaigns with 5000 Adam steps (or L-BFGS after 2000 Adam steps) on the same 100 seeds; if any seed produces a pair with δ_ij < 10^{-6}, the 'no near-exact pairs under the reported protocol' statement would need qualification. Otherwise the scoped claim is reinforced.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is carefully scoped as reproducible numerical evidence under a fixed protocol (unanchored Lie-exp parameterization, Adam with lr=0.02/init=0.05/1500–2000 steps, 100 seeds, τ=10^{-6}), not as a landscape-complete or existence result. Section 5.10 and the conclusion already flag that alternative optimizers, longer budgets, or different parameterizations may sample other basins. The multi-seed tables (Tables 3–4), pairwise spectra, and public artifacts make the reported progression (exact triples, recurrent n=4 hub-and-triangle, zero near-exact pairs for n=5,6) internally consistent and independently checkable. The reader's weakest_assumption correctly notes the finite budget, but that limitation is already owned by the authors and does not undermine the claim as stated. No hidden inconsistency or unacknowledged over-claim is present.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper presents a reproducible, parameter-driven software workflow for unanchored approximate mutually unbiased basis (AMUB) optimization in arbitrary dimension d, using Lie-algebra unitary parameterization (Uk = exp(iHk)) and a pairwise Frobenius defect loss. The implementation supports CPU, MPS, CUDA, and HPC backends, with a Taylor-series matrix-exponential layer for accelerator compatibility; structural results use the CPU/native torch.matrix_exp pathway. As a d=6 case study, 100-seed campaigns for n=3,4,5,6 in complex128 and complex64 recover exact three-basis configurations for many seeds, identify a recurrent four-basis partial-exact hub-and-triangle structure (three near-exact pairs, three defective), and report no near-exact pairs for n=5 or n=6 under the primary tolerance τ=10^{-6}. A hardware check embeds a representative n=4 configuration into three-qubit circuits on ibm_marrakesh; measured QPU losses sit in a 0.02–0.08 noise floor that obscures classical near-exact vs defective structure. Full run artifacts, code, and Zenodo archive are provided.","tokens_in":25024,"tokens_out":1319,"duration_ms":26804,"significance":"If the reported numerical landscape is accepted as scoped, the work supplies a useful, portable mathematical-software artifact for AMUB exploration: unanchored Lie-exponential optimization, pairwise defect geometry diagnostics, precision-aware multi-seed campaigns, and backend-portable execution with explicit separation of reference (CPU/native) vs accelerator (Taylor) pathways. The careful non-claim of existence/nonexistence for complete MUBs in d=6, the public artifact pipeline, and the honest QPU noise-floor assessment are strengths appropriate to cs.MS and computational quantum information. The recurrent n=4 hub-and-triangle observation and the clean n≥5 disappearance of near-exact pairs under a fixed protocol are concrete, checkable empirical findings that others can extend with different optimizers or budgets. Significance is primarily as reproducible infrastructure and landscape sampling rather than as a resolution of the d=6 MUB problem.","major_comments":[{"comment":"The software is advertised for arbitrary d, yet the only systematic multi-seed structural campaigns are in d=6. Section 5.8 mentions positive-control configurations in dimensions where complete MUB sets are known, but no multi-seed recovery of complete (d+1)-MUB sets in prime or prime-power dimensions (e.g. d=2,3,5,7) is reported. A short validation campaign recovering known complete sets would substantially strengthen the claim that the unanchored Lie-exponential + Adam protocol is a reliable general workflow, not only a d=6 sampler.","section":"§5.8, §6.1"},{"comment":"The 'recurrent hub-and-triangle' claim for n=4 rests on median near-exact count = 3 (Table 3) and representative spectra/heatmaps. The paper does not report how often the three near-exact edges form a star (one hub) versus other three-edge graphs across the 100 seeds, nor whether the defective triangle is always the complement of a single hub. A brief combinatorial summary of edge patterns over seeds would make the structural claim load-bearing rather than representative-run based.","section":"§6.1 Table 3; §6.4; Fig. 1"}],"minor_comments":[{"comment":"Section 6 opens with a formatting glitch: 'subsectionSingle-Seed Sweep overn= 2,...,7' (missing space and subsection markup). Fix before production.","section":"§6"},{"comment":"Backend name is written both as ibm-marrakesh and ibm_marrakesh; standardize to the IBM platform identifier used in the citation.","section":"Abstract; §6.5"},{"comment":"Table 1 lists Taylor order N=20 for accelerator timing only; a one-line reminder in the Table 5/6 captions that structural AMUB conclusions do not use the Taylor pathway would reduce misreading by skimmers.","section":"Table 1; Tables 5–6"},{"comment":"Figures 1–2 are labeled as pairwise-loss heatmaps but the color scale is written '|Ui Uj|^2'; clarify whether the plotted quantity is the full overlap matrix or the scalar ℓij per pair, and ensure axis labels match the caption.","section":"Fig. 1; Fig. 2"},{"comment":"The single-seed n=3 run with s=1234 is defective (Table 2) while the multi-seed median is exact; a short cross-reference in §6.0 to the multi-seed basin diversity in §6.1 would help readers who stop at the validation sweep.","section":"Table 2; §6.0–6.1"},{"comment":"Related-work citations on computational MUB searches in d=6 are present but brief; a sentence locating the unanchored approach relative to anchored Hadamard-family searches (beyond the gauge discussion in §3.3) would improve orientation for the quantum-information audience.","section":"§1; §3.3"}],"recommendation":"minor_revision","confidential_remarks":"Fit for a mathematical-software / computational-methods venue is good; the paper is carefully scoped and does not overclaim existence results. The two major points are strengthening validations rather than correctness failures. I would not send this to a pure quantum-foundations journal expecting a resolution of the d=6 MUB problem. Code and Zenodo archive are a genuine plus for reproducibility standards."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This is a real software contribution for computational MUB work, not a disguised existence claim. What is new is the full unanchored Lie-exponential workflow with multi-seed campaigns, pairwise-defect graph diagnostics, dual-precision CPU/native reference runs, a Taylor compatibility layer for accelerators, public artifacts, and a concrete QPU noise-floor measurement on ibm_marrakesh for embedded d=6 unitaries.\n\nThe math is standard and clean: Frobenius AMUB defect, Hermitian generators via symmetrization, unitarity residuals monitored separately. Claims stay inside the protocol (Adam, lr=0.02, init 0.05, 1500–2000 steps, 100 seeds, τ=10^{-6}). Tables 3–4 and the spectra show the progression they report: exact triples for many n=3 seeds, recurrent n=4 hub-and-triangle (three near-exact, three defective), and zero near-exact pairs for n=5 and n=6 in both precisions. The QPU section is usefully modest—noise floor 0.02–0.08 from ~37 CZ gates washes out the classical distinction. Code and Zenodo archive make the numbers checkable.\n\nSoft spots are real but already flagged by the authors in 5.10 and the conclusion. One hundred seeds and a fixed Adam budget do not exhaust the non-convex landscape; a different parameterization or longer run could land elsewhere. That does not break the claim as written—it is “landscape sampled by this workflow,” not “no better basins exist.” The hub-and-triangle label is descriptive, not a new theorem. Citation pattern is appropriate for the subfield.\n\nWho it is for: people who actually run numerical MUB searches or need a portable unitary-optimization stack. Not for pure existence theorists looking for a proof. I would send it to peer review; a serious referee can push on optimizer diversity and n=7 campaigns without the paper collapsing. Worth engaging if you care about reproducible computational geometry of MUBs.","headline":"Solid, carefully scoped mathematical-software paper that ships a usable AMUB lab and honest multi-seed evidence for d=6; finite sampling is owned, not hidden.","tokens_in":25623,"tokens_out":503,"would_cite":true,"duration_ms":7752,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"A reproducible unanchored optimizer recovers exact three-basis MUBs in dimension six, a recurrent partial-exact four-basis hub-and-triangle, and no near-exact pairs for five or six bases under the reported campaigns.","keywords":["mutually unbiased bases","approximate MUB","dimension six","Lie-algebra parameterization","unanchored optimization","pairwise defect geometry","reproducible scientific software","quantum hardware execution"],"falsifier":"A single optimized configuration for n=5 or n=6, produced under the same parameterization and primary tolerance τ=10^{-6}, that contains at least one pairwise maximum entrywise deviation below 10^{-6} would falsify the reported fully defective transition; conversely, an independent optimizer or longer budget that recovers an exact four-MUB would show the hub-and-triangle is only a local basin of this workflow.","tokens_in":25707,"feed_emoji":"⚛️","tokens_out":1117,"duration_ms":19045,"temperature":0.7,"pith_summary":"The paper offers a portable, artifact-driven software workflow for searching approximate mutually unbiased bases without fixing any basis in advance. Bases are built as unitaries via Lie-algebra exponentiation, optimized jointly with Adam, and diagnosed as weighted graphs of pairwise defects rather than by a single scalar loss. In dimension six, across one hundred random seeds in both double and single complex precision, the workflow recovers exact triples, repeatedly lands on a four-basis pattern with three near-exact edges and a defective triangle, and never finds a near-exact pair once five or six bases are requested under the primary numerical tolerance. A short quantum-hardware check shows that compiling the best four-basis transitions into three-qubit circuits yields a noise floor large enough to erase the classical distinction between good and bad pairs. The result is not a proof that complete seven-basis sets fail to exist; it is a shareable computational map of the basins this optimizer actually reaches, plus an honest first look at running those unitaries on present-day hardware.","feed_headline":"No near-exact MUB pairs beyond four bases in dimension six","feed_subtitle":"Unanchored Lie-exponential search recovers exact triples and a hub-triangle, then fully defective configs for n=5,6","key_machinery":"Unanchored Lie-algebra unitary parameterization: each candidate basis is Uk = exp(i Hk) with Hermitian generators obtained by symmetrizing unconstrained complex matrices, so unitarity is enforced by the forward model; the total AMUB loss is the sum of pairwise Frobenius defects of the entrywise-squared Gram matrices from the uniform 1/d target, retained as a weighted complete graph of pairwise defects.","core_discovery":"Under a fixed unanchored Lie-exponential parameterization, Adam schedule, seed set, and primary tolerance of 10^{-6}, the sampled optimization landscape in dimension six yields exact three-basis configurations for many seeds, a recurrent four-basis partial-exact hub-and-triangle with three near-exact pairs, and fully defective configurations with zero near-exact pairs for every seed when five or six bases are requested, in both complex128 and complex64 arithmetic.","pith_inferences":["The recurrent hub-and-triangle for n=4 is consistent with known rigidity or non-extendability phenomena for MUBs in dimension six; the workflow may be rediscovering a structural obstruction rather than an optimizer artifact.","If longer multi-seed n=7 campaigns continue to show zero near-exact pairs, the software becomes a practical stress test for any future analytic construction claiming a complete set.","Precision sensitivity at n=4 (median near-exact count drops from three in complex128 to zero in complex64) suggests that reduced-precision accelerator runs need relaxed classification tolerances or higher Taylor order before they can be trusted for fine defect geometry.","Embedding d=6 into three qubits with post-selection is a concrete benchmark for whether future lower-depth unitary synthesis can bring the hardware noise floor below classical AMUB defect scales."],"forward_implications":["Exact three-MUB configurations in d=6 are routinely reachable by unanchored gradient search without anchoring to Fourier or Hadamard families.","Four-basis searches under this workflow should be expected to land in a three-edge hub plus defective triangle rather than an exact four-MUB.","Scalar aggregate loss alone is insufficient; pairwise defect graphs are required to separate exact triples, partial-exact hubs, and fully defective configurations.","Current compiled three-qubit embeddings of d=6 transitions (tens of native two-qubit gates) produce a noise floor that washes out classical near-exact versus defective distinctions.","The same parameterized stack can be rerun for other composite dimensions or larger seed budgets without rewriting the unitary model or artifact pipeline."],"fun_headline_variants":["Exact MUB triples and hub-triangle found; none for n=5,6 in d=6","Dim-6 unanchored search: exact triples, partial fours, fully defective fives/sixes","No near-exact pairs past four bases under fixed Lie-exponential search in d=6","Reproducible AMUB workflow recovers exact triples; zero near-exact for n=5,6","d=6 landscape: exact three-bases, hub-triangle fours, defective five/six configs"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"That one hundred random seeds, a fixed Adam learning rate and step budget, and this particular Lie-exponential parameterization are enough to treat the total absence of near-exact pairs for five and six bases as a stable feature of the landscape the method samples.","fun_headline_variants_meta":{"raw":{"variants":["Exact MUB triples and hub-triangle found; none for n=5,6 in d=6","Dim-6 unanchored search: exact triples, partial fours, fully defective fives/sixes","No near-exact pairs past four bases under fixed Lie-exponential search in d=6","Reproducible AMUB workflow recovers exact triples; zero near-exact for n=5,6","d=6 landscape: exact three-bases, hub-triangle fours, defective five/six configs"]},"model":"grok-4.5","effort":"low","cost_usd":0.00381,"raw_usage":{"total_tokens":1275,"prompt_tokens":864,"num_sources_used":0,"completion_tokens":128,"cost_in_usd_ticks":38100000,"prompt_tokens_details":{"text_tokens":864,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":283,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":864,"tokens_out":128,"duration_ms":4311,"temperature":1.0,"reasoning_tokens":283,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-14T10:26:54.785481+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"A single optimized configuration for n=5 or n=6, produced under the same parameterization and primary tolerance τ=10^{-6}, that contains at least one pairwise maximum entrywise deviation below 10^{-6} would falsify the reported fully defective transition; conversely, an independent optimizer or longer budget that recovers an exact four-MUB would show the hub-and-triangle is only a local basin of this workflow.","supporting_citations":[],"review_version":1}