REVIEW 4 cited by
A Hierarchy for Replica Quantum Advantage
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
abstract
We prove that given the ability to make entangled measurements on at most $k$ replicas of an $n$-qubit state $\rho$ simultaneously, there is a property of $\rho$ which requires at least order $2^n$ measurements to learn. However, the same property only requires one measurement to learn if we can make an entangled measurement over a number of replicas polynomial in $k, n$. Because the above holds for each positive integer $k$, we obtain a hierarchy of tasks necessitating progressively more replicas to be performed efficiently. We introduce a powerful proof technique to establish our results, and also use this to provide new bounds for testing the mixedness of a quantum state.
Forward citations
Cited by 4 Pith papers
-
Instance-Optimal Quantum State Certification with Entangled Measurements
Quantum state certification with entangled measurements has copy complexity Θ~(∥σ*∥_{1/2}/ε²), where σ* is the hypothesis state with a small tail of eigenvalues removed.
-
High-rate qLDPC processors
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.
-
Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach
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.
-
Measuring Less to Learn More: Quadratic Speedup in learning Nonlinear Properties of Quantum Density Matrices
A quantum algorithm estimates Tr(ρ^k O) with O(√k) queries to a purification-preparing unitary, quadratically faster than sample-based methods, with a claimed matching lower bound.
Discussion (0). Sign in to comment.