Convergence and schedule optimization of multi-channel quantum Zeno dragging with application to k-SAT problems, part II
ORAL
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.
*This work has been supported by the U.S. Department of Energy, Office of Science, National Quantum Information Science Research Centers, Quantum Systems Accelerator. Also, the work has been supported by Plan France 2030 through the project ANR-22-PETQ-0006.
–
Publication: https://arxiv.org/pdf/2507.16128
Presenters
-
Tathagata Karmakar
- University of California, Berkeley