Pith. sign in

REVIEW 1 cited by

Quantum Circuit Parameters Learning with Gradient Descent Using Backpropagation

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 1910.14266 v3 pith:3NGGJQEI submitted 2019-10-31 quant-ph physics.comp-ph

Quantum Circuit Parameters Learning with Gradient Descent Using Backpropagation

classification quant-ph physics.comp-ph
keywords quantumparametercircuitcomputergradientlearningalgorithmsbackpropagation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum computing has the potential to outperform classical computers and is expected to play an active role in various fields. In quantum machine learning, a quantum computer has been found useful for enhanced feature representation and high dimensional state or function approximation. Quantum-Classical hybrid algorithms are proposed in recent years for this purpose under the Noisy-Intermediate Scale Quantum computer (NISQ) environment. Under this scheme, the role played by classical computer is the parameter tuning, parameter optimization, and parameter update for the quantum circuit. In this paper, we propose a gradient descent based backpropagation algorithm that can efficiently calculate the gradient in parameter optimization and update the parameter for quantum circuit learning, which outperforms the current parameter search algorithms in terms of computing speed while presents the same or even higher test accuracy.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Quantum feature-map learning with reduced resource overhead

    quant-ph 2025-10 conditional novelty 6.0

    By classically reconstructing quantum model outputs, Q-FLAIR selects gates, features, and weights with O(M) quantum evaluations per iteration, decoupling quantum cost from feature dimension and enabling >90% MNIST acc...