Pith. sign in

REVIEW 2 cited by

On quantum backpropagation, information reuse, and cheating measurement collapse

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 2305.13362 v1 pith:3DJTS3CU submitted 2023-05-22 quant-ph cs.LG

classification quant-phcs.LG
keywords quantumbackpropagationinformationreuseshadowtomographyabilityaccess
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The success of modern deep learning hinges on the ability to train neural networks at scale. Through clever reuse of intermediate information, backpropagation facilitates training through gradient computation at a total cost roughly proportional to running the function, rather than incurring an additional factor proportional to the number of parameters - which can now be in the trillions. Naively, one expects that quantum measurement collapse entirely rules out the reuse of quantum information as in backpropagation. But recent developments in shadow tomography, which assumes access to multiple copies of a quantum state, have challenged that notion. Here, we investigate whether parameterized quantum models can train as efficiently as classical neural networks. We show that achieving backpropagation scaling is impossible without access to multiple copies of a state. With this added ability, we introduce an algorithm with foundations in shadow tomography that matches backpropagation scaling in quantum resources while reducing classical auxiliary computational costs to open problems in shadow tomography. These results highlight the nuance of reusing quantum information for practical purposes and clarify the unique difficulties in training large quantum models, which could alter the course of quantum machine learning.

Discussion (0). Sign in 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. Pitfalls when tackling the exponential concentration of parameterized quantum models

    quant-ph 2025-07 conditional novelty 6.0 of 10

    Exponentially concentrated measurement outcomes are statistically indistinguishable from fixed noise after polynomial shots, so classical post-processing cannot fix them, and common proposed remedies do not escape this.

  2. Quantum Learning with Tunable Loss Functions

    quant-ph 2025-08 reject novelty 5.0 of 10

    Proposes QTERM for quantum process learning, but the proof rests on an incorrect equality E[e^{γY}] = e^{γE[Y]} for measurement bits, invalidating the sample complexity and PAC claims.

Pith tools