Quantum optimal control via polynomial optimization: A globally convergent approach

• URL: http://arxiv.org/abs/2209.05790v1
• Date: Tue, 13 Sep 2022 07:41:40 GMT
• Title: Quantum optimal control via polynomial optimization: A globally convergent approach
• Authors: Denys I. Bondar and Kurt Jacobs and Georgios Korpas and Jakub Marecek and and Jiri Vala
• Abstract summary: The problems of optimal quantum control, Hamiltonian identification, and minimal-time control are reformulated as optimization tasks. The proposed formulations have the unique properties that (i) they have globally convergent solvers and (ii) finding the optimum does not require solving the Schroedinger equation.
• Score: 3.963609604649394
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The problems of optimal quantum control, Hamiltonian identification, and minimal-time control are reformulated as polynomial optimization tasks, where the objective function and constrains are polynomials. The proposed formulations have the unique properties that (i) they have globally convergent solvers and (ii) finding the optimum does not require solving the Schroedinger equation, hence does not depend on the dimension of quantum system. The polynomial formulations are applicable as long as both the Magnus expansion for a quantum propagator and the Chebyshev expansion for the exponential are valid, which are used in the derivation. The proposed formulations offer a new approach to quantum information science and technology.

Related papers

• Differentiable Quantum Computing for Large-scale Linear Control [26.118874431217165]
  We introduce an end-to-end quantum algorithm for linear-quadratic control with provable speedups. Our algorithm, based on a policy gradient method, incorporates a novel quantum subroutine for solving the matrix Lyapunov equation.
  arXiv  Detail & Related papers  (2024-11-03T00:54:33Z)
• Exploiting Structure in Quantum Relative Entropy Programs [6.281229317487581]
  We show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy programs. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
  arXiv  Detail & Related papers  (2024-06-28T21:37:45Z)
• 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)
• Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
  The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations. The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2024-02-28T18:19:33Z)
• Polynomial-time Solver of Tridiagonal QUBO and QUDO problems with Tensor Networks [41.94295877935867]
  We present an algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete Optimization (QUDO) problems with one-neighbor interactions. Our method is based on the simulation of a quantum state to which we will apply an imaginary time evolution and perform a series of partial traces to obtain the state of maximum amplitude.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• Quantum Optimisation for Continuous Multivariable Functions by a Structured Search [0.0]
  Quantum variational algorithms leverage quantum superposition and entanglement to optimise over exponentially large solution spaces. We show that quantum variational algorithms can efficiently optimise continuous multivariable functions by exploiting general structural properties of a discretised continuous solution space.
  arXiv  Detail & Related papers  (2022-10-12T14:16:06Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• QGOpt: Riemannian optimization for quantum technologies [0.0]
  We introduce QGOpt, the library for constrained optimization in quantum technology. We show two application examples: quantum gate decomposition and quantum tomography.
  arXiv  Detail & Related papers  (2020-11-03T18:11:53Z)
• Direct Optimal Control Approach to Laser-Driven Quantum Particle Dynamics [77.34726150561087]
  We propose direct optimal control as a robust and flexible alternative to indirect control theory. The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
  arXiv  Detail & Related papers  (2020-10-08T07:59:29Z)
• Quantum Optimal Control via Magnus Expansion and Non-Commutative Polynomial Optimization [6.1678491628787455]
  We present the first globally. methods for quantum optimal control. As a result, we employ the first globally objective is non-commutative geometry.
  arXiv  Detail & Related papers  (2020-01-17T18:28:00Z)

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.