REVIEW 23 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
Predicting Many Properties of a Quantum System from Very Few Measurements
read the original 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 23 Pith papers
-
An Exponential Advantage for Adaptive Tomography of Structured States under Pauli Basis Measurements
For an explicit prefix/tree family of quantum states, adaptive local Pauli tomography achieves polynomial copy complexity while non-adaptive strategies require exponentially many copies.
-
Triangle Criterion: a mixed-state magic criterion with applications in distillation and detection
The Triangle Criterion detects mixed-state magic, proves multi-qubit distillation is strictly stronger than single-qubit schemes, and identifies a purity bound plus undetectable unfaithful magic states.
-
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.
-
Mapping twist fields to local operators via tensor networks
Constructs explicit physical local operators whose expectation values match twist field actions in MPS, exact in the injectivity limit and at the center of orthogonality, with numerical tests in the transverse-field I...
-
Efficient classical training of model-free quantum photonic reservoir
Classical light training of photonic quantum reservoirs enables accurate model-free estimation of single-qubit observables and two-qubit entanglement witnesses on unseen quantum states.
-
Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation
Unitary designs emerge from the temporal ensemble of two chaotic Hamiltonian evolutions separated by a random Pauli operation, based on the universal Pauli spectrum.
-
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.
-
Measurement-Based Quantum Diffusion Models
Measurement-based quantum diffusion models are introduced to recover pure and mixed quantum states via weak measurements, quantum score matching, and Petz recovery maps with error bounds, bridging to classical stochas...
-
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, ...
-
Simulating quantum circuits with a neural statebank
A compact neural statebank based on autoregressive Transformers simulates 34-qubit quantum circuits with ~0.01 infidelity using 0.3 million parameters, outperforming tested approximate simulators.
-
Reliable Adaptive Stopping for Krylov-Shadow Quantum Fisher Information Estimation
AKS-QFI separates Krylov truncation from finite-sample uncertainty in QFI estimation, eliminating false stops (rates 0.16-0.68 for width-only) and achieving accurate 5% tolerance declarations on n=4 qubit benchmarks.
-
High-Precision Variational Quantum SVD via Classical Orthogonality Correction
A variational quantum SVD framework with classical orthogonality correction enables high-precision extraction of Schmidt components from bipartite states using shallow circuits and classical tensor-network post-processing.
-
Local Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers
Error-mitigated IBM quantum hardware reproduces extrapolated classical simulations of entanglement growth and local thermalization for a truncated SU(2) gauge theory on chains up to 101 plaquettes.
-
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.
-
Quantum Machine Learning for State Tomography Using Classical Data
A variational quantum circuit trained solely on classical measurement outcomes reconstructs diverse quantum states including GHZ, spin-chain ground states, and random circuits with fidelities above 90% on simulators a...
-
Efficient implementation of randomized quantum algorithms with dynamic circuits
Engineering method using dynamic circuits to generate randomized algorithm distributions on quantum hardware, achieving 14000x speedup for Pauli measurements and enabling 10M-circuit classical shadows on 28-40 qubit h...
-
Feasibility of performing quantum chemistry calculations on quantum computers
New criteria reveal VQE needs fault-tolerant quantum computers due to decoherence and QPE has exponentially suppressed success probability from orthogonality catastrophe in classical input states.
-
Connecting Quantum Tomography and Quantum Retrodiction
The Petz recovery map equals the gradient of the log-likelihood in maximum-likelihood tomography, unifying retrodiction and state reconstruction via a shared iterative procedure.
-
Local robust shadows on a trapped ion computer -- a case study
Local robust shadows with calibration stages and Pauli-X-twirling mitigate errors from shortened measurement pulses on trapped-ion hardware for Haar random and QAOA states.
-
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.
-
Quantum optimization beyond QUBO for industrial logistics and scheduling
HUBO formulations for logistics problems offer qubit savings over QUBO at the expense of higher circuit depth, validated classically and simulated quantumly for small cases.
-
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.
-
Rethinking quantum information in gravity and fields
The paper organizes important open questions in quantum gravity and quantum information into four themes without presenting new results or derivations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.