返回
Quantum Algorithm for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection
DOI:10.1109/TCOMM.2023.3244924.png)
摘要
En 中文
In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adaptive search that originally supported HUBO with integer coefficients. Next, as an application example, we formulate multiple-input multiple-output maximum likelihood detection as a HUBO problem with real-valued coefficients, where we use the Gray-coded bit-to-symbol mapping specified in the 5G standard. The proposed approach allows us to construct an efficient quantum circuit for the detection problem and to analyze specific numbers of required qubits and quantum gates, whereas other conventional studies have assumed that such a circuit is feasible as a quantum oracle. To further accelerate the quantum algorithm, we also derive a probability distribution of the objective function value and determine a unique threshold to sample better states. Assuming a future fault-tolerant quantum computing, our proposed algorithm has the potential for significantly reducing query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
Keyword:
Qubit
Symbols
Quantum computing
Linear programming
Complexity theory
Optimization
MIMO communication
Grover adaptive search (GAS)
quadratic unconstrained binary optimization (QUBO)
higher-order unconstrained binary optimization (HUBO)
multiple-input multiple-output (MIMO)
maximum-likelihood detection (MLD)
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Quantum Search Algor thms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design量子搜索算法、量子无线和低复杂度最大似然迭代量子多用户检测器设计
IEEE ACCESS
IF3.6
Quantum-Assisted Indoor Localization for Uplink mm-Wave and Downlink Visible Light Communication Systems上行毫米波和下行可见光通信系统的量子辅助室内定位
IEEE ACCESS
IF3.6

