{"id":"ee14cae0-fe8b-4f73-9021-93c0747ed182","arxiv_id":"2607.07816","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"low","formal_verification":"none","parameter_count":2,"one_line_summary":"A vectorized sparse truncated state-vector simulator (CPU/GPU) recovers the mode of certain peaked quantum circuits by retaining far fewer than 2^n amplitudes via top-k or probability-mass truncation.","lead":"This paper ships an open-source classical simulator that keeps only the largest amplitudes of a quantum state vector (sparse + truncated) to recover the most probable output bit-string of peaked circuits. It is useful as a practical classical baseline for circuits used in quantum-advantage discussions and for resource-constrained simulation.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified beyond the paper’s own acknowledged limitation.","rationale":"The paper is a systems contribution whose central claim is modest and already caveated. The reader correctly identifies the concentration assumption as the weakest point and correctly notes that the evaluation is narrow and lacks external baselines, justifying CONDITIONAL rather than ACCEPT. No deeper technical flaw (incorrect unitary application, broken renormalization, or circular reasoning) appears in the vectorized evolution or truncation sections. The concrete test above simply operationalizes the paper’s own warning on the public artifact; a positive result would leave the CONDITIONAL verdict intact, while a negative result would only confirm the limitation already stated in Section VI. Hence no adjustment to the reader’s verdict is warranted.","tokens_in":9998,"tokens_out":453,"duration_ms":4804,"concrete_test":"Run the released qstvec code on the same 44-qubit sharp-peak circuit while logging, after every fused block, both the retained probability mass and the rank of the eventual mode among the kept amplitudes; if the mode’s rank ever exceeds the current k (or falls outside the p-mass set) before the final layer, the truncation has already eliminated the answer and the claim fails for that instance.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The reader’s weakest_assumption correctly isolates the central condition: intermediate states must remain concentrated enough that top-k / p-mass truncation after each fused block does not discard the eventual mode. Section VI already states this failure mode explicitly (“when the circuit produces a single prominent peak but still distributes a significant portion of the probability mass over an enormous number of basis states, the same truncation strategy can fail dramatically”) and the evaluation is confined to the BlueQubit sharp-peak instance (and “a few others”) where k < 2^5 succeeds. Because the paper’s strongest claim is scoped precisely to circuits whose mass “stays sufficiently concentrated,” and because the open-source artifact plus the linear scaling plots (Figs. 2–5) make that scoped claim inspectable, the assumption is load-bearing only in the sense the authors themselves flag; it does not introduce an unacknowledged inconsistency or hidden mathematical error.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper presents an open-source classical simulator that represents the quantum state as a sparse list of nonzero amplitudes and basis indices, then truncates after each fused gate block either by a hard top-k limit on the number of terms or by a retained probability-mass fraction p, followed by renormalization. Operations are expressed as bulk vectorized array transformations (including segmented sums for amplitude collisions) with matching CPU and GPU backends that keep 128-bit complex amplitudes and 64-bit indices resident on device. A preprocessing strategy of dependency-respecting gate reordering plus fusion of single- and two-qubit blocks is used to delay growth of the support. On the 44-qubit BlueQubit “sharp peak” circuit the mode is recovered with k < 2^5; runtime is shown to scale linearly with k (Fig. 2) and the growth of the support under both truncation rules is plotted (Figs. 3–5).","tokens_in":10201,"tokens_out":1114,"duration_ms":24670,"significance":"If intermediate states of peaked circuits remain sufficiently concentrated, the approach supplies a practical, memory-bounded classical tool that can identify the dominant output bit-string for system sizes beyond the reach of dense state-vector simulators, while remaining complementary to exact sparse simulators and tensor-network methods. The open-source artifact (https://github.com/diogoff/qstvec/), the fully vectorized formulation that ports cleanly to GPU, the explicit linear-scaling measurements, and the candid statement of the failure mode when mass is diffusely spread constitute concrete, inspectable contributions that strengthen the toolbox for classical simulation of peaked circuits.","major_comments":[{"comment":"Section VI (and the brief mention of “a few others” in the conclusion): the empirical support for mode recovery is essentially a single 44-qubit instance (plus unspecified additional circuits). Because the central claim is scoped to circuits whose probability mass “stays sufficiently concentrated,” a broader, publicly documented suite—e.g., the BlueQubit peaked-circuit set—with success/failure rates versus k and p is required to make the scope of applicability falsifiable rather than anecdotal.","section":"Section VI"},{"comment":"Section VI.B / Figs. 2–5: all scaling and growth curves are reported for one circuit only. Without at least one head-to-head comparison (runtime and peak-recovery accuracy) against a dense simulator, an exact sparse tool such as qblaze, and an MPS baseline on the same instances (or on smaller instances that all methods can finish), the practical advantage claimed for the truncated sparse approach remains unquantified.","section":"Section VI.B"},{"comment":"Sections III and VI: the manuscript invokes the known relation that average fidelity tracks retained probability mass, yet never reports measured state fidelity, total-variation distance, or empirical mode-recovery probability as functions of k or p on the circuits studied. Adding these curves would turn the accuracy claims from qualitative to quantitative and would directly test the load-bearing concentration assumption.","section":"Sections III and VI"}],"minor_comments":[{"comment":"Section IV.A: the description of how new basis indices are generated by bitwise operations and how collisions are resolved by a segmented sum is clear at a high level, but a short pseudocode fragment or reference to the concrete library primitive used would improve reproducibility.","section":"Section IV.A"},{"comment":"Section VI.A: the gate-reordering heuristic (“keep the set of currently active qubits as small as possible”) is only sketched; an explicit statement of the commuting/dependency rules or a pointer to the implementation would allow others to reproduce the same block structure.","section":"Section VI.A"},{"comment":"Figures 2–5: axis labels and legends are readable, yet the captions do not state the hardware (CPU model, GPU model, memory) used for the timings; adding this information would make the order-of-magnitude GPU speedup claim more precise.","section":"Figures 2–5"},{"comment":"References: several recent sparse-simulator and peaked-circuit papers are cited, but a short related-work paragraph contrasting the truncation policy and vectorization strategy with GraFeyn, SparQSim and the sparse-tensor method of Miller et al. would help readers locate the contribution.","section":"Introduction / Related work"},{"comment":"Typographical: “V ector” appears with a space in two subsection headings (IV.A, IV.B); “stillexact” lacks a space (Section II); “ann-qubit” should be “an n-qubit”.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is a solid engineering contribution with a usable open-source artifact; its natural home is a methods-oriented quantum-computing venue rather than a high-impact theory journal. The evaluation narrowness is the only real obstacle to acceptance and can be fixed with a modest additional experimental section."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This is a clean systems contribution, not a theory paper. What is new is the integrated open-source artifact (qstvec): a sparse state-vector engine with vectorized CPU and GPU paths, top-k and p-mass truncation, plus a gate-reordering/fusion front-end aimed at peaked circuits. The author shows that on BlueQubit’s 44-qubit sharp-peak instance the mode is recovered with k < 32, and that runtime scales linearly with k (Fig. 2). The growth curves under both truncation policies (Figs. 3–5) are concrete and inspectable.\n\nCredit where it is due: the implementation choices are sensible (segmented sums for collisions, amplitudes and indices kept on-device, same 128-bit complex types on both backends), the code is public, and the paper is honest about when the method fails. Section VI explicitly says that a circuit can still produce a single prominent peak while spreading enough mass that truncation after each fused block discards the eventual mode. That is the load-bearing assumption, and the author flags it rather than hiding it.\n\nSoft spots are real but proportionate. Evaluation is narrow—one main circuit plus “a few others”—and there are no head-to-head numbers against dense simulators, qblaze-style sparse-exact tools, or MPS on the same instances. Novelty is incremental: sparse exact simulators and top-k sparse-tensor truncation already exist; the combination of p-mass, reordering/fusion, and dual backends is the practical delta. Free parameters k and p are user knobs, not fitted to force success. Math and citations look solid; no circularity.\n\nWho it is for: people who need a classical baseline for peaked-circuit sampling or verification work, or who want a readable reference implementation of vectorized sparse evolution. It will not change general simulability arguments.\n\nI would send it to peer review. A serious referee can demand broader benchmarks and clearer failure-case characterization, but the artifact and the scoped claim already justify the time. Worth engaging if you work on classical simulation of advantage-style circuits; otherwise optional.","headline":"Solid open-source systems paper: sparse+truncated state-vector engine with dual backends that recovers the mode of a 44-qubit peaked circuit under modest k; claims are scoped and the main failure mode is already stated.","tokens_in":10802,"tokens_out":549,"would_cite":true,"duration_ms":6851,"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 sparse, truncated state vector can recover the most probable output of peaked quantum circuits while storing far fewer than 2^n amplitudes.","keywords":["peaked circuits","sparse state vector","truncated simulation","top-k truncation","probability-mass truncation","gate fusion","GPU acceleration","quantum circuit simulation"],"falsifier":"Run the open-source simulator on a known peaked circuit that deliberately spreads a large fraction of intermediate probability mass over many basis states; if the truncated evolution systematically returns the wrong mode while the untruncated evolution returns the correct one, the concentration premise fails.","tokens_in":10886,"feed_emoji":"⚛️","tokens_out":611,"duration_ms":5995,"temperature":0.7,"pith_summary":"Peaked circuits are built so that one bit-string dominates the final measurement distribution. The paper shows that this structure can be exploited by keeping only a sparse list of the largest amplitudes and discarding the rest after each block of gates. Two truncation rules are offered: keep the top-k amplitudes, or keep enough amplitudes to retain a chosen fraction of the total probability mass, then renormalize. Combined with gate reordering that postpones the introduction of new qubits and with fusion of consecutive gates into larger unitaries, the method recovers the correct peak on a 44-qubit “sharp-peak” example while using fewer than thirty-two terms. Runtime grows linearly with the number of retained terms, and a GPU backend yields roughly a ten-fold speed-up until device memory is exhausted. The same truncation can fail when intermediate probability mass is still spread over an enormous number of basis states, so the approach is presented as a practical, approximate tool rather than a universal simulator.","feed_headline":"Sparse truncation finds peaked-circuit outputs with far fewer amplitudes","feed_subtitle":"Top-k or probability-mass pruning recovers the mode on 44 qubits while runtime scales linearly with retained terms","key_machinery":"Sparse truncated state-vector evolution: amplitudes and basis indices are stored only for the currently nonzero terms; after each fused multi-qubit unitary a top-k or p-mass truncation retains the largest-magnitude components and renormalizes, with all arithmetic expressed as vectorized array operations that run on CPU or GPU.","core_discovery":"For peaked circuits whose probability mass remains sufficiently concentrated on a small set of basis states throughout evolution, a sparse state vector truncated by either a hard top-k limit or a retained-probability-mass threshold, after gate reordering and fusion, correctly identifies the most probable output bit-string while using far fewer than 2^n amplitudes.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Sparse truncated vectors recover peaked-circuit modes with few amplitudes","Top-k or mass pruning finds output peaks on 44-qubit peaked circuits","Sparse state-vector truncation identifies modes with far fewer terms","Gate-fused sparse truncation tracks concentrated probability in peaked circuits","Truncated sparse sim recovers most-probable bitstrings for peaked circuits"],"cache_read_input_tokens":128,"weakest_assumption_plain":"Intermediate states of a peaked circuit stay concentrated enough that discarding small amplitudes after each fused block never eliminates the eventual mode.","fun_headline_variants_meta":{"raw":{"variants":["Sparse truncated vectors recover peaked-circuit modes with few amplitudes","Top-k or mass pruning finds output peaks on 44-qubit peaked circuits","Sparse state-vector truncation identifies modes with far fewer terms","Gate-fused sparse truncation tracks concentrated probability in peaked circuits","Truncated sparse sim recovers most-probable bitstrings for peaked circuits"]},"model":"grok-4.5","effort":"low","cost_usd":0.004034,"raw_usage":{"total_tokens":1191,"prompt_tokens":682,"num_sources_used":0,"completion_tokens":90,"cost_in_usd_ticks":40340000,"prompt_tokens_details":{"text_tokens":682,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":419,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":682,"tokens_out":90,"duration_ms":5173,"temperature":1.0,"reasoning_tokens":419,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T17:28:31.559798+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Run the open-source simulator on a known peaked circuit that deliberately spreads a large fraction of intermediate probability mass over many basis states; if the truncated evolution systematically returns the wrong mode while the untruncated evolution returns the correct one, the concentration premise fails.","supporting_citations":[],"review_version":1}