Pith. sign in

Efficient Classical Shadow Tomography through Many-body Localization Dynamics

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Classical shadow tomography serves as a potent tool for extracting numerous properties from quantum many-body systems with minimal measurements. Nevertheless, prevailing methods yielding optimal performance for few-body operators necessitate the application of random two-qubit gates, a task that can prove challenging on specific quantum simulators such as ultracold atomic gases. In this work, we introduce an alternative approach founded on the dynamics of many-body localization, a phenomenon extensively demonstrated in optical lattices. Through an exploration of the shadow norm -- both analytically, employing a phenomenological model, and numerically, utilizing the TEBD algorithm -- we demonstrate that our scheme achieves remarkable efficiency comparable to shallow circuits or measurement-induced criticality, resulting in a significant improvement in the exponential exponent compared to the previous classical shadow protocol. Our findings are corroborated through direct numerical simulations encompassing the entire sampling and reconstruction processes. Consequently, our results present a compelling methodology for analyzing the output states of quantum simulators.

fields

quant-ph 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

Contractive Unitary and Classical Shadow Tomography

quant-ph · 2024-11-28 · conditional · novelty 8.0

Using an all-to-all product of ZZ gates as a deterministic global unitary, classical shadow tomography achieves ~1.8^k sample complexity for dense k-local Pauli strings.

citing papers explorer

Showing 1 of 1 citing paper.

  • Contractive Unitary and Classical Shadow Tomography quant-ph · 2024-11-28 · conditional · none · ref 24 · internal anchor

    Using an all-to-all product of ZZ gates as a deterministic global unitary, classical shadow tomography achieves ~1.8^k sample complexity for dense k-local Pauli strings.