Non-commutative optimization problems with differential constraints

• URL: http://arxiv.org/abs/2408.02572v1
• Date: Mon, 5 Aug 2024 15:46:57 GMT
• Title: Non-commutative optimization problems with differential constraints
• Authors: Mateus Araújo, Andrew J. P. Garner, Miguel Navascues,
• Abstract summary: We study a variant of NPO problems where a subset of the operator variables satisfies a system of ordinary differential equations. This allows us to define a complete hierarchy of SDPs to tackle the original differential problem. We apply this method to extrapolate quantum time series in a semi-device-independent way.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-commutative polynomial optimization (NPO) problems seek to minimize the state average of a polynomial of some operator variables, subject to polynomial constraints, over all states and operators, as well as the Hilbert spaces where those might be defined. Many of these problems are known to admit a complete hierarchy of semidefinite programming (SDP) relaxations. NPO theory has found application in quantum information theory, quantum chemistry and statistical physics. In this work, we consider a variant of NPO problems where a subset of the operator variables satisfies a system of ordinary differential equations. We find that, under mild conditions of operator boundedness, for every such problem one can construct a standard NPO problem with the same solution. This allows us to define a complete hierarchy of SDPs to tackle the original differential problem. We apply this method to extrapolate quantum time series in a semi-device-independent way and sketch how one can use it to model Hamiltonian time evolution in many-body quantum systems.

Related papers

• Inequality constraints in variational quantum circuits with qudits [1.0923877073891446]
  Quantum optimization is emerging as a prominent candidate for exploiting the capabilities of near-term quantum devices. Here, we study an alternative direct implementation of inequality constraints within the QAOA algorithm, achieved using qudit-SUM gates. We find that the direct implementation of the inequality penalties vastly outperforms the slack variables method, especially when studying real-world inspired problems with many constraints.
  arXiv  Detail & Related papers  (2024-10-10T07:32:38Z)
• Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
  Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP) We generalize the SDP-inspired quantum algorithm to sum-of-squares. Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
  arXiv  Detail & Related papers  (2024-08-14T19:04:13Z)
• First-order optimality conditions for non-commutative optimization problems [0.0]
  We derive, via small variations on the problem variables, state and operator optimality conditions. Operator optimality conditions are the non-commutative analogs of the Karush-Kuhn-Tucker conditions. We prove that a weak form of non-commutative operator optimality holds for all Archimedean NPO problems.
  arXiv  Detail & Related papers  (2023-11-30T17:00:06Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Hamiltonian variational ansatz without barren plateaus [0.0]
  Variational quantum algorithms are one of the most promising applications of a near-term quantum computer. Despite their huge potential, the utility of variational quantum algorithms beyond tens of qubits is still questioned.
  arXiv  Detail & Related papers  (2023-02-16T19:01:26Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• Time complexity analysis of quantum difference methods for the multiscale transport equations [0.0]
  We find that the complexities for the even-odd parity based Asymptotic-Preserving scheme do not depend on $varepsilon$. This indicates that it is still of great importance to use AP schemes for multiscale problems in quantum computing.
  arXiv  Detail & Related papers  (2022-11-12T07:13:49Z)
• Quantum optimal control via polynomial optimization: A globally convergent approach [3.963609604649394]
  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.
  arXiv  Detail & Related papers  (2022-09-13T07:41:40Z)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)

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.