Parallel Variational Quantum Algorithms With Gradient-Informed Restart to Speed Up Optimization in the Presence of Barren Plateaus

Abstract: Inspired by the Fleming–Viot stochastic process, we propose a parallel implementation with restart of variational quantum algorithms, with the aim of reducing the time spent by the algorithm in barren plateaus where the optimization direction is unclear. In the Fleming–Viot tradition, parallel searches are called particles. In the proposed approach, the search by a […]

Learning Circular Hidden Quantum Markov Models: A Tensor Network Approach

This article proposes circular hidden quantum Markov models (c-HQMMs), which can be applied for modeling temporal data. We show that c-HQMMs are equivalent to a tensor network (more precisely, circular local purified state) model. This equivalence enables us to provide an efficient learning model for c-HQMMs. The proposed learning approach is evaluated on six real […]