论文标题
无线调度的量子近似
Quantum Approximation for Wireless Scheduling
论文作者
论文摘要
本文提出了一种用于无线调度问题的量子近似优化算法(QAOA)方法。 QAOA是许多应用的有希望的混合量子古典算法之一,它在NP硬性问题中提供了高度准确的优化解决方案。 QAOA将给定的问题映射到希尔伯特的空间中,然后为给定的目标和约束生成哈密顿量。然后,QAOA从经典优化方法中找到适当的参数,以优化生成的哈密顿式的期望值。基于参数,可以从哈密顿的期望值的最佳中获得给定问题的最佳解决方案。受QAOA的启发,提出了用于调度(QAO)算法的量子近似优化。首先,本文使用最大重量独立集(MWIS)制定了无线调度问题。然后,对于给定的MWIS,提议的Qaos设计了问题的哈密顿量。之后,迭代QAOS序列解决了无线调度问题。本文通过CIRQ和TensorFlow-Quantum实施的模拟验证了所提出的QAO的新颖性。
This paper proposes a quantum approximate optimization algorithm (QAOA) method for wireless scheduling problems. The QAOA is one of the promising hybrid quantum-classical algorithms for many applications and it provides highly accurate optimization solutions in NP-hard problems. QAOA maps the given problems into Hilbert spaces, and then it generates Hamiltonian for the given objectives and constraints. Then, QAOA finds proper parameters from classical optimization approaches in order to optimize the expectation value of generated Hamiltonian. Based on the parameters, the optimal solution to the given problem can be obtained from the optimum of the expectation value of Hamiltonian. Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS) algorithm is proposed. First of all, this paper formulates a wireless scheduling problem using maximum weight independent set (MWIS). Then, for the given MWIS, the proposed QAOS designs the Hamiltonian of the problem. After that, the iterative QAOS sequence solves the wireless scheduling problem. This paper verifies the novelty of the proposed QAOS via simulations implemented by Cirq and TensorFlow-Quantum.