.png){kind=icon}
返回
Large gradients via correlation in random parameterized quantum circuits
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/abd891.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward O(2n/2)
Keyword:
variational quantum algorithms
quantum machine learning
quantum alternating operator ansatz
Grover's algorithm
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器.png)
NATURE COMMUNICATIONS
OAAI
NATURE COMMUNICATIONSIF15.7
OAAI分享收藏分享收藏
查看更多内容