Pith. sign in

REVIEW 2 cited by

Streaming quantum state purification

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 2309.16387 v4 pith:RN2VMJDW submitted 2023-09-28 quant-ph

Streaming quantum state purification

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

Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs

    quant-ph 2026-05 unverdicted novelty 8.0

    Solves quantum purity amplification for arbitrary n, m, eigenstates, and dimension d, with asymptotic input scaling O(m/(ε D_min²)) independent of d and non-asymptotic bounds from generalized Young diagrams.

  2. Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms

    quant-ph 2025-09 accept novelty 7.0

    Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).