Pith. sign in

REVIEW 2 cited by

Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.06858 v3 pith:U2ZF5A6L submitted 2023-02-14 quant-ph

classification quant-ph
keywords quantuminitializationparameterstrategytrainabilitycircuitcircuitsdepth
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Parameterized quantum circuits (PQCs) have been widely used as a machine learning model to explore the potential of achieving quantum advantages for various tasks. However, training PQCs is notoriously challenging owing to the phenomenon of plateaus and/or the existence of (exponentially) many spurious local minima. To enhance trainability, in this work we propose an efficient parameter initialization strategy with theoretical guarantees. We prove that by reducing the initial domain of each parameter inversely proportional to the square root of circuit depth, the magnitude of the cost gradient decays at most polynomially with respect to qubit count and circuit depth. Our theoretical results are substantiated through numerical simulations of variational quantum eigensolver tasks. Moreover, we demonstrate that the reduced-domain initialization strategy can protect specific quantum neural networks from exponentially many spurious local minima. Our results highlight the significance of an appropriate parameter initialization strategy, offering insights to enhance the trainability and convergence of variational quantum algorithms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Learning complexity gradually in quantum machine learning models

    quant-ph 2024-11 conditional novelty 4.0 of 10

    Self-paced hard-example mining, which trains a quantum convolutional network on its ten highest-loss states each epoch, outperforms standard training on two spin-chain phase recognition benchmarks.

  2. Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms

    quant-ph 2025-01 conditional novelty 3.0 of 10

    A classical network trained to output PQC initial parameters across Hamiltonian tasks gives faster VQE convergence in small simulations, but the approach is an extension of Meta-VQE rather than a true MAML implementation.

Pith tools