Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices

• URL: http://arxiv.org/abs/2501.11735v1
• Date: Mon, 20 Jan 2025 20:40:58 GMT
• Title: Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices
• Authors: Rishab Dutta, Brandon Allen, Nam P. Vu, Chuzhi Xu, Kun Liu, Fei Miao, Bing Wang, Amit Surana, Chen Wang, Yongshan Ding, Victor S. Batista,
• Abstract summary: We show how to solve Quadratic Unconstrained Binary Optimization problems using hybrid qubit$qux2014$ devices. The potential of hybrid quantum computers to tackle complex optimization problems in both academia and industry is highlighted.
• Score: 7.954263125127824
• License:
• Abstract: Optimization challenges span a wide array of fields, from logistics and scheduling to finance, materials science, and drug discovery. Among these, Quadratic Unconstrained Binary Optimization (QUBO) problems are especially significant due to their computational complexity and their potential as a key application for quantum computing. In this work, we introduce an approach for solving QUBO problems using hybrid qubit-qumode bosonic quantum computers$\unicode{x2014}$devices that manipulate and measure the quantum states of light within microwave cavity resonators. We map problems with soft and hard constraints onto the Hamiltonian of a hybrid quantum system, consisting of a single qubit coupled to multiple qumodes. The optimal solution is encoded in the ground state of the system, which is revealed by photon-number measurements. Trial states are prepared through universal qubit-qumode circuits, employing echoed conditional displacement (ECD) gates in combination with qubit rotations. Our approach demonstrates the immense potential of hybrid quantum systems, showcasing their ability to efficiently tackle complex optimization problems in both academia and industry.

Related papers

• Variational Quantum Algorithm for Constrained Topology Optimization in Quantum Scientific Computing [3.6190123930006317]
  We propose a novel variational quantum algorithm for topology optimization through quantum entanglement. The algorithm is demonstrated with compliance minimization problems including truss structures and Messerschmitt-B"olkow-Blohm beams.
  arXiv  Detail & Related papers  (2024-12-10T01:38:40Z)
• 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)
• Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic [0.0]
  We show how to exploit multilevel carriers of quantum information -- qudits -- for the construction of constrained quantum optimization algorithms. We propose a hybrid classical quantum strategy that allows us to sample constrained solutions while greatly reducing the search space of the problem.
  arXiv  Detail & Related papers  (2023-06-07T13:16:15Z)
• 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)
• Squeezing and quantum approximate optimization [0.6562256987706128]
  Variational quantum algorithms offer fascinating prospects for the solution of optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein remain unclear. We show numerically as well as on an IBM quantum chip how highly squeezed states are generated in a systematic procedure.
  arXiv  Detail & Related papers  (2022-05-20T18:00:06Z)
• 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)
• Multi-round QAOA and advanced mixers on a trapped-ion quantum computer [0.0]
  Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of variational circuits. In this paper, we demonstrate on a trapped-ion quantum computer that QAOA results improve with the number of rounds for multiple problems on several arbitrary graphs.
  arXiv  Detail & Related papers  (2022-01-28T18:57:14Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.