Variational measurement-based quantum computation for generative modeling
arXiv:2310.13524 · doi:10.1103/PhysRevA.110.062616
Abstract
Measurement-based quantum computation (MBQC) offers a fundamentally unique paradigm to design quantum algorithms. Indeed, due to the inherent randomness of quantum measurements, the natural operations in MBQC are not deterministic and unitary, but are rather augmented with probabilistic byproducts. Yet, the main algorithmic use of MBQC so far has been to completely counteract this probabilistic nature in order to simulate unitary computations expressed in the circuit model. In this work, we propose designing MBQC algorithms that embrace this inherent randomness and treat the random byproducts in MBQC as a resource for computation. As a natural application where randomness can be beneficial, we consider generative modeling, a task in machine learning centered around generating complex probability distributions. To address this task, we propose a variational MBQC algorithm equipped with control parameters that allow one to directly adjust the degree of randomness to be admitted in the computation. Our algebraic and numerical findings indicate that this additional randomness can lead to significant gains in expressivity and learning performance for certain generative modeling tasks, respectively. These results highlight the potential advantages in exploiting the inherent randomness of MBQC and motivate further research into MBQC-based algorithms.
16 pages, 10 figures
References in corpus (19)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Measurement-based quantum computation
- Quantum advantage with shallow circuits
- A generative modeling approach for benchmarking and training shallow quantum circuits
- Differentiable Learning of Quantum Circuit Born Machine
- Sequential minimal optimization for quantum-classical hybrid algorithms
- A computationally universal phase of quantum matter
- A measurement-based variational quantum eigensolver
- Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
- Quantum computation via translation-invariant operations on a chain of qubits
- Trainability barriers and opportunities in quantum generative modeling
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Randomness-enhanced expressivity of quantum neural networks
- Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver