Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm

Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm

Current quantum annealing and quantum-inspired annealing devices have many usage limitations and are difficult to apply to real-scale problems. In particular, a major hardware limitation is the limited number of available variables (qubits). This paper proposes a problem relaxation method for the Qu...

Full description

Bibliographic Details
Main Authors: Tomoko Komiyama, Tomohiro Suzuki
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Quantum annealing
sparse matrix
fill-in reduction
ordering
relaxation method
Online Access:https://ieeexplore.ieee.org/document/10285083/

Internet

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

Similar Items