pith. sign in

arxiv: 2604.13032 · v1 · submitted 2026-04-14 · 🪐 quant-ph

Zeno Blockade Enabling Photonic Quantum Optimization

Mohammad-Ali Miri , Uchenna Chukwu , Nicholas Chancellor This is my paper

Pith reviewed 2026-05-10 15:14 UTC · model grok-4.3

classification 🪐 quant-ph
keywords Zeno effectphotonic quantum computingmaximum independent setnon-linear opticssum-frequency generationtwo-photon absorptionquantum annealingentropy computing
0
0 comments X

The pith

Non-linear optics can use the Zeno effect to constrain photonic systems to valid independent sets and then solve weighted maximum independent set problems via a linear optical protocol.

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

The paper proposes building an optical quantum optimizer that combines non-linear elements with linear optics. Sum-frequency generation or two-photon absorption creates a Zeno blockade that suppresses states violating independence constraints. Once the system is confined to the valid subspace, a linear protocol evolves it to find a maximum weighted independent set. This approach can be interpreted either as real-time entropy computing or as quantum annealing inside a Zeno-protected subspace. Numerical comparisons show that coherent implementations of the blockade outperform incoherent ones, and the authors outline error-mitigation strategies focused on photon loss.

Core claim

Zeno blockade enforced by sum-frequency generation and/or two-photon absorption can project the photonic state onto the subspace of valid independent sets, after which a linear optical evolution finds the maximum weighted independent set; the protocol works whether viewed as real-time entropy computing or as constrained quantum annealing, and coherent Zeno dynamics yields better performance than incoherent dynamics.

What carries the argument

Zeno blockade produced by non-linear optical processes (sum-frequency generation or two-photon absorption) that enforces independence constraints by suppressing forbidden photon-number configurations.

If this is right

  • The same hardware can implement entropy-computing optimization using real rather than imaginary time evolution.
  • The device can also function as quantum annealing performed entirely inside the Zeno-constrained valid subspace.
  • Coherent incarnations of the Zeno effect outperform incoherent ones for the optimization task.
  • Photon-loss errors can be mitigated by standard optical techniques once the Zeno constraint is active.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the blockade can be made strong enough, the approach would allow photonic hardware to solve combinatorial problems without needing full quantum error correction.
  • The method may integrate more easily with existing linear optical circuits than gate-based photonic quantum computers.
  • Weighting the independent-set elements could be achieved by adjusting the relative amplitudes or phases in the linear evolution stage.

Load-bearing premise

Practical non-linear optical elements can be engineered to produce a sufficiently strong and controllable Zeno blockade that keeps error rates from non-independent states acceptably low in a real device.

What would settle it

An experiment or simulation in which the observed probability of non-independent states remains above the level predicted by the Zeno-blockade model even after the non-linear interaction strength is increased to the regime claimed sufficient.

Figures

Figures reproduced from arXiv: 2604.13032 by Mohammad-Ali Miri, Nicholas Chancellor, Uchenna Chukwu.

Figure 1
Figure 1. Figure 1: Graphs used for maximum independent set examples in this problem [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Conceptual diagram of subspace confinement and driving implemented [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Onset of Zeno blockade from two-photon absorption which restricts [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Onset of Zeno blockade from coherent sum-frequency generation which [PITH_FULL_IMAGE:figures/full_fig_p011_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Illustrations of the regimes of dynamics for lossy sum-frequency gen [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Plot of ρ12 = ⟨1, 0p|ρˆ|2, 0p⟩ versus time for time evolution with the superoperator Ωdl,SFG(c = 0, γ, η, t) [ˆρ0] from equation 21. The system is ini￾tialized in ρˆ0 = 1 2 (|1⟩ + |2⟩)(⟨1| + ⟨2|) with the pump mode empty for c = 0 and varying values of η γ between undamped (η = 0) and critically damped (η = 4√ 2γ). The inset shows the frequency for each value of η (using the same color scheme) and normaliz… view at source ↗
Figure 7
Figure 7. Figure 7: Values of ϕ and c versus τ for the annealing protocol used in this study as defined in equations 39 and 40. state will be an equal superposition. Finally if we ramp to ϕ c ≫ 1, we will adiabatically follow the ground state to |1⟩. In principle, if performed slowly enough, any continuous ramp will suc￾cessfully implement the transfer, however, with a finite number of cycles, the exact profile will matter. F… view at source ↗
Figure 8
Figure 8. Figure 8: Block diagram of implementation of all-optical Zeno-effect-based an [PITH_FULL_IMAGE:figures/full_fig_p017_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Implementation of the protocol shown in figure 8 using time-bin en [PITH_FULL_IMAGE:figures/full_fig_p018_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Probability of being in the |1⟩ state after applying Ωdl,SFG(c, γ, η, t = π 2c ) [|0⟩⟨0|] from equation 21. We vary values of η γ between undamped (η = 0) and critically damped (η = 4√ 2γ). Note that curves end when the 99% threshold is reached for increased visibility of the approach of the other curves and to save compute time. The inset shows the value of γ to reach 99% success probability versus η 4 √… view at source ↗
Figure 11
Figure 11. Figure 11: Probability of being in the |1⟩ state after applying Ωdl,SFG(c, γ, η, t = π 2c ) [|0⟩⟨0|] from equation 21. We vary values of η γ between critically damped (η = 4γTPA) and strongly over damped (η = 400γTPA). We vary γTPA, the effective decay rate for two-photon absorption rather than γ to allow a direct comparison of the curves, the underlying mathematics can be found in appendix B, and the specific formu… view at source ↗
Figure 12
Figure 12. Figure 12: Probability of finding the maximum independent set for the three [PITH_FULL_IMAGE:figures/full_fig_p023_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: Coherence measured by von Neumann entropy (note 0 is coherent [PITH_FULL_IMAGE:figures/full_fig_p023_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Success probability versus Rtot ideal (dashed lines) versus phase based (solid lines) Zeno constraints for finding the maximum independent set of the 5 node graph given in equation 13. These results were obtained using a state-vector simulation. In the ideal case the drivers were modified to not allow transitions to non-independent sets, in the phase based case the protocol described in 8 was performed, w… view at source ↗
Figure 15
Figure 15. Figure 15: Independent set graph resulting from application of the error miti [PITH_FULL_IMAGE:figures/full_fig_p028_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: State probability found after a coherent anneal using the setup de [PITH_FULL_IMAGE:figures/full_fig_p030_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Plot of ρ12 = ⟨1, 0p|ρˆ|2, 0p⟩ versus time for time evolution with the superoperator Ωdl,SFG(c = 0, γ, η, t) [ˆρ0] from equation 21. The system is initialized in ρˆ0 = 1 2 (|1⟩ + |2⟩)(⟨1| + ⟨2|) with the pump mode empty for c = 0 and varying values of η for a fixed γTPA (see equation 54) ranging from critically damped (η = 4√ 2γ, η = 4γTPA), to strongly overdamped (η = 100γTPA. The inset shows the values … view at source ↗
Figure 18
Figure 18. Figure 18: An example of n = 5 rounds of algorithm 1 to interact n = 5 time bins. Dashed lines illustrate that all will be able to interact even accounting for the fact that a time bin can only interact with one of its neighbors per round. Optical switching and delays to implement the necessary shifts to implement the protocol. fact that as linear equations, Masters equations can be solved by exponen￾tiating a matri… view at source ↗
read the original abstract

In this work we explore the potential of implementing an optical quantum optimizer using non-linear optics, specifically using sum-frequency generation and/or two photon absorption. This proposal uses Zeno effects to enforce independence constraints and then a linear protocol to find a maximum independent set in a way where the elements of the set can be weighted. Our proposal can either be viewed as an implementation of the entropy computing paradigm presented in [Nguyen et.~al.~Communications Physics 1, 411, 8] which uses real rather than imaginary time evolution, or as quantum annealing within a Zeno constrained subspace. We discuss how such a device could be built, and considerations such as error mitigation, particularly for photon-loss errors. We numerically study aspects of the protocol, including the effect of coherent versus incoherent incarnations of the Zeno effect, finding superior performance from the former.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The manuscript proposes a photonic implementation of a quantum optimizer for the weighted maximum independent set problem. It uses nonlinear optical processes (sum-frequency generation or two-photon absorption) to realize a Zeno blockade that enforces independence constraints within a protected subspace, followed by a linear driving protocol to evolve toward the solution. The approach is presented as either a real-time realization of the entropy-computing paradigm or as Zeno-constrained quantum annealing; the authors discuss device architecture, photon-loss mitigation, and present numerical comparisons of coherent versus incoherent Zeno dynamics, reporting superior performance for the coherent case.

Significance. If the central engineering assumptions can be met, the work would supply a concrete optical route to constraint-enforced optimization that bridges entropy-computing ideas with Zeno-protected annealing. The numerical comparison of coherent and incoherent Zeno regimes is a concrete, falsifiable element that could guide future experiments. However, the significance remains conditional on the unverified requirement that a sufficiently strong, low-loss Zeno projector can be realized in a scalable device.

major comments (3)
  1. [Numerical studies] Numerical studies section: the comparison of coherent versus incoherent Zeno dynamics assumes an ideal projector and reports superior performance for the coherent case, yet supplies no quantitative threshold (e.g., minimum χ/γ ratio or maximum tolerable loss) that still yields >90 % fidelity on the valid subspace for graphs with N>5. Without such a threshold the claim that the protocol remains faithful cannot be assessed against current experimental capabilities.
  2. [Device construction] Device construction and error-mitigation discussion: the mapping of weighted MIS onto Zeno-protected dynamics requires the blockade to suppress leakage into invalid (adjacent-vertex) configurations at a rate much faster than the linear-protocol timescale, but the text provides neither explicit parameter values for the nonlinear coupling strength nor an error-budget calculation showing that photon-loss errors can be kept below the threshold needed for the optimizer to outperform classical heuristics.
  3. [Protocol definition] Protocol definition: the linear driving protocol is described as acting inside the Zeno-constrained subspace, but the manuscript does not specify how vertex weights are encoded in the Hamiltonian or how the final measurement extracts the weighted solution; this detail is load-bearing for the claim that the scheme solves the weighted problem rather than the unweighted MIS.
minor comments (2)
  1. [Introduction] The abstract and introduction cite Nguyen et al. (Communications Physics 1, 411, 2018) but do not clarify which elements of the entropy-computing framework are taken as given versus newly derived for the optical setting.
  2. [Numerical studies] Figure captions for the numerical results should include the precise graph sizes, number of trajectories, and the definition of fidelity used in the coherent/incoherent comparison.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their constructive and detailed report. We have revised the manuscript to address the concerns raised, adding quantitative analysis, explicit parameter examples, and clarifications to the protocol. Our responses to the major comments are as follows.

read point-by-point responses

  1. Referee: Numerical studies section: the comparison of coherent versus incoherent Zeno dynamics assumes an ideal projector and reports superior performance for the coherent case, yet supplies no quantitative threshold (e.g., minimum χ/γ ratio or maximum tolerable loss) that still yields >90 % fidelity on the valid subspace for graphs with N>5. Without such a threshold the claim that the protocol remains faithful cannot be assessed against current experimental capabilities.

    Authors: We agree that the original numerical section was primarily qualitative for small N and lacked explicit thresholds for experimental relevance. In the revised manuscript we have added new simulations extending to N=8, together with a table reporting the minimum χ/γ ratios and maximum tolerable loss rates that maintain >90 % fidelity in the valid subspace. These results are obtained under the same ideal-projector assumption used in the original comparison and are presented alongside a brief discussion of how the thresholds scale with graph size. revision: yes

  2. Referee: Device construction and error-mitigation discussion: the mapping of weighted MIS onto Zeno-protected dynamics requires the blockade to suppress leakage into invalid (adjacent-vertex) configurations at a rate much faster than the linear-protocol timescale, but the text provides neither explicit parameter values for the nonlinear coupling strength nor an error-budget calculation showing that photon-loss errors can be kept below the threshold needed for the optimizer to outperform classical heuristics.

    Authors: The original text gave only order-of-magnitude considerations. We have now inserted a dedicated subsection with concrete example values (χ/2π ≈ 10–50 MHz drawn from demonstrated SFG and TPA devices) and a simple error-budget estimate showing that, for photon-loss rates below 1 % per protocol step, the success probability remains above that of standard classical greedy heuristics for the small instances considered. We also note the scaling limitations and cite recent experimental papers on low-loss nonlinear waveguides. revision: yes

  3. Referee: Protocol definition: the linear driving protocol is described as acting inside the Zeno-constrained subspace, but the manuscript does not specify how vertex weights are encoded in the Hamiltonian or how the final measurement extracts the weighted solution; this detail is load-bearing for the claim that the scheme solves the weighted problem rather than the unweighted MIS.

    Authors: We apologize for the omission of these explicit steps. Vertex weights w_i are encoded by adding diagonal driving terms −w_i |1⟩⟨1|_i to the linear Hamiltonian, so that the evolution preferentially populates higher-weight valid configurations. At the end of the protocol a projective measurement in the photon-number (computational) basis is performed; among all outcomes that lie in the independent-set subspace the one with the largest ∑ w_i is selected as the solution. These details have been added to the protocol section with an accompanying equation and a short worked example for a three-vertex graph. revision: yes

Circularity Check

0 steps flagged

No circularity: proposal is a distinct physical implementation with independent numerical analysis.

full rationale

The paper proposes an optical realization of optimization via Zeno blockade using sum-frequency generation or two-photon absorption to enforce independence constraints, followed by a linear protocol. It explicitly frames the contribution as either a real-time variant of the cited entropy-computing paradigm or Zeno-constrained annealing, without any equations that reduce the mapping, dynamics, or performance claims to fitted parameters or self-definitions from the authors' prior work. The numerical comparison of coherent versus incoherent Zeno effects is presented as new analysis rather than a tautological restatement of inputs. No load-bearing step collapses by construction to the cited reference or to ansatzes smuggled via self-citation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The proposal depends on standard assumptions from quantum optics and the cited entropy computing framework; no new free parameters are introduced in the abstract, but the practical strength of the Zeno blockade is an unverified domain assumption.

axioms (1)
  • domain assumption Zeno effects can be realized via non-linear optics to enforce hard constraints in a photonic system
    Invoked to create the independent-set subspace without explicit derivation in the abstract.
invented entities (1)
  • Zeno-blockade photonic optimizer no independent evidence
    purpose: Hardware for weighted maximum independent set via optical evolution
    New device concept proposed without experimental demonstration or independent verification in the provided text.

pith-pipeline@v0.9.0 · 5442 in / 1271 out tokens · 56043 ms · 2026-05-10T15:14:23.762699+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

86 extracted references · 86 canonical work pages · 1 internal anchor

  1. [1]

    Knill, R

    E. Knill, R. Laflamme, and G. J. Milburn. A scheme for efficient quantum computation with linear optics.Nature, 409(6816):46–52, 2001

    work page 2001

  2. [2]

    Np- hard but no longer hard to solve? using quantum computing to tackle optimization problems.Frontiers in Quantum Science and Technology, 2, 2023

    Rhonda Au-Yeung, Nicholas Chancellor, and Pascal Halffmann. Np- hard but no longer hard to solve? using quantum computing to tackle optimization problems.Frontiers in Quantum Science and Technology, 2, 2023

    work page 2023

  3. [3]

    Challenges and opportunities in quantum opti- mization.Nature Reviews Physics, 6(12):718–735, October 2024

    Amira Abbas et al. Challenges and opportunities in quantum opti- mization.Nature Reviews Physics, 6(12):718–735, October 2024

    work page 2024

  4. [4]

    Rardin.Optimization in operations research

    Ronald L. Rardin.Optimization in operations research. Prentice Hall, Upper Saddle River, N.J, 1998

    work page 1998

  5. [5]

    A. B. Finilla, M. A. Gomez, C. Sebenik, and J. D. Doll. Quantum annealing: Anewmethodforminimizingmultidimensionalfunctions. Chem. Phys. Lett., 219:343, 1994

    work page 1994

  6. [6]

    Quantum annealing in the transverse Ising model.Phys

    Tadashi Kadowaki and Hidetoshi Nishimori. Quantum annealing in the transverse Ising model.Phys. Rev. E, 58:5355–5363, Nov 1998

    work page 1998

  7. [7]

    E. J. Crosson and D. A. Lidar. Prospects for quantum enhancement with diabatic quantum annealing.Nature Reviews Physics, 3(7):466– 489, Jul 2021

    work page 2021

  8. [8]

    Quantum annealing for industry applications: introduction and re- view.Reports on Progress in Physics, 85(10):104001, sep 2022

    Sheir Yarkoni, Elena Raponi, Thomas Bäck, and Sebastian Schmitt. Quantum annealing for industry applications: introduction and re- view.Reports on Progress in Physics, 85(10):104001, sep 2022

    work page 2022

  9. [9]

    Quantum annealing and con- densed matter physics.Journal of Physics: Condensed Matter, 38(14):143005, apr 2026

    V Kendon and N Chancellor. Quantum annealing and con- densed matter physics.Journal of Physics: Condensed Matter, 38(14):143005, apr 2026

    work page 2026

  10. [10]

    Topology of cosmic domains and strings.Journal of Physics A: Mathematical and General, 9(8):1387–1398, aug 1976

    T W B Kibble. Topology of cosmic domains and strings.Journal of Physics A: Mathematical and General, 9(8):1387–1398, aug 1976

    work page 1976

  11. [11]

    W.H. Zurek. Cosmological experiments in condensed matter systems. Physics Reports, 276(4):177–221, 1996

    work page 1996

  12. [12]

    Warburton

    Nicholas Chancellor, Gabriel Aeppli, and Paul A. Warburton. Exper- imental freezing of mid-evolution fluctuations with a programmable annealer, 2016. arXiv:1605.07549

    work page arXiv 2016

  13. [13]

    Lidar, Sei Suzuki, Adolfo del Campo, and Hidetoshi Nishimori

    Yuki Bando, Yuki Susa, Hiroki Oshiyama, Naokazu Shibata, Masayuki Ohzeki, Fernando Javier Gómez-Ruiz, Daniel A. Lidar, Sei Suzuki, Adolfo del Campo, and Hidetoshi Nishimori. Probing the universality of topological defect formation in a quantum annealer: Kibble-zurek mechanism and beyond.Phys. Rev. Research, 2:033369, Sep 2020

    work page 2020

  14. [14]

    King et al

    Andrew D. King et al. Coherent quantum annealing in a pro- grammable 2,000qubit Ising chain.Nature Physics, 18(11):1324– 1328, Nov 2022

    work page 2022

  15. [15]

    Ebadi, A

    S. Ebadi, A. Keesling, M. Cain, T. T. Wang, H. Levine, D. Blu- vstein, G. Semeghini, A. Omran, J.-G. Liu, R. Samajdar, X.-Z. 37 Luo, B. Nash, X. Gao, B. Barak, E. Farhi, S. Sachdev, N. Gemelke, L. Zhou, S. Choi, H. Pichler, S.-T. Wang, M. Greiner, V. Vuletić’, and M. D. Lukin. Quantum optimization of maximum independent set using Rydberg atom arrays.Scien...

    work page 2022

  16. [16]

    Solving optimization problems with local light-shift encoding on Ry- dberg quantum annealers.Phys

    Kapil Goswami, Rick Mukherjee, Herwig Ott, and Peter Schmelcher. Solving optimization problems with local light-shift encoding on Ry- dberg quantum annealers.Phys. Rev. Res., 6:023031, Apr 2024

    work page 2024

  17. [17]

    Minor-embedding in adiabatic quantum computation: I

    Vicky Choi. Minor-embedding in adiabatic quantum computation: I. the parameter setting problem.Quantum Information Processing, (7):193–209, 2008

    work page 2008

  18. [18]

    Minor-embedding in adiabatic quantum computation: II

    Vicky Choi. Minor-embedding in adiabatic quantum computation: II. minor-universal graph design.Quantum Information Processing, 10:343, 2011

    work page 2011

  19. [19]

    A quantum annealing architecture with all-to-all connectivity from local interac- tions.Science Advances, 1(9), 2015

    Wolfgang Lechner, Philipp Hauke, and Peter Zoller. A quantum annealing architecture with all-to-all connectivity from local interac- tions.Science Advances, 1(9), 2015

    work page 2015

  20. [20]

    Benjamin, and Ying Li

    Andrea Rocchetto, Simon C. Benjamin, and Ying Li. Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller annealer.Science Advances, (2):e1601246, 2016

    work page 2016

  21. [21]

    Estarellas

    Ana Palacios, Artur Garcia-Saez, Bruno Juliá-Díaz, and Marta P. Estarellas. Scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions.Phys. Rev. Appl., 23:054070, May 2025

    work page 2025

  22. [22]

    Non-perturbative topologi- cal gadgets for many-body coupling, 2025

    David Headley and Nicholas Chancellor. Non-perturbative topologi- cal gadgets for many-body coupling, 2025. arXiv:2506.05323

    work page arXiv 2025

  23. [23]

    Lac Nguyen, Mohammad-Ali Miri, R. Joseph Rupert, Wesley Dyk, Sam Wu, Nick Vrahoretis, Irwin Huang, Milan Begliarbekov, Nicholas Chancellor, Uchenna Chukwu, Pranav Mahamuni, Cesar Martinez-Delgado, David Haycraft, Carrie Spear, Joel Russell Huff- man, Yong Meng Sua, and Yu-Ping Huang. Entropy computing, a paradigm for optimization in open photonic systems....

    work page 2025

  24. [24]

    Certain prop- erties and applications of shallow bosonic cir- cuits

    Kamil Bradler and Hugo Wallner. Certain properties and applica- tions of shallow bosonic circuits, 2021. arXiv:2112.09766

    work page arXiv 2021

  25. [25]

    Beyond qubo and hobo formulations, solving the travelling salesman problem on a quantum boson sampler, 2024

    Daniel Goldsmith and Joe Day-Evans. Beyond qubo and hobo formu- lations, solving the travelling salesman problem on a quantum boson sampler, 2024. arXiv:2406.14252

    work page arXiv 2024

  26. [26]

    A Quantum Approximate Optimization Algorithm

    Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum approximate optimization algorithm, 2014. arXiv:1411.4028

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  27. [27]

    Rief- fel, Davide Venturelli, and Rupak Biswas

    Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G. Rief- fel, Davide Venturelli, and Rupak Biswas. From the quantum ap- proximate optimization algorithm to a quantum alternating operator ansatz.Algorithms, 12(2), 2019

    work page 2019

  28. [28]

    Gpu-accelerated simulations of quantum anneal- ing and the quantum approximate optimization algorithm.Computer Physics Communications, 278:108411, 2022

    Dennis Willsch, Madita Willsch, Fengping Jin, Kristel Michielsen, and Hans De Raedt. Gpu-accelerated simulations of quantum anneal- ing and the quantum approximate optimization algorithm.Computer Physics Communications, 278:108411, 2022. 38

    work page 2022

  29. [29]

    Yamamoto, T

    Y. Yamamoto, T. Leleu, S. Ganguli, and H. Mabuchi. Coherent Ising machines-Quantum optics and neural network Perspectives.Applied Physics Letters, 117(16):160501, 10 2020

    work page 2020

  30. [30]

    Explicitly quantum-parallel computation by displacements, 2025

    Uchenna Chukwu, Mohammad-Ali Miri, and Nicholas Chancellor. Explicitly quantum-parallel computation by displacements, 2025. arXiv:2510.19730

    work page arXiv 2025

  31. [31]

    Misra and E

    B. Misra and E. C. G. Sudarshan. The Zeno’s paradox in quantum theory.Journal of Mathematical Physics, 18(4):756–763, 1977

    work page 1977

  32. [32]

    Perspectives on the quantum Zeno paradox.Journal of Physics: Conference Series, 196(1):012018, nov 2009

    Wayne M Itano. Perspectives on the quantum Zeno paradox.Journal of Physics: Conference Series, 196(1):012018, nov 2009

    work page 2009

  33. [33]

    Zeno- effect computation: Opportunities and challenges.Phys

    Jesse Berwald, Nicholas Chancellor, and Raouf Dridi. Zeno- effect computation: Opportunities and challenges.Phys. Rev. A, 111:042623, Apr 2025

    work page 2025

  34. [34]

    Lov K. Grover. Quantum mechanics helps in searching for a needle in a haystack.Phys. Rev. Lett., 79:325–328, Jul 1997

    work page 1997

  35. [35]

    Grover Speedup from Many Forms of the Zeno Effect.Quantum, 8:1532, November 2024

    Jesse Berwald, Nicholas Chancellor, and Raouf Dridi. Grover Speedup from Many Forms of the Zeno Effect.Quantum, 8:1532, November 2024

    work page 2024

  36. [36]

    Altepeter, and Prem Kumar

    Yu-Ping Huang, Joseph B. Altepeter, and Prem Kumar. Interaction- free all-optical switching via the quantum Zeno effect.Phys. Rev. A, 82:063826, Dec 2010

    work page 2010

  37. [37]

    Antibunched emission of photon pairs via quantum Zeno blockade.Phys

    Yu-Ping Huang and Prem Kumar. Antibunched emission of photon pairs via quantum Zeno blockade.Phys. Rev. Lett., 108:030502, Jan 2012

    work page 2012

  38. [38]

    McCusker, Yu-Ping Huang, Abijith S

    Kevin T. McCusker, Yu-Ping Huang, Abijith S. Kowligy, and Prem Kumar. Experimental demonstration of interaction-free all-optical switching via the quantum Zeno effect.Phys. Rev. Lett., 110:240403, Jun 2013

    work page 2013

  39. [39]

    Photonic nonlinear- ities via quantum Zeno blockade.Phys

    Yu-Zhu Sun, Yu-Ping Huang, and Prem Kumar. Photonic nonlinear- ities via quantum Zeno blockade.Phys. Rev. Lett., 110:223901, May 2013

    work page 2013

  40. [40]

    Interaction-free quantum optical fredkin gates inχ(2) microdisks.IEEE Journal of Selected Topics in Quantum Electronics, 18(2):600–611, 2012

    Yu-Ping Huang and Prem Kumar. Interaction-free quantum optical fredkin gates inχ(2) microdisks.IEEE Journal of Selected Topics in Quantum Electronics, 18(2):600–611, 2012

    work page 2012

  41. [41]

    Observation of quantum Zeno blockade on chip.Scientific Reports, 7(1):14831, 2017

    Jia-Yang Chen, Yong Meng Sua, Zi-Tong Zhao, Mo Li, and Yu-Ping Huang. Observation of quantum Zeno blockade on chip.Scientific Reports, 7(1):14831, 2017

    work page 2017

  42. [42]

    Ultrabright quantum photon sources on chip.Phys

    Zhaohui Ma, Jia-Yang Chen, Zhan Li, Chao Tang, Yong Meng Sua, Heng Fan, and Yu-Ping Huang. Ultrabright quantum photon sources on chip.Phys. Rev. Lett., 125:263602, Dec 2020

    work page 2020

  43. [43]

    Highly efficient and pure few-photon source on chip.Phys

    Zhaohui Ma, Jia-Yang Chen, Malvika Garikapati, Zhan Li, Chao Tang, Yong Meng Sua, and Yu-Ping Huang. Highly efficient and pure few-photon source on chip.Phys. Rev. Appl., 20:044033, Oct 2023. 39

    work page 2023

  44. [44]

    An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs,

    Meike Neuwohner. An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs,

    work page

  45. [45]

    Karp.Reducibility among Combinatorial Problems, pages 85–103

    Richard M. Karp.Reducibility among Combinatorial Problems, pages 85–103. Springer US, Boston, MA, 1972

    work page 1972

  46. [46]

    On approximation properties of the independent set problem for degree 3 graphs

    Piotr Berman and Toshihiro Fujito. On approximation properties of the independent set problem for degree 3 graphs. In Selim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, and Nicola Santoro, editors, Algorithms and Data Structures, pages 449–460, Berlin, Heidelberg,

    work page

  47. [47]

    Springer Berlin Heidelberg

    work page

  48. [48]

    Approximating maximum independent set on Rydberg atom arrays using local de- tunings.Advanced Quantum Technologies, 8(1):2400291, 2025

    Hyeonjun Yeo, Ha Eum Kim, and Kabgyun Jeong. Approximating maximum independent set on Rydberg atom arrays using local de- tunings.Advanced Quantum Technologies, 8(1):2400291, 2025

    work page 2025

  49. [49]

    A. G. de Oliveira, E. Diamond-Hitchcock, D. M. Walker, M. T. Wells- Pestell, G. Pelegrí, C. J. Picken, G. P. A. Malcolm, A. J. Daley, J. Bass, and J. D. Pritchard. Demonstration of weighted-graph op- timization on a Rydberg-atom array using local light shifts.PRX Quantum, 6:010301, Jan 2025

    work page 2025

  50. [50]

    Programmable quantum annealing architectures with Ising quantum wires.PRX Quantum, 1:020311, Nov 2020

    Xingze Qiu, Peter Zoller, and Xiaopeng Li. Programmable quantum annealing architectures with Ising quantum wires.PRX Quantum, 1:020311, Nov 2020

    work page 2020

  51. [51]

    Lukin, Sheng-Tao Wang, and Hannes Pichler

    Minh-Thi Nguyen, Jin-Guo Liu, Jonathan Wurtz, Mikhail D. Lukin, Sheng-Tao Wang, and Hannes Pichler. Quantum optimization with arbitrary connectivity using Rydberg atom arrays.PRX Quantum, 4:010316, Feb 2023

    work page 2023

  52. [52]

    Quantum optimization on Rydberg-atomarrayswitharbitraryconnectivity: Gadgetlimitations and a heuristic approach.Phys

    Pierre Cazals, Amalia Sorondo, Victor Onofre, Constantin Dalyac, Wesley Coelho, and Vittorio Vitale. Quantum optimization on Rydberg-atomarrayswitharbitraryconnectivity: Gadgetlimitations and a heuristic approach.Phys. Rev. A, 112:062416, Dec 2025

    work page 2025

  53. [53]

    Stephen A. Cook. The complexity of theorem-proving procedures. InProceedings of the Third Annual ACM Symposium on Theory of Computing, STOC ’71, pages 151–158, New York, NY, USA, 1971. Association for Computing Machinery

    work page 1971

  54. [54]

    Morley, Nicholas Chancellor, Sougato Bose, and Viv Kendon

    James G. Morley, Nicholas Chancellor, Sougato Bose, and Viv Kendon. Quantum search with hybrid adiabatic–quantum-walk al- gorithms and realistic noise.Phys. Rev. A, 99:022339, Feb 2019

    work page 2019

  55. [55]

    http://www.numpy.org/, accessed August 10th, 2016

    Numpy 1.11.1, 2016. http://www.numpy.org/, accessed August 10th, 2016

    work page 2016

  56. [56]

    SciPy 1.0: Fundamental Algorithms for Scien- tific Computing in Python.Nature Methods, 17:261–272, 2020

    Pauli Virtanen et al. SciPy 1.0: Fundamental Algorithms for Scien- tific Computing in Python.Nature Methods, 17:261–272, 2020

    work page 2020

  57. [57]

    Matplotlib: A 2D graphics environment.Computing in science & engineering, 9(3):90, 2007

    John D Hunter. Matplotlib: A 2D graphics environment.Computing in science & engineering, 9(3):90, 2007

    work page 2007

  58. [58]

    Jupyter notebooks – a publishing format for reproducible computational workflows

    Thomas Kluyver, Benjamin Ragan-Kelley, Fernando Pérez, Brian Granger, Matthias Bussonnier, Jonathan Frederic, Kyle Kelley, Jes- sica Hamrick, Jason Grout, Sylvain Corlay, Paul Ivanov, Damián 40 Avila, Safia Abdalla, and Carol Willing. Jupyter notebooks – a publishing format for reproducible computational workflows. In F. Loizides and B. Schmidt, editors,P...

    work page 2016

  59. [59]

    Energetic perspective on rapid quenches in quantum annealing.PRX Quantum, 2:010338, Mar 2021

    Adam Callison, Max Festenstein, Jie Chen, Laurentiu Nita, Viv Kendon, and Nicholas Chancellor. Energetic perspective on rapid quenches in quantum annealing.PRX Quantum, 2:010338, Mar 2021

    work page 2021

  60. [60]

    Robert J. Banks, Ehsan Haque, Farah Nazef, Fatima Fethallah, Fa- tima Ruqaya, Hamza Ahsan, Het Vora, Hibah Tahir, Ibrahim Ah- mad, Isaac Hewins, Ishaq Shah, Krish Baranwal, Mannan Arora, Mateen Asad, Mubasshirah Khan, Nabian Hasan, Nuh Azad, Salgai Fedaiee, Shakeel Majeed, Shayam Bhuyan, Tasfia Tarannum, Yahya Ali, DanE.Browne, andP.A.Warburton. Continuou...

    work page 2024

  61. [61]

    Multi-stage quantum walks for finding Ising ground states, 2025

    Asa Hopkins and Viv Kendon. Multi-stage quantum walks for finding Ising ground states, 2025. arXiv:2511.01312

    work page arXiv 2025

  62. [62]

    Warburton, and Shu Tanaka

    Tomohiro Hattori, Paul A. Warburton, and Shu Tanaka. Multi-stage quantumwalkforconstrainedcombinatorialoptimizationwithequal- ity constraints. In2025 IEEE International Conference on Quantum Computing and Engineering (QCE), volume 02, pages 400–401, 2025

    work page 2025

  63. [63]

    Lasse Gerblich, Tamanna Dasanjh, Horatio Q. X. Wong, David Ross, Leonardo Novo, Nicholas Chancellor, and Viv Kendon. Advantages of multistage quantum walks over qaoa, 2024. arXiv:2407.06663

    work page arXiv 2024

  64. [64]

    Modal phase matched lithium niobate nanocircuits for integrated nonlinear photonics.OSA Continuum, 1(1):229–242, Sep 2018

    Jia-Yang Chen, Yong Meng Sua, Heng Fan, and Yu-Ping Huang. Modal phase matched lithium niobate nanocircuits for integrated nonlinear photonics.OSA Continuum, 1(1):229–242, Sep 2018

    work page 2018

  65. [65]

    Photon conversion and in- teraction on chip, 2021

    Jia-Yang Chen, Zhan Li, Zhaohui Ma, Chao Tang, Heng Fan, Yong Meng Sua, and Yu-Ping Huang. Photon conversion and in- teraction on chip, 2021. arXiv:2105.00275

    work page arXiv 2021

  66. [66]

    Efficient frequency doubling with active stabilization on chip.Laser & Pho- tonics Reviews, 15(11):2100091, 2021

    Jia-Yang Chen, Chao Tang, Mingwei Jin, Zhan Li, Zhaohui Ma, Heng Fan, Santosh Kumar, Yong Meng Sua, and Yu-Ping Huang. Efficient frequency doubling with active stabilization on chip.Laser & Pho- tonics Reviews, 15(11):2100091, 2021

    work page 2021

  67. [67]

    Measurement-driven quan- tum approximate optimization, 2025

    Tobias Stollenwerk and Stuart Hadfield. Measurement-driven quan- tum approximate optimization, 2025. arXiv:2512.21046

    work page arXiv 2025

  68. [68]

    Benjamin, Liming Zhao, and Joseph F

    Simon C. Benjamin, Liming Zhao, and Joseph F. Fitzsimons. Measurement-driven quantum computing: Performance of a 3-SAT solver, 2017. arXiv:1711.02687

    work page arXiv 2017

  69. [69]

    Constrained optimization via quantum Zeno dy- namics.Communications Physics, 6(1):219, 2023

    Dylan Herman, Ruslan Shaydulin, Yue Sun, Shouvanik Chakrabarti, Shaohan Hu, Pierre Minssen, Arthur Rattew, Romina Yalovetzky, and Marco Pistoia. Constrained optimization via quantum Zeno dy- namics.Communications Physics, 6(1):219, 2023

    work page 2023

  70. [70]

    Birgitta Whaley

    Yipei Zhang, Philippe Lewalle, and K. Birgitta Whaley. Solving k– sat problems with generalized quantum measurement.npj Quantum Information, 11(1):170, 2025. 41

    work page 2025

  71. [71]

    Itay Hen and Marcelo S. Sarandy. Driver Hamiltonians for constrained optimization in quantum annealing.Phys. Rev. A, 93:062312, Jun 2016

    work page 2016

  72. [72]

    Domain wall encoding of discrete variables for quantum annealing and QAOA.Quantum Science and Technology, 4(4):045004, aug 2019

    Nicholas Chancellor. Domain wall encoding of discrete variables for quantum annealing and QAOA.Quantum Science and Technology, 4(4):045004, aug 2019

    work page 2019

  73. [73]

    Rubin, Jason M

    Zhihui Wang, Nicholas C. Rubin, Jason M. Dominy, and Eleanor G. Rieffel.xymixers: Analytical and numerical results for the quantum alternating operator ansatz.Phys. Rev. A, 101:012320, Jan 2020

    work page 2020

  74. [74]

    A comparison on constrain encod- ing methods for quantum approximate optimization algorithm, 2024

    Yiwen Liu, Qingyue Jiao, Yidong Zhou, Zhiding Liang, Yiyu Shi, Ke Wan, and Shangjie Guo. A comparison on constrain encod- ing methods for quantum approximate optimization algorithm, 2024. arXiv:2410.04030

    work page arXiv 2024

  75. [75]

    Margaret H. Wright. The interior-point revolution in optimization: History, recent developments, and lasting consequences.Bulletin of the American Mathematical Society, 42:39–56, 2004

    work page 2004

  76. [76]

    Pudenz, Tameem Albash, and Daniel A

    Kristen L. Pudenz, Tameem Albash, and Daniel A. Lidar. Error- corrected quantum annealing with hundreds of qubits.Nature Com- munications, 5(1):3243, 2014

    work page 2014

  77. [77]

    Walter Vinci, Tameem Albash, Gerardo Paz-Silva, Itay Hen, and Daniel A. Lidar. Quantum annealing correction with minor embed- ding.Phys. Rev. A, 92:042310, Oct 2015

    work page 2015

  78. [78]

    Using copies can improve precision in continuous-time quantum computing.Quantum Science and Tech- nology, 8(3):035031, jul 2023

    Jemma Bennett, Adam Callison, Tom O’Leary, Mia West, Nicholas Chancellor, and Viv Kendon. Using copies can improve precision in continuous-time quantum computing.Quantum Science and Tech- nology, 8(3):035031, jul 2023

    work page 2023

  79. [79]

    Improving success probability in Lechner-Hauke-Zoller par- ity embedding by computing with quantum walks.Phys

    Jemma Bennett, Nicholas Chancellor, Viv Kendon, and Wolfgang Lechner. Improving success probability in Lechner-Hauke-Zoller par- ity embedding by computing with quantum walks.Phys. Rev. A, 112:042616, Oct 2025

    work page 2025

  80. [80]

    Frustration-enhanced quantum annealing correction models with additional inter-replica interac- tions, 2025

    Tomohiro Hattori and Shu Tanaka. Frustration-enhanced quantum annealing correction models with additional inter-replica interac- tions, 2025. arXiv:2509.11217

    work page arXiv 2025

Showing first 80 references.