Quick design of feasible tensor networks for constrained combinatorial optimization
Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent them from handling real-world problems. Recently, a quantum-inspired solver using tensor networks has been proposed, which...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-07-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2025-07-21-1799/pdf/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|