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: | Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka |
---|---|
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!
|
Similar Items
-
Wind Park Layout Design Using Combinatorial Optimization
by: Mustakerov, Ivan, et al.
Published: (2011) -
Combinatorial designs : a tribute to Haim Hanani /
by: Hartman, A. (Alan)
Published: (1989) -
Combinatorial Networks Regulating Seed Development and Seed Filling
by: Gao, Ming-Jun, et al.
Published: (2012) -
Finite geometries and combinatorial designs : proceedings of the AMS Special Session in Finite Geometries and Combinatorial Designs held October 29-November 1, 1987 [Lincoln, Nebraska] /
Published: (1990) -
Robust Combinatorial Optimization with Locally Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2021-05-01)