pith. sign in

arxiv: 2103.08572 · v2 · pith:YRITJXWYnew · submitted 2021-03-15 · 🪐 quant-ph

FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits

classification 🪐 quant-ph
keywords quantumparametersfliptrainingcircuitsfamilyinitializationparametrized
0
0 comments X
read the original abstract

When compared to fault-tolerant quantum computational strategies, variational quantum algorithms stand as one of the candidates with the potential of achieving quantum advantage for real-world applications in the near term. However, the optimization of the circuit parameters remains arduous and is impeded by many obstacles such as the presence of barren plateaus, many local minima in the optimization landscape, and limited quantum resources. A non-random initialization of the parameters seems to be key to the success of the parametrized quantum circuits (PQC) training. Drawing and extending ideas from the field of meta-learning, we address this parameter initialization task with the help of machine learning and propose FLIP: a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters from a family of related problems which are used as the training set. The flexibility advocated to FLIP hinges in the possibility of predicting the initialization of parameters in quantum circuits with a larger number of parameters from those used in the training phase. This is a critical feature lacking in other meta-learning parameter initializing strategies proposed to date. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum machine learning models for graphs

    quant-ph 2026-07 unverdicted novelty 7.0

    Characterizes constituents of n-qubit graph quantum ML models and supplies a toolbox enabling integration with classical models, generalization of prior GQML approaches, and classical pre-training.

  2. Mitigating the barren plateau problem in linear optics

    quant-ph 2025-10 unverdicted novelty 6.0

    A dual-valued phase shifter in linear optics creates variational cost landscapes with fewer local minima and outperforms prior linear-optical variational algorithms by mitigating barren plateaus.

  3. Geometric Analysis of Variational Quantum Eigensolver

    quant-ph 2026-05 unverdicted novelty 5.0

    Unifies fixed-ansatz and adaptive VQE via ansatz-free product-unitary formulation on the unitary group and derives convergence rates, initialization guarantees, and noise-robust measurement strategies for Riemannian g...