Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal schedule of multi-channel quantum Zeno dragging with application to solving the k-SAT problem

Published 22 Jul 2025 in quant-ph | (2507.16128v1)

Abstract: Quantum Zeno dragging enables the preparation of common eigenstates of a set of observables by frequent measurement and adiabatic-like modulation of the measurement basis. In this work, we present a deeper analysis of multi-channel Zeno dragging using generalized measurements, i.e. simultaneously measuring a set of non-commuting observables that vary slowly in time, to drag the state towards a target subspace. For concreteness, we will focus on a measurement-driven approach to solving k-SAT problems as examples. We first compute some analytical upper bounds on the convergence time, including the effect of finite measurement time resolution. We then apply optimal control theory to obtain the optimal dragging schedule that lower bounds the convergence time, for low-dimensional settings. This study provides a theoretical foundation for multi-channel Zeno dragging and its optimization, and also serves as a guide for designing optimal dragging schedules for quantum information tasks including measurement-driven quantum algorithms.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.