返回
Grover's search with learning oracle for constrained binary optimization problems
DOI:10.1007/s42484-024-00148-1.png)
摘要
En 中文
Grover adaptive search (GAS) for binary optimization (BO) problems is a quantum algorithm for iteratively finding optimal solutions using Grover's search algorithm. However, in GAS, iterative oracle constructions are needed, and a high computational demand is required. In this study, we introduce a quantum generative model-based learning oracle and present Grover's search with a learning oracle (GLO) for BO problems. In the GLO, a learning oracle is constructed by a parameterized unitary. Its training is performed by a hybrid quantum-classical learning framework using the cost function involving the solution constraints and the evolution strategy as a gradient-free optimization algorithm. The GLO is trained to obtain optimal solutions with probability one. The experiments conducted on the constrained BO problems demonstrate significant decreases in the number of cost function callings (query complexity) compared to GAS. Furthermore, we also discuss the effects of the entanglers (controlled Pauli Z or X gates) of the learning oracle using a model capacity measure (i.e., effective dimension). The entanglers improve the training performance of the GLO (i.e., query complexity and search success rate). The obtained results indicate the efficiency and promise of our approach.
Keyword:
Quantum generative models
Constrained binary optimization
Quantum machine learning
Hybrid quantum-classical learning
期刊
Q
IF:
4.4
论文数:
439
被引数:
796
机构
引用论文
Effects of sex, litter size and periconceptional ewe nutrition on the ewe–lamb bond性別、产羔数及配种前后母羊营养状况对母羊-羔羊纽带的影响
Developmental Changes in Spermatogenesis, Testicular Carnitine Acetyltransferase Activity and Serum Testosterone in the Ram1绵羊1号精母细胞发生过程中的发育变化、睾丸肉碱乙酰转移酶活性和血清睾酮水平
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
NATURE COMMUNICATIONS
IF15.7
Computational Analysis: Unveiling the Quantum Algorithms for Protein Analysis and Predictions
IEEE ACCESS
IF3.6

