Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Machine Learning Tensor Network States (1804.02398v4)

Published 6 Apr 2018 in quant-ph, cond-mat.dis-nn, cond-mat.str-el, and cs.LG

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Andrey Kardashin (6 papers)
  2. Alexey Uvarov (9 papers)
  3. Jacob Biamonte (45 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.