4.6 Article

Noisy tensor-ring approximation for computing gradients of a variational quantum eigensolver for combinatorial optimization

期刊

PHYSICAL REVIEW A
卷 108, 期 4, 页码 -

出版社

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.108.042429

关键词

-

向作者/读者索取更多资源

This research proposes an improved VQE algorithm by utilizing a classical gradient computation method that uses tensor-ring approximation. By truncating singular values and preserving the structure of the tensor ring, this method allows for faster evaluation of gradients on classical simulators, addressing the scalability challenge of VQE.
Variational quantum algorithms, especially quantum approximate optimization and the variational quantum eigensolver (VQE), have demonstrated their potential to provide computational advantage in the realm of combinatorial optimization. However, these algorithms suffer from classically intractable gradients limiting the scalability. This work addresses the scalability challenge for the VQE by proposing a classical gradient computation method which utilizes the parameter-shift rule but computes the expected values from the circuits using a tensor-ring approximation. The parametrized gates from the circuit transform the tensor ring by contracting the matrix along the free edges of the tensor ring. While the single-qubit gates do not alter the ring structure, the state transformations from the two-qubit rotations are evaluated by truncating the singular values, thereby preserving the structure of the tensor ring and reducing the computational complexity. This variation of the matrix-product-state approximation grows linearly in number of qubits and the number of two-qubit gates as opposed to the exponential growth in the classical simulations, allowing for a faster evaluation of the gradients on classical simulators.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据