arXiv:1804.02398

Quantum Machine Learning Tensor Network States

Andrey Kardashin, Alexey Uvarov, Jacob Biamonte

제출 2018-04-06

원문 초록

Tensor network algorithms seek to minimize correlations to compress the classical data representing quantum states. Tensor network algorithms and similar tools---called tensor network methods---form the backbone of modern numerical methods used to simulate many-body physics and have a further range of applications in machine learning. Finding and contracting tensor network states is a computational task which quantum computers might be used to accelerate. We present a quantum algorithm which returns a classical description of a rank-$r$ tensor network state satisfying an area law and approximating an eigenvector given black-box access to a unitary matrix. Our work creates a bridge between several contemporary approaches, including tensor networks, the variational quantum eigensolver (VQE), quantum approximate optimization (QAOA), and quantum computation.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

토론

이 논문과 연결된 포럼 글이 아직 없습니다.