Pith. sign in

REVIEW 5 cited by

Entanglement-enhanced learning of quantum processes at scale

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 2408.03376 v1 pith:GRLRIGAG submitted 2024-08-06 quant-ph

classification quant-ph
keywords quantumlearningmemorynoisyprocessesentanglementexponentiallyparameters
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Learning unknown processes affecting a quantum system reveals underlying physical mechanisms and enables suppression, mitigation, and correction of unwanted effects. Describing a general quantum process requires an exponentially large number of parameters. Measuring these parameters, when they are encoded in incompatible observables, is constrained by the uncertainty principle and requires exponentially many measurements. However, for Pauli channels, having access to an ideal quantum memory and entangling operations allows encoding parameters in commuting observables, thereby exponentially reducing measurement complexity. In practice, though, quantum memory and entangling operations are always noisy and introduce errors, making the advantage of using noisy quantum memory unclear. To address these challenges we introduce error-mitigated entanglement-enhanced learning and show, both theoretically and experimentally, that even with noise, there is a separation in efficiency between learning Pauli channels with and without entanglement with noisy quantum memory. We demonstrate our protocol's efficacy in examples including hypothesis testing with up to 64 qubits and learning inherent noise processes in a layer of parallel gates using up to 16 qubits on a superconducting quantum processor. Our protocol provides accurate and practical information about the process, with an overhead factor of $1.33 \pm 0.05$ per qubit, much smaller than the fundamental lower bound of 2 without entanglement with quantum memory. Our study demonstrates that entanglement with auxiliary noisy quantum memory combined with error mitigation considerably enhances the learning of quantum processes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. High-rate qLDPC processors

    quant-ph 2026-07 conditional novelty 8.0 of 10

    Non-abelian "mitten" qLDPC codes achieve 20% encoding rate with distances 10-24 on 150-975 qubits, and simulations indicate fault-tolerant processors sustaining ~10^10 logical operations at 0.1% physical error rate.

  2. Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach

    quant-ph 2026-02 conditional novelty 8.0 of 10

    High-precision shadow tomography of unknown quantum states has sample complexity Θ~(Γ_p/ε²), with Γ_p characterized by the inverse Fisher information matrix of the optimal single-copy measurement.

  3. Quantum channel learning with limited parallel access

    quant-ph 2026-08 conditional novelty 7.0 of 10

    For qudit channels, learning is exponentially hard with c < d parallel copies and becomes efficient at c = d with tight ε^(-2d) scaling; access to the complex-conjugate channel gives tight ε^(-4) bounds, and bosonic c...

  4. Machine learning for sample-based quantum diagonalization: generative configuration recovery and the classical-simulability frontier

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A critical review plus small exact-FCI experiments concludes that sample-based quantum diagonalization has not beaten classical selected CI and maps where, if anywhere, a quantum or generative advantage could survive.

  5. Universal Sample Complexity Bounds in Quantum Learning Theory via Fisher Information Matrix

    quant-ph 2026-02 conditional novelty 6.0 of 10

    Sample complexity for MLE-based quantum parameter learning is bounded, up to logarithmic factors, by the largest diagonal entry of the inverse Fisher information matrix divided by the squared error.

Pith tools