wireless scheduling
Recently Published Documents


TOTAL DOCUMENTS

84
(FIVE YEARS 4)

H-INDEX

14
(FIVE YEARS 0)

2021 ◽  
Vol 146 ◽  
pp. 102166
Author(s):  
Yiqiu Liu ◽  
Xin Liu ◽  
Lei Ying ◽  
R. Srikant

2021 ◽  
Vol 50 (2) ◽  
pp. 718-759
Author(s):  
Magnús M. Halldórsson ◽  
Tigran Tonoyan
Keyword(s):  

2020 ◽  
Vol 10 (20) ◽  
pp. 7116
Author(s):  
Jaeho Choi ◽  
Seunghyeok Oh ◽  
Joongheon Kim

This paper proposes an application algorithm based on a quantum approximate optimization algorithm (QAOA) for wireless scheduling problems. QAOA is one of the promising hybrid quantum-classical algorithms to solve combinatorial optimization problems and it provides great approximate solutions to non-deterministic polynomial-time (NP) hard problems. QAOA maps the given problem into Hilbert space, and then it generates the Hamiltonian for the given objective and constraint. Then, QAOA finds proper parameters from the classical optimization loop in order to optimize the expectation value of the generated Hamiltonian. Based on the parameters, the optimal solution to the given problem can be obtained from the optimum of the expectation value of the Hamiltonian. Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS) algorithm is proposed. The proposed QAOS designs the Hamiltonian of the wireless scheduling problem which is formulated by the maximum weight independent set (MWIS). The designed Hamiltonian is converted into a unitary operator and implemented as a quantum gate operation. After that, the iterative QAOS sequence solves the wireless scheduling problem. The novelty of QAOS is verified with simulation results implemented via Cirq and TensorFlow-Quantum.


Sign in / Sign up

Export Citation Format

Share Document