{"id":"e50cda62-07f2-4ab4-89a3-4cc3787bcced","arxiv_id":"2606.11530","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Locally acting Grover mixers for constraint-preserving QAOA achieve comparable convergence to global versions using shallower circuits with fewer gates on exact-cover and TSP instances.","lead":"This paper proposes locally acting Grover mixers for QAOA that replace the global multi-controlled phase-shift gate with local operations on disjoint qubit subsystems derived from partial constraint encoding in the initial state. This approach aims to reduce circuit overhead while preserving the feasible search space for problems like exact-cover and TSP.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Method requires initial states with product structure over disjoint subsystems via partial constraint encoding; this is load-bearing for the claimed circuit savings and comparable performance.","rationale":"The reader's weakest_assumption directly identifies the same structural precondition. Because the numerical evidence is obtained only inside that regime, the headline claim holds conditionally rather than unconditionally; the abstract-only review is therefore upgraded to CONDITIONAL once the full text confirms the scope is explicitly limited to product initial states.","tokens_in":1695,"tokens_out":345,"duration_ms":39282,"concrete_test":"In the TSP section, extract the two constraint-encoding strategies; verify whether the subset encoding produces an explicit product initial state |ψ⟩ = ⊗_k |ψ_k⟩ and whether the local mixer unitary is derived as ⊗_k (2P_k − I) without additional cross terms; if the derivation invokes an unstated independence assumption between subsystems, recompute the success probability on the smallest TSP instance with the corrected global mixer on the same subspace.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim (comparable convergence on exact-cover and TSP using shallower local mixers) depends on the initial state being a tensor product over disjoint qubit groups obtained by encoding only a subset of constraints. The local Grover mixer is then the tensor product of subsystem diffusers, which exactly preserves that (possibly larger) subspace. If constraints cannot be partitioned this way while keeping efficient state preparation, the construction does not apply and the global multi-controlled phase cannot be replaced. The TSP comparison of subset vs. full encoding implicitly tests this, but the paper provides no general procedure for finding such partitions or quantifying the resulting subspace enlargement.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript proposes locally acting Grover mixers for GM-QAOA applicable when initial states admit a product structure over disjoint qubit subsystems (obtained by encoding only a subset of constraints into state preparation). This replaces the global multi-controlled phase-shift with local subsystem operations while preserving the feasible subspace defined by the initial state. Numerical simulations on exact-cover and TSP instances are reported to show convergence behavior comparable to standard GM-QAOA but with shallower circuits and fewer gates; a comparison of subset versus full constraint encoding for TSP is also presented.","tokens_in":1838,"tokens_out":456,"duration_ms":18583,"significance":"If the central claims hold, the work offers a concrete route to lower the gate count and depth of constraint-preserving QAOA mixers on near-term hardware by exploiting partial constraint encoding. The explicit construction of local diffusers as tensor products of subsystem operators and the TSP encoding comparison provide a useful case study, though broader applicability hinges on the partitionability of constraints.","major_comments":[{"comment":"Abstract and simulation results section: the claim that the proposed method 'achieves convergence behavior comparable to that of the original GM-QAOA' is supported only by the statement that simulations were performed; no circuit implementations, parameter schedules, error bars, number of shots, or statistical tests are supplied, preventing evaluation of whether the observed performance difference is significant or reproducible.","section":"Abstract and simulation results section"},{"comment":"Section describing the TSP encoding comparison: the local-mixer construction is load-bearing on the existence of a constraint partition that yields a product initial state; while the subset-versus-full encoding comparison for TSP implicitly tests one instance, no general algorithm, complexity bound, or procedure is given for identifying such partitions on arbitrary problems or for quantifying the resulting enlargement of the preserved subspace.","section":"Section describing the TSP encoding comparison"}],"minor_comments":[{"comment":"The definition of the local Grover mixer as a tensor product of subsystem diffusers would benefit from an explicit equation showing how the phase oracle is restricted to each subsystem.","section":"Method section"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the careful review and constructive comments. Below we respond point by point to the major comments.","responses":[{"response":"We agree that the simulation section would benefit from greater detail to support reproducibility and statistical evaluation. In the revised manuscript we will add explicit circuit diagrams or gate counts for the local versus global mixers, the QAOA parameter schedules employed, error bars on all convergence plots, the number of shots used in the simulations, and the results of any statistical comparisons performed between the local and global mixer variants.","revision_made":"yes","referee_comment":"[Abstract and simulation results section] Abstract and simulation results section: the claim that the proposed method 'achieves convergence behavior comparable to that of the original GM-QAOA' is supported only by the statement that simulations were performed; no circuit implementations, parameter schedules, error bars, number of shots, or statistical tests are supplied, preventing evaluation of whether the observed performance difference is significant or reproducible."},{"response":"The local-mixer construction applies precisely when an initial state with the required product structure over subsystems is available, which the paper obtains by encoding only a subset of constraints. The TSP comparison is presented as a concrete case study illustrating the resulting circuit savings and performance, not as a general method for discovering partitions. We do not provide a general algorithm or complexity bound because identifying suitable constraint partitions is problem-dependent and lies outside the scope of the work, which centers on the mixer construction itself once such a state is given. The enlargement of the preserved subspace is reflected in the reported circuit metrics and solution quality for the TSP instances examined.","revision_made":"no","referee_comment":"[Section describing the TSP encoding comparison] Section describing the TSP encoding comparison: the local-mixer construction is load-bearing on the existence of a constraint partition that yields a product initial state; while the subset-versus-full encoding comparison for TSP implicitly tests one instance, no general algorithm, complexity bound, or procedure is given for identifying such partitions on arbitrary problems or for quantifying the resulting enlargement of the preserved subspace."}],"tokens_in":1380,"tokens_out":452,"duration_ms":20425,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper introduces a local version of the Grover mixer built as a tensor product of subsystem diffusers. It applies when the initial state factors over disjoint qubit groups after encoding only a subset of the constraints. This keeps the evolution inside the subspace fixed by that initial state and avoids the global multi-controlled phase.\n\nThe construction is new relative to the cited GM-QAOA work and directly targets the circuit-depth bottleneck on NISQ hardware. The TSP comparison of subset versus full encoding shows one concrete case where the local mixer plus partial encoding produces markedly smaller circuits at comparable solution quality. The exact-cover simulations are presented as reaching similar convergence behavior.\n\nThe product-structure requirement is load-bearing. The paper gives no general procedure for partitioning constraints so that the initial state remains a clean tensor product without enlarging the subspace too far. If no such partition exists for a given problem, the local replacement does not apply. The abstract also supplies no error bars, statistical tests, or exact circuit counts and parameter settings, so the strength of the “comparable convergence” claim cannot be judged from what is shown.\n\nThis is for researchers already working on constraint-preserving QAOA who need shallower mixers when the initial-state structure cooperates. The full paper would need to supply the missing simulation details and address how often usable partitions exist before it becomes broadly useful. It is worth sending to peer review because the idea is concrete and the limitation is stated clearly rather than hidden.","headline":"Local Grover mixer replaces the global gate only when initial states have product structure from partial constraint encoding.","tokens_in":2299,"tokens_out":355,"would_cite":false,"duration_ms":16690,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Locally acting Grover mixers replace the global multi-controlled phase-shift in GM-QAOA when initial states have a product structure over disjoint qubit subsystems.","keywords":["Grover mixer QAOA","constraint-preserving QAOA","local mixers","exact-cover problem","traveling salesman problem","circuit depth reduction","quantum alternating operator ansatz"],"falsifier":"A simulation on an exact-cover instance in which the local mixer requires substantially more layers than the global mixer to reach equivalent ground-state probability.","tokens_in":2599,"feed_emoji":"","tokens_out":615,"duration_ms":17467,"temperature":0.7,"pith_summary":"The paper proposes locally acting Grover mixers for the Grover mixer quantum alternating operator ansatz to reduce circuit overhead while keeping evolution inside the feasible subspace. These mixers apply only to initial states prepared with a product structure over disjoint subsystems, which arises when only a subset of problem constraints is encoded upfront. The global multi-controlled phase-shift gate is replaced by local operations on those subsystems. Numerical tests on exact-cover and traveling salesman problems show convergence behavior comparable to the original GM-QAOA. The approach also yields more compact circuits when a subset of TSP constraints is used in the initial state rather than all of them.","feed_headline":"Local mixers cut circuit depth in constraint-preserving QAOA","feed_subtitle":"Product-structured initial states let the new mixers match original GM-QAOA performance with fewer gates on exact-cover and TSP.","key_machinery":"Locally acting Grover mixer, which confines the evolution to the feasible subspace using local operations on disjoint qubit subsystems that match the product structure of the initial state.","core_discovery":"The locally acting Grover mixers preserve the feasible subspace defined by the initial state while replacing the global multi-controlled phase-shift gate with local operations on disjoint subsystems, resulting in shallower circuits with fewer gates and comparable convergence on the exact-cover problem and the traveling salesman problem.","pith_inferences":["The technique may extend to other combinatorial problems whose feasible sets allow separable encodings into product states.","Hardware with limited qubit connectivity could see larger practical gains because local gates avoid long-range controls.","Hybrid encodings that move some constraints from the mixer into the initial state might further reduce total gate count across a wider range of problems."],"forward_implications":["Shallower circuits with fewer gates than standard GM-QAOA while staying inside the feasible subspace.","Comparable convergence behavior on exact-cover and traveling salesman problem instances.","More compact circuits at comparable solution quality when only a subset of TSP constraints is encoded in the initial state.","The global multi-controlled phase-shift is eliminated in favor of local operations on the subsystems."],"fun_headline_variants":["Local Grover mixers cut QAOA gate count","Subsystem mixers preserve feasible subspace in QAOA","Local operations replace global gates for GM-QAOA","Product initial states enable compact local mixers"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Initial states must admit a product structure over disjoint qubit subsystems obtained by encoding only a subset of problem constraints.","fun_headline_variants_meta":{"raw":{"variants":["Local Grover mixers cut QAOA gate count","Subsystem mixers preserve feasible subspace in QAOA","Local operations replace global gates for GM-QAOA","Product initial states enable compact local mixers"]},"model":"grok-4.3","cost_usd":0.004594,"raw_usage":{"total_tokens":2263,"prompt_tokens":636,"num_sources_used":0,"completion_tokens":57,"cost_in_usd_ticks":45937000,"prompt_tokens_details":{"text_tokens":636,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1570,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":636,"tokens_out":57,"duration_ms":14084,"temperature":1.0,"reasoning_tokens":1570,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-27T10:00:47.082723+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A simulation on an exact-cover instance in which the local mixer requires substantially more layers than the global mixer to reach equivalent ground-state probability.","supporting_citations":[],"review_version":1}