Convergence and schedule optimization of multi-channel quantum Zeno dragging with application to k-SAT problems, part II

Oral-In-person

Abstract

The CDJ (Chansari-Dressel-Jordan)-Pontryagin framework lets us find most-likely path based optimal control in continuously monitored quantum systems. Previously, the formalism had been successfully applied to state preparation and single-qubit Zeno dragging problems. In our work, we apply the CDJ-Pontryagin approach to find the optimal Zeno-dragging schedule for hard 3-SAT problems with up to five qubits.  Compared to optimal Lindbladian dynamics, a postselected CDJ-Pontryagin optimization yields a higher mean fidelity with respect to the target state. Our work provides foundations for most-likely path based optimization in multiqubit systems. The optimal paths also provide a lower bound on Zeno dragging times for solving hard 3-SAT problems.

Publication: https://arxiv.org/pdf/2507.16128

Presenters

  • Tathagata Karmakar

    • University of Rochester

Authors

  • Tathagata Karmakar

    • University of Rochester
  • Yipei Zhang

    • University of California, Berkeley
  • Alain Sarlette

  • Philippe Lewalle

    • University of California, Berkeley
  • Birgitta Whaley

    • University of California, Berkeley