.png){kind=icon}
返回
Quantum state preparation using tensor networks
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/acd9e7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Quantum state preparation is a vital routine in many quantum algorithms, including solution of linear systems of equations, Monte Carlo simulations, quantum sampling, and machine learning. However, to date, there is no established framework of encoding classical data into gate-based quantum devices. In this work, we propose a method for the encoding of vectors obtained by sampling analytical functions into quantum circuits that features polynomial runtime with respect to the number of qubits and provides >99.9% accuracy, which is better than a state-of-the-art two-qubit gate fidelity. We employ hardware-efficient variational quantum circuits, which are simulated using tensor networks, and matrix product state representation of vectors. In order to tune variational gates, we utilize Riemannian optimization incorporating auto-gradient calculation. Besides, we propose a cut once, measure twice' method, which allows us to avoid barren plateaus during gates' update, benchmarking it up to 100-qubit circuits. Remarkably, any vectors that feature low-rank structure-not limited by analytical functions-can be encoded using the presented approach. Our method can be easily implemented on modern quantum hardware, and facilitates the use of the hybrid-quantum computing architectures.
Keyword:
tensor networks
quantum computing
variational circuits
quantum state preparation
Riemannian optimization
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
PRECONDITIONED LOW-RANK RIEMANNIAN OPTIMIZATION FOR LINEAR SYSTEMS WITH TENSOR PRODUCT STRUCTURE
OAAI
OAAI分享收藏分享收藏分享收藏
查看更多内容