.png){kind=icon}
返回
Protocols for trainable and differentiable quantum generative modeling
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.6.033291.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose an approach for learning probability distributions as differentiable quantum circuits (DQC) that enable efficient quantum generative modeling (QGM) and synthetic data generation. Contrary to existing QGM approaches, we perform training of a DQC-based model, where data is encoded in a latent space with the proposed phase feature map of exponential capacity. This is followed by a trainable quantum circuit, forming the model. We then map the trained model to the bit basis using a fixed unitary transformation, in this case corresponding to a quantum Fourier transform circuit. It allows fast sampling from parametrized distributions using a single-shot readout. Importantly, latent space training provides models that are automatically differentiable, and we show how samples from solutions of stochastic differential equations (SDEs) can be accessed by solving stationary and time-dependent Fokker-Planck equations with a quantum protocol. Our approach opens a route to multidimensional generative modeling with qubit registers explicitly correlated via a (fixed) entangling layer. In this case quantum computers can offer advantage as efficient samplers, which perform complex inverse transform sampling enabled by the fundamental laws of quantum mechanics. On a technical side the advances are multiple, as we introduce the phase feature map, analyze its properties, and develop frequency-taming techniques that include qubitwise training and feature map sparsification.
Keyword:
COMPUTATION
SUPREMACY
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
Magnetization-vector analogy as a reformulation of the equations of fluid dynamics.png)
AIAA Journal
AIAA JournalIF0
PREAI
分享收藏Quantum computational advantage via 60-qubit 24-cycle random circuit sampling通过60量子位24周期随机电路采样实现量子计算优势SCIENCE BULLETIN
OAAI
SCIENCE BULLETINIF21.1
OAAI分享收藏分享收藏
查看更多内容