REVIEW 11 cited by
Predicting Many Properties of a Quantum System from Very Few Measurements
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
Predicting properties of complex, large-scale quantum systems is essential for developing quantum technologies. We present an efficient method for constructing an approximate classical description of a quantum state using very few measurements of the state. This description, called a classical shadow, can be used to predict many different properties: order $\log M$ measurements suffice to accurately predict $M$ different functions of the state with high success probability. The number of measurements is independent of the system size, and saturates information-theoretic lower bounds. Moreover, target properties to predict can be selected after the measurements are completed. We support our theoretical findings with extensive numerical experiments. We apply classical shadows to predict quantum fidelities, entanglement entropies, two-point correlation functions, expectation values of local observables, and the energy variance of many-body local Hamiltonians. The numerical results highlight the advantages of classical shadows relative to previously known methods.
Forward citations
Cited by 11 Pith papers
-
Dimension-Free Polylogarithmic Quantum Shadow Tomography from Sequential Pretty-Good Measurements
New sequential pretty-good measurement protocol achieves dimension-free shadow tomography with sample complexity O(1/eps^2 * (log(M/delta))^4 / (log log(M/delta))^3).
-
Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
A quantum extension of the low-degree method shows that state designs imply computational hardness for many single-copy quantum measurement strategies, yielding new information-computation gaps.
-
Online Shadow Tomography Matching the Classical Bounds
Online shadow tomography can be solved with O(log m sqrt(log d)/eps^3) or O(sqrt(m)/eps^2) copies, matching known classical rates, but the first bound's key proof lemma contains an invalid inequality.
-
Local Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers
Quantum hardware simulation of SU(2) lattice gauge thermalization matches classical extrapolations up to 101 plaquettes after error mitigation, establishing feasibility for chaotic quantum field systems.
-
Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).
-
Maximum channel entropy principle and microcanonical channels
A maximum-entropy principle for quantum channels yields thermal channels with exponential form, analogous to thermal states.
-
Absent, Not Faint: Fisher-Information Limits and a Logarithmic Measurement-Design Cure for Passive Characterization of Coherent Qubit Noise
Coherent over-rotation angles are Fisher-null (CRB infinite) in a single fixed-basis histogram at zero angle; adding ⌈log2(n+1)⌉ extra product-Pauli settings restores identifiability, with conditioning, not coverage, ...
-
Low-Resource Quantum Energy Gap Estimation via Randomization
TE-PAI randomized time evolution can be embedded into shadow spectroscopy to estimate energy gaps, with an unbiasedness proof and demonstrations on up to 20 qubits.
-
Thermalization with partial information
A maximum channel entropy principle, backed by a microcanonical-style derivation, identifies the canonical noisy channel that models thermalization under partial information.
-
Kinematic budget of quantum correlations
Global and marginal purities alone are claimed to place any state in a two-dimensional kinematic diagram whose boundary crossings certify NPT entanglement, steering, Bell nonlocality, and bounds on magic.
-
The Necessity of Setting Temperature in LLM-as-a-Judge
Higher temperature reduces LLM-judge consistency and raises formatting errors but can surface uncertainty and aid exploration in ambiguous evaluation settings.
Discussion (0). Continue with ORCID to comment.