Approximate Solutions of Combinatorial Problems via Quantum Relaxations

Approximate Solutions of Combinatorial Problems via Quantum Relaxations

Combinatorial problems are formulated to find optimal designs within a fixed set of constraints and are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial optimization remains an ongoing area of study. Here, we propose...

Full description

Saved in:
Bibliographic Details
Main Authors: Bryce Fuller, Charles Hadfield, Jennifer R. Glick, Takashi Imamichi, Toshinari Itoko, J. Richard Thompson, Yang Jiao, M. Marna Kagele, W. Blom-Schieber Adriana, Rudy Raymond, Antonio Mezzacapo
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Transactions on Quantum Engineering
Subjects:
Combinatorial optimization
quantum optimization
quantum random access codes (QRACs)
Online Access:https://ieeexplore.ieee.org/document/10586788/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/10586788/

Similar Items