Performance Bounds for Quantum Feedback Control

• URL: http://arxiv.org/abs/2304.03366v2
• Date: Thu, 05 Dec 2024 21:38:49 GMT
• Title: Performance Bounds for Quantum Feedback Control
• Authors: Flemming Holtorf, Frank Schäfer, Julian Arnold, Christopher Rackauckas, Alan Edelman,
• Abstract summary: We combine quantum filtering theory and moment-sum-of-squares techniques to construct a hierarchy of convex optimization problems. We prove convergence of the bounds to the optimal control performance under technical conditions.
• Score: 1.747623282473278
• License:
• Abstract: The limits of quantum feedback control have immediate consequences for quantum information science at large, yet remain largely unexplored. Here, we combine quantum filtering theory and moment-sum-of-squares techniques to construct a hierarchy of convex optimization problems that furnish monotonically improving, computable bounds on the best attainable performance for a broad class of quantum feedback control problems. These bounds may serve as witnesses of fundamental limitations, optimality certificates, or performance targets. We prove convergence of the bounds to the optimal control performance under technical conditions and demonstrate the practical utility of our approach by designing certifiably near-optimal controllers for a qubit in a cavity subjected to photon counting and homodyne detection measurements.

Related papers

• FOCQS: Feedback Optimally Controlled Quantum States [0.0]
  Feedback-based quantum algorithms, such as FALQON, avoid fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. We develop an analytic framework to use it to perturbatively update previous control layers. This perturbative methodology, which we call Feedback Optimally Controlled Quantum States (FOCQS), can be used to improve the results of feedback-based algorithms.
  arXiv  Detail & Related papers  (2024-09-23T18:00:06Z)
• Robustness of optimal quantum annealing protocols [0.0]
  We show that the norm of the Hamiltonian quantifies the robustness against these errors, motivating the introduction of an additional regularization term in the cost function. We analyze the optimality conditions of the resulting robust quantum optimal control problem based on Pontryagin's maximum principle.
  arXiv  Detail & Related papers  (2024-08-13T10:10:56Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Enhancing Quantum Entanglement in Bipartite Systems: Leveraging Optimal Control and Physics-Informed Neural Networks [1.4811951486536687]
  We formulate an optimal control problem centered on maximizing an enhanced lower bound of the entanglement measure within a shortest timeframe. We derive optimality conditions based on Pontryagin's Minimum Principle tailored for a matrix-valued dynamic control system. The proposed strategy not only refines the process of generating entangled states but also introduces a method with increased sensitivity in detecting entangled states.
  arXiv  Detail & Related papers  (2024-03-24T22:59:24Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Robust optimization for quantum reinforcement learning control using partial observations [10.975734427172231]
  Full observation of quantum state is experimentally infeasible due to the exponential scaling of the number of required quantum measurements on the number of qubits. This control scheme is compatible with near-term quantum devices, where the noise is prevalent. It has been shown that high-fidelity state control can be achieved even if the noise amplitude is at the same level as the control amplitude.
  arXiv  Detail & Related papers  (2022-06-29T06:30:35Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Benchmarking Quantum Annealing Controls with Portfolio Optimization [0.0]
  We compare empirical results from the D-Wave 2000Q quantum annealer to the computational ground truth for a variety of portfolio optimization instances. We identify control variations that yield optimal performance in terms of probability of success and probability of chain breaks.
  arXiv  Detail & Related papers  (2020-07-06T18:46:55Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.