REVIEW 3 cited by
Fermionic partial tomography via classical shadows
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
abstract
We propose a tomographic protocol for estimating any $ k $-body reduced density matrix ($ k $-RDM) of an $ n $-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all $ k $-RDM elements to additive precision $ \varepsilon $ requires on the order of $ \binom{n}{k} k^{3/2} \log(n) / \varepsilon^2 $ repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for $ k \geq 2 $, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2-5 times more repetitions.
Forward citations
Cited by 3 Pith papers
-
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).
-
Comprehensive Study on Heisenberg-limited Quantum Algorithms for Multiple Observables Estimation
New adaptive quantum gradient estimation variants (Method I and Method II) achieve O~(N^{k/2})/epsilon state-preparation queries for fermionic k-RDMs, and a sine-state amplitude estimation circuit is shown to be near-...
-
Faster Quantum Algorithm for Multiple Observables Estimation in Fermionic Problems
Symmetry-tailored and parallel-readout variants of adaptive quantum gradient estimation cut the state-preparation query count for fermionic k-RDM estimation, giving a quadratic speedup over prior QGE methods at fixed ...
Discussion (0). Continue with ORCID to comment.