Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices
- 14 May 2026
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 22 (10) , 5073-5089
Abstract
Variational Quantum Algorithms (VQAs) provide a promising framework for tackling complex optimization problems on near-term quantum hardware. Here, we demonstrate that hybrid qubit-qumode quantum devices offer an efficient route to solving Quadratic Unconstrained Binary Optimization (QUBO) problems using the Echoed Conditional Displacement Variational Quantum Eigensolver (ECD-VQE). Leveraging circuit quantum electrodynamics (cQED) architectures, we encode QUBO instances across multiple qumodes weakly coupled to a single qubit and extract binary solutions directly from photon-number measurements. We apply ECD-VQE to the Binary Knapsack Problem and show that it outperforms the Quantum Approximate Optimization Algorithm (QAOA) implemented on conventional qubit circuits, achieving higher-quality solutions with dramatically fewer resources. We also demonstrate that ECD-VQE can be extended to chemically motivated tasks such as active-space selection for multireference electronic structure methods. These results highlight the utility of hybrid qubit-qumode platforms for a broad class of NP-hard and chemistry-related optimization problems and demonstrate that variational ECD ansatz can realize expressive state preparation with significantly shallower circuits than qubit-only architectures, positioning qubit-qumode gates as compelling candidates for constrained optimization in early fault-tolerant quantum computing.Keywords
All Related Versions
Funding Information
- U.S. Department of Energy (DE-SC0025521)
- National Science Foundation (2124511)
- National Science Foundation (2302908)
This publication has 78 references indexed in Scilit:
- Translating Constraints into QUBOs for the Quadratic Knapsack Problem2023
- The Variational Quantum Eigensolver: A review of methods and best practicesPhysics Reports, 2022
- Applications and Computational Advances for Solving the QUBO Model2022
- Benchmarking the quantum approximate optimization algorithmQuantum Information Processing, 2020
- Application of portfolio optimization to drug discoveryInformation Sciences, 2018
- QuTiP: An open-source Python framework for the dynamics of open quantum systemsComputer Physics Communications, 2012
- New perspectives on unitary coupled‐cluster theoryInternational Journal of Quantum Chemistry, 2006
- Where are the hard knapsack problems?Computers & Operations Research, 2005
- A complete active space SCF method (CASSCF) using a density matrix formulated super-CI approachChemical Physics, 1980
- The knapsack problem: A surveyNaval Research Logistics Quarterly, 1975