.png){kind=icon}
返回
Grover Adaptive Search for Constrained Polynomial Binary Optimization
.png){kind=icon}
OA
AI
DOI：10.22331/q-2021-04-08-428.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case. GAS can provide a quadratic speed-up for combinatorial optimization problems compared to brute force search. However, this requires the development of efficient oracles to represent problems and flag states that satisfy certain search criteria. In general, this can be achieved using quantum arithmetic, however, this is expensive in terms of Toffoli gates as well as required ancilla qubits, which can be prohibitive in the near-term. Within this work, we develop a way to construct efficient oracles to solve CPBO problems using GAS algorithms. We demonstrate this approach and the potential speed-up for the portfolio optimization problem, i.e. a QUBO, using simulation and experimental results obtained on real quantum hardware. However, our approach applies to higher-degree polynomial objective functions as well as constrained optimization problems.
期刊
IF:
5.4
论文数:
974
被引数:
1.0W
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏Abnormal lipid and fatty acid compositions of kidneys from mice with polycystic kidney diseaseLipids
LipidsIF0
PREAI
分享收藏分享收藏
查看更多内容