On the learning abilities of photonic continuous-variable Born machines
arXiv:2410.11785 · doi:10.1109/QCE60285.2024.00094
Abstract
This paper investigates photonic continuous-variable Born machines (CVBMs), which utilize photonic quantum states as resources for continuous probability distributions. Implementing exact gradient descent in the CVBM training process is often infeasible, bringing forward the need to approximate the gradients using an estimator obtained from a smaller number of samples, obtaining a quantum stochastic gradient descent (SGD) method. In this work, the ability to train CVBMs is analyzed using stochastic gradients obtained using relatively few samples from the probability distribution corresponding to homodyne measurement. The main obstacle to this analysis is that classically simulating CVBMs and obtaining samples is a demanding task, while a large number of iterations are needed to achieve convergence. The present research is enabled by a novel strategy to simulate homodyne detections of generic multimode photonic states using a classical computer. With this approach, a more comprehensive study of CVBMs is made possible, and the training of multimode CVBMs is demonstrated with parametric quantum circuits considerably larger than in previous articles. More specifically, we use the proposed algorithm to demonstrate learning of multimode quantum distributions using CVBMs. Moreover, successful CVBM trainings were demonstrated with the use of stochastic gradients.
7 pages, 8 figures
References in corpus (15)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum computational advantage using photons
- Quantum Circuit Learning
- Evaluating analytic gradients on quantum hardware
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Continuous-variable quantum neural networks
- Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
- Differentiable Learning of Quantum Circuit Born Machine
- Stochastic gradient descent for hybrid quantum-classical optimization
- The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
- Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
- Logical blocks for fault-tolerant topological quantum computation
- Exact simulation of Gaussian Boson Sampling in polynomial space and exponential time
- Fast optimization of parametrized quantum optical circuits
- A Continuous Variable Born Machine