Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via quantum heuristic approaches. This is achieved using, for example, the variational quantum eigensolver (VQE)...
Main Authors: | Claudio Gambella, Andrea Simonetto |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9238006/ |
Similar Items
-
Formulating and Solving Routing Problems on Quantum Computers
by: Stuart Harwood, et al.
Published: (2021-01-01) -
Convergence Analysis of Multiblock Inertial ADMM for Nonconvex Consensus Problem
by: Yang Liu, et al.
Published: (2023-01-01) -
Advancing hybrid quantum–classical computation with real-time execution
by: Thomas Lubinski, et al.
Published: (2022-08-01) -
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
by: Lee Braine, et al.
Published: (2021-01-01) -
Quantum Computing for Finance: State-of-the-Art and Future Prospects
by: Daniel J. Egger, et al.
Published: (2020-01-01)