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

• Optimal Control by Variational Quantum Algorithms [0.0]
  We introduce a general metric termed control optimality, which accounts for constraints on both classical and quantum components.<n>We discuss the emergent gradient behavior and error robustness, demonstrating the feasibility of applying hybrid quantum algorithms to solve quantum optimal control problems.
  arXiv  Detail & Related papers  (2025-05-29T11:55:37Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• 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)
• Stochastic optimal control of open quantum systems [0.0]
  We address the generic problem of optimal quantum state preparation for open quantum systems.<n>We propose a corresponding algorithm, which we call Quantum Diffusion Control (QDC)
  arXiv  Detail & Related papers  (2024-10-24T10:47:42Z)
• 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)
• Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer [0.3518016233072556]
  A superconducting quantum computer is used to investigate the performance of a hybrid quantum-classical algorithm.<n>We benchmark the quantum solver against similarly high-performing classicals.<n>A run-time analysis shows that the quantum solver on large-scale problems is competitive against Gurobi but short of others on a projected 100-qubit quantum computer.
  arXiv  Detail & Related papers  (2024-04-26T17:59:22Z)
• 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)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• 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)
• Quantum Metropolis Solver: A Quantum Walks Approach to Optimization Problems [0.0]
  This paper focuses on the Metropolis-Hastings quantum algorithm that is based on quantum walks. We use this algorithm to build a quantum software tool called Quantum Solver (QMS) We validate QMS with the N-Queen problem to show a potential quantum advantage in an example that can be easily extrapolated to an Artificial Intelligence domain.
  arXiv  Detail & Related papers  (2022-07-13T18:26:36Z)
• 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)
• QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines [81.4597482536073]
  Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution. We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines. Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
  arXiv  Detail & Related papers  (2022-05-24T03:49:10Z)
• Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization [0.0]
  We develop an Inexact Infeasible Quantum Interior Point Method to solve linear optimization problems. We also discuss how can we get an exact solution by Iterative Refinement without excessive time of quantum solvers.
  arXiv  Detail & Related papers  (2022-05-02T21:30:56Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• 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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• 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.