REVIEW 6 cited by
Exponential Separations between Quantum Learning with and without 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
Exponential Separations between Quantum Learning with and without Purification
read the original abstract
In quantum learning tasks, quantum memory can offer exponential reductions in statistical complexity compared to any single-copy strategies, but this typically necessitates at least doubling the system size. We show that such exponential reductions can also be achieved by having access to the purification of the target mixed state. Specifically, for a low-rank mixed state, only a constant number of ancilla qubits is needed for estimating properties related to its purity, cooled form, principal component and quantum Fisher information with constant sample complexity, which utilizes single-copy measurements on the purification. Without access to the purification, we prove that these tasks require exponentially many copies of the target mixed state for any strategies utilizing a bounded number of ancilla qubits, even with the knowledge of the target state's rank. Our findings also lead to practical applications in areas such as quantum cryptography. With further discussions about the source and extent of the advantages brought by purification, our work uncovers a new resource with significant potential for quantum learning and other applications.
Forward citations
Cited by 6 Pith papers
-
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
A new potential-based algorithm achieves instance-optimal O(sqrt(T·S(X||I/d))) regret for matrix LEA with the same complexity as MMWU, using a one-sided Jensen trace inequality.
-
No Cloning of Quantum Ensembles
No-cloning theorem for quantum ensembles established information-theoretically, with circumvention for finite evolutions but proven computational intractability.
-
Tomography of quantum states with bounded extent
A reduction from weak agnostic learning of class C to efficient tomography of states with bounded l1-extent w.r.t. C, with a concrete algorithm for stabilizer states running in poly(n, (ξ/ε)^log(ξ/ε)) time.
-
Quantum Nonlinear Properties from a Single Measurement Setting
CBNE enables estimation of nonlinear quantum properties such as higher-order expectations from a single randomized measurement setting under sufficient system dimension or ancillary qubits.
-
Exponential speedups in fault-tolerant processing of quantum experiments
Embedding experimental quantum states into high-distance codes enables exponential speedups in fault-tolerant shadow tomography and cubic observable estimation over unencoded adaptive strategies.
-
Efficient witnessing and testing of magic in mixed quantum states
Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.