REVIEW 2 cited by
Optimal Conversion from Classical to Quantum Randomness via Quantum Chaos
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
read the original abstract
Quantum many-body systems provide a unique platform for exploring the rich interplay between chaos, randomness, and complexity. In a recently proposed paradigm known as deep thermalization, random quantum states of system A are generated by performing projective measurements on system B following chaotic Hamiltonian evolution acting jointly on AB. In this scheme, the randomness of the projected state ensemble arises from the intrinsic randomness of the outcomes when B is measured. Here we propose a modified scheme, in which classical randomness injected during the protocol is converted by quantum chaos into quantum randomness of the resulting state ensemble. We show that for generic chaotic systems this conversion is optimal in that each bit of injected classical entropy generates as much additional quantum randomness as adding an extra qubit to B. This significantly enhances the randomness of the projected ensemble without imposing additional demands on the quantum hardware. Our scheme can be easily implemented on typical analog quantum simulators, providing a more scalable route for generating quantum randomness valuable for many applications. In particular, we demonstrate that the accuracy of a shadow tomography protocol can be substantially improved.
Forward citations
Cited by 2 Pith papers
-
Free Probability in a Minimal Quantum Circuit Model
In a solvable random-circuit model, all higher-order OTOCs decay at the same rate λ^{2t} (λ from a single-particle channel), and their late-time values match the free-cumulant decomposition predicted by full ETH.
-
Finite size scaling of bitstring probability distributions for Rydberg arrays
Cumulative bitstring probabilities for Rydberg-ladder vacua collapse onto a Fermi-like form in −ln(p), and the shots needed to suppress the low-p tail scale exponentially with system size.
Discussion (0). Continue with ORCID to comment.