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...
Main Authors: | Tomoko Komiyama, Tomohiro Suzuki |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10285083/ |
Similar Items
-
Nonadiabaticity in Quantum Pumping Phenomena under Relaxation
by: Kazunari Hashimoto, et al.
Published: (2019-08-01) -
Pump-probe nuclear spin relaxation study of the quantum Hall ferromagnet at filling factor ν = 2
by: K F Yang, et al.
Published: (2019-01-01) -
Reconstructing Quantum States from Sparse Measurements
by: Yufan Xie, et al.
Published: (2023-02-01) -
Relaxation methods /
by: 358109 Allen, Deryck Norman de Garrs -
A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers
by: William Cruz-Santos, et al.
Published: (2018-10-01)