Pith. sign in

REVIEW 2 major objections 1 minor 31 references

Locally Acting Grover Mixers for Constraint-Preserving QAOA

T0 review · 2 major / 1 minor · reviewed 2026-06-27 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read 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.

desk verdict Local Grover mixer replaces the global gate only when initial states have product structure from partial constraint encoding. read the letter →

arxiv 2606.11530 v1 pith:4AGJYJQE submitted 2026-06-10 quant-ph

Minjin Choi , Dongkeun Lee , Junghee Ryu This is my paper · ORCID
classification quant-ph
keywords GrovermixerQAOAconstraint-preservinglocalmixersexact-coverproblemtravelingsalesmancircuitdepthreductionquantumalternatingoperatoransatz
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

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.

What carries the argument

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.

What would settle it

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.

Watch

Extended reading notes

Core claim

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.

Load-bearing premise

Initial states must admit a product structure over disjoint qubit subsystems obtained by encoding only a subset of problem constraints.

Editorial extensions

If this is right

  • 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.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 1 minor

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.

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 (2)
  1. [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.
  2. [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.
minor comments (1)
  1. [Method section] 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.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive comments. Below we respond point by point to the major comments.

read point-by-point responses

  1. Referee: [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.

    Authors: 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: yes

  2. Referee: [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.

    Authors: 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: no

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: proposal is a direct circuit modification with independent numerical validation.

full rationale

The paper introduces locally acting Grover mixers as an explicit construction that replaces the global multi-controlled phase with tensor-product local operations on subsystems, conditioned on an initial state that admits a product structure. This is presented as a design choice, not derived from a self-referential equation or fitted parameter. Convergence claims rest on numerical simulations for exact-cover and TSP instances, which are external to the definition of the mixer itself. No self-citations are invoked as load-bearing uniqueness theorems, no ansatz is smuggled, and no known result is merely renamed. The initial-state assumption is stated upfront as a prerequisite rather than hidden inside the claimed performance metric.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

Abstract supplies no information on free parameters, background axioms, or new postulated entities; assessment is limited to the summary text.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Locally Acting Grover Mixers for Constraint-Preserving QAOA." pith.science (2026). https://pith.science/paper/4AGJYJQE

@misc{pith2026260611530,
  author       = {Pith},
  title        = {Pith review of: Locally Acting Grover Mixers for Constraint-Preserving QAOA},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4AGJYJQE}},
  note         = {Machine review of arXiv:2606.11530}
}
read the original abstract

The Grover mixer quantum alternating operator ansatz (GM-QAOA) employs the Grover mixer to confine the quantum evolution to the feasible subspace defined by the problem. Its mixing unitary, however, requires a global multi-controlled phase-shift gate acting on all qubits, resulting in substantial circuit overhead on near-term quantum devices. In this work, we propose locally acting Grover mixers tailored to initial states that admit a product structure over disjoint qubit subsystems, which may be obtained by encoding only a subset of problem constraints into the initial state preparation. The proposed method preserves the search space defined by the initial state while significantly lowering implementation cost, as the global multi-controlled phase-shift gate is replaced with local operations on disjoint subsystems. Numerical simulations on the exact-cover problem and the traveling salesman problem (TSP) demonstrate that the proposed method achieves convergence behavior comparable to that of the original GM-QAOA, while using shallower circuits with fewer gates. We further compare two constraint encoding strategies for the TSP, encoding only a subset of constraints versus all constraints into the initial state preparation, and show that the former combined with the proposed mixer yields markedly more compact circuits at the point where comparable solution quality is achieved.

Figures

Figures reproduced from arXiv: 2606.11530 by the authors.

Figure 1
Figure 1. FIG. 1: Schematic illustration of GM-QAOA. The circuit begins [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: Circuit illustration of the product-structured variant of the [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3: Solution probability as a function of the number of layers [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: FIG. 4: Solution probability as a function of the number of layers [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5: Resource trade-o [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: FIG. 6: State preparation circuits for the four-city TSP instance (nine qubits) with (a) full constraint encoding ( [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 5 canonical work pages

  1. [1]

    The initial state thus has a product structure over three dis- joint subsets of qubits with sizes 3, 2, and 2

    The state|W µ⟩can be prepared using a circuit with gate count and depth linear inµ[20, 26]. The initial state thus has a product structure over three dis- joint subsets of qubits with sizes 3, 2, and 2. Accordingly, in the proposed method, the mixing unitary is decomposed into three local operations, each acting independently on one qubit subset. This res...

  2. [2]

    Each instance corresponds to a different set of city locations, as illustrated in the insets of Figure 4

    Convergence Behavior and Resource Trade-offs We evaluate the proposed method on three instances of the four-city TSP, which require nine qubits under the above for- mulation. Each instance corresponds to a different set of city locations, as illustrated in the insets of Figure 4. The simu- lation settings are the same as in Section III A. As shown in Figu...

  3. [3]

    ) 𝑋 𝐻𝐻𝐻 (a) |0⟩|0⟩|0⟩|0⟩|0⟩|0⟩|0⟩|0⟩|0⟩𝑋 𝑋 𝑋 𝑅𝑌(𝜏!) 𝑅𝑌(𝜏!) 𝑅𝑌(𝜏!) 𝑅𝑌(𝜏

    Comparison Between Partial and Full Constraint Encodings One might expect that incorporating both constraintsP 1 andP 2 into the initial state preparation is preferable, as this reduces the effective search space fromn n ton!. Reducing the search space in this way can lower the number of layers prequired to achieve a high solution probability. However, pr...

  4. [4]

    L. K. Grover, inProceedings of the twenty-eighth annual ACM symposium on Theory of computing(1996), pp. 212–219

    1996

  5. [5]

    W. P. Baritompa, D. W. Bulger, and G. R. Wood, SIAM Journal on Optimization15, 1170 (2005)

    2005

  6. [6]

    Gilliam, S

    A. Gilliam, S. Woerner, and C. Gonciulea, Quantum5, 428 (2021)

    2021

  7. [7]

    Preskill, Quantum2, 79 (2018)

    J. Preskill, Quantum2, 79 (2018)

    2018

  8. [8]

    Cerezo, A

    M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, et al., Nature Reviews Physics3, 625 (2021)

    2021

Show all 31 references
  1. [9]

    Farhi, J

    E. Farhi, J. Goldstone, and S. Gutmann, arXiv preprint arXiv:1411.4028 (2014)

    2014 arXiv

  2. [10]

    Hadfield, Z

    S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Ven- turelli, and R. Biswas, Algorithms12, 34 (2019)

    2019

  3. [11]

    Z. Wang, N. C. Rubin, J. M. Dominy, and E. G. Rieffel, Physical Review A101, 012320 (2020)

    2020

  4. [12]

    F. G. Fuchs, K. O. Lye, H. Møll Nilsen, A. J. Stasik, and G. Sar- tor, Algorithms15, 202 (2022)

    2022

  5. [13]

    B ¨artschi and S

    A. B ¨artschi and S. Eidenbenz, in2020 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2020), pp. 72–82

    2020

  6. [14]

    N. Xie, X. Lee, D. Cai, Y . Saito, N. Asai, and H. C. Lau, Quan- tum Information Processing23, 291 (2024)

    2024

  7. [15]

    Zhang, R

    Z. Zhang, R. Paredes, B. Sundar, D. Quiroga, A. Kyrillidis, L. Duenas-Osorio, G. Pagano, and K. R. Hazzard, Quantum Science and Technology10, 015022 (2025)

    2025

  8. [16]

    Seo and J

    Y . Seo and J. Heo, Journal of Communications and Networks 27, 222 (2025)

    2025

  9. [17]

    Drapeau, S

    J. Drapeau, S. Banerjee, and S. Kourtis, Quantum Science and Technology11, 025037 (2026)

    2026

  10. [18]

    Golden, A

    J. Golden, A. B ¨artschi, D. O’Malley, and S. Eidenbenz, in2021 IEEE International Conference on Quantum Computing and Engineering (QCE)(IEEE, 2021), pp. 137–147

    2021

  11. [19]

    J. E. Kim and Y . Wang, IEEE Transactions on Quantum Engi- neering4, 1 (2023)

    2023

  12. [20]

    G. A. Bridi and F. d. L. Marquezino, Physical Review A110, 052409 (2024)

    2024

  13. [21]

    N. Xie, J. Xu, T. Chen, X. Lee, Y . Saito, N. Asai, and D. Cai, Physical Review A111, 012401 (2025)

    2025

  14. [22]

    Tsvelikhovskiy, M

    B. Tsvelikhovskiy, M. Nuyten, and B. N. Bakalov, arXiv preprint arXiv:2509.10424 (2025)

    2025

  15. [23]

    B ¨artschi and S

    A. B ¨artschi and S. Eidenbenz, inInternational Symposium on Fundamentals of Computation Theory(Springer, 2019), pp. 126–139

    2019

  16. [24]

    B ¨artschi and S

    A. B ¨artschi and S. Eidenbenz, arXiv preprint arXiv:2207.09998 (2022)

    2022

  17. [25]

    Barenco, C

    A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Mar- golus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Phys- ical review A52, 3457 (1995)

    1995

  18. [26]

    M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information(Cambridge university press, 2010)

    2010

  19. [27]

    Claudon, J

    B. Claudon, J. Zylberman, C. Feniou, F. Debbasch, A. Peruzzo, and J.-P. Piquemal, Nature Communications15, 5886 (2024)

    2024

  20. [28]

    Zindorf and S

    B. Zindorf and S. Bose, Physical Review Applied24, 044030 (2025)

    2025

  21. [29]

    E. Bae, J. Shin, and M. Choi, arXiv preprint arXiv:2601.17725 (2026)

    2026

  22. [30]

    Bergholm, J

    V . Bergholm, J. Izaac, M. Schuld, C. Gogolin, S. Ahmed, V . Ajith, M. S. Alam, G. Alonso-Linaje, B. AkashNarayanan, A. Asadi, et al., arXiv preprint arXiv:1811.04968 (2018)

    2018 arXiv

  23. [31]

    D. C. Liu and J. Nocedal, Mathematical programming45, 503 (1989)

    1989

Pith tools

Reviewed June 27, 2026 · model on record in the stance chip above.