论文标题
无线通道分配问题的减少量子和量子加速
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
论文作者
论文摘要
在本文中，我们提出了一种新的方法，该方法是将NP-硬无线通道分配问题制定为高阶不受限制的二元优化（HUBO），其中使用Grover Adaptive搜索（GAS）来提供二次加速来解决该问题。常规方法依赖于通道指数的单热编码，从而导致二次公式。相比之下，我们怀孕了通道指数的上升和下降二进制编码，构造特定的量子电路，并得出气体所需的Qubits和门的确切数量。我们的分析阐明，与常规二次配方相比，提出的胡岛配方大大减少了量子数的数量和查询复杂性。这一优势是以增加量子门数量的成本来实现的，我们证明，我们提出的下降二进制编码可以降低。
In this paper, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving the problem. The conventional method relies on a one-hot encoding of the channel indices, resulting in a quadratic formulation. By contrast, we conceive ascending and descending binary encodings of the channel indices, construct a specific quantum circuit, and derive the exact numbers of qubits and gates required by GAS. Our analysis clarifies that the proposed HUBO formulation significantly reduces the number of qubits and the query complexity compared with the conventional quadratic formulation. This advantage is achieved at the cost of an increased number of quantum gates, which we demonstrate can be reduced by our proposed descending binary encoding.
