REVIEW 3 cited by
Hardware-efficient learning of quantum many-body states
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
Signed reviews
read the original abstract
Efficient characterization of highly entangled multi-particle systems is an outstanding challenge in quantum science. Recent developments have shown that a modest number of randomized measurements suffices to learn many properties of a quantum many-body system. However, implementing such measurements requires complete control over individual particles, which is unavailable in many experimental platforms. In this work, we present rigorous and efficient algorithms for learning quantum many-body states in systems with any degree of control over individual particles, including when every particle is subject to the same global field and no additional ancilla particles are available. We numerically demonstrate the effectiveness of our algorithms for estimating energy densities in a U(1) lattice gauge theory and classifying topological order using very limited measurement capabilities.
Forward citations
Cited by 3 Pith papers
-
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.
-
Classical shadows for sample-efficient measurements of gauge-invariant observables
Using the Z2 lattice-gauge-theory/Ising duality, symmetry-aware classical shadow protocols estimate gauge-invariant observables with exponentially fewer samples than symmetry-blind protocols, at the cost of deeper circuits.
-
No-go theorems for sublinear-depth group designs
Any group with an invariant state cannot have approximate k-designs built from sublinear-depth local circuits; linear depth is necessary for matchgate, orthogonal, symplectic, Clifford (k=8), and mixed-unitary group designs.
Discussion (0). Continue with ORCID to comment.