We introduce “dual-unitary shadow tomography'' (DUST), a classical shadow tomography protocol based on dual-unitary brick-wall circuits. To quantify the performance of DUST, we study operator spreading and Pauli weight dynamics in one-dimensional qubit systems, evolved by random two-local dual-unitary gates arranged in a brick-wall structure, ending with a measurement layer. We do this by deriving general constraints on the Pauli weight transfer matrix and specializing to the case of dual-unitarity. Remarkably, we find that operator spreading in these circuits have a rich structure resembling that of relativistic quantum field theories, with massless chiral excitations that can decay or fuse into each other, which we call left- or right-movers. We develop a mean-field description of the Pauli weight in terms of ρ(x,t) , which represents the probability of having nontrivial support at site x and depth t starting from a fixed weight distribution. We develop an equation of state for ρ(x,t) and simulate it numerically using Monte Carlo simulations. For the task of predicting operators with (nearly) full support, we show that DUST outperforms brick-wall Clifford shadows of equal depth. This advantage is further pronounced for small system sizes and our results are generally robust to finite-size effects.
We introduce “dual-unitary shadow tomography'' (DUST), a classical shadow tomography protocol based on dual-unitary brick-wall circuits. To quantify the performance of DUST, we study operator spreading and Pauli weight dynamics in one-dimensional qubit systems, evolved by random two-local dual-unitary gates arranged in a brick-wall structure, ending with a measurement layer. We do this by deriving general constraints on the Pauli weight transfer matrix and specializing to the case of dual-unitarity. Remarkably, we find that operator spreading in these circuits have a rich structure resembling that of relativistic quantum field theories, with massless chiral excitations that can decay or fuse into each other, which we call left- or right-movers. We develop a mean-field description of the Pauli weight in terms of ρ(x,t) , which represents the probability of having nontrivial support at site x and depth t starting from a fixed weight distribution. We develop an equation of state for ρ(x,t) and simulate it numerically using Monte Carlo simulations. For the task of predicting operators with (nearly) full support, we show that DUST outperforms brick-wall Clifford shadows of equal depth. This advantage is further pronounced for small system sizes and our results are generally robust to finite-size effects.
Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the single-qubit (local) Pauli measurement, which is well suited for predicting local operators but inefficient for large operators; and the global Clifford measurement, which is efficient for low-rank operators but infeasible on near-term quantum devices due to the extensive gate overhead. In this work, we demonstrate a scalable classical shadow tomography approach for generic randomized measurements implemented with finite-depth local Clifford random unitary circuits, which interpolates between the limits of Pauli and Clifford measurements. The method combines the recently proposed locally-scrambled classical shadow tomography framework with tensor network techniques to achieve scalability for computing the classical shadow reconstruction map and evaluating various physical properties. The method enables classical shadow tomography to be performed on shallow quantum circuits with superior sample efficiency and minimal gate overhead and is friendly to noisy intermediate-scale quantum (NISQ) devices. We show that the shallow-circuit measurement protocol provides immediate, exponential advantages over the Pauli measurement protocol for predicting quasi-local operators. It also enables a more efficient fidelity estimation compared to the Pauli measurement.
Entangling measurements can reduce the cost of learning many-body correlations. We consider classical shadows in which a fixed unitary on a k-qubit region is sandwiched between two layers of random single-qubit Clifford gates, and ask which middle unitary best estimates Pauli strings with full support on the region. Combining symplectic support counting with a constraint from operator-size parity, we prove that within this architecture the minimum squared shadow norm over all Clifford middle unitaries is Ckopt=4⋅9k/(3⋅5k+3k−6) for odd k and Ckopt=4⋅9k/(3⋅5k−3k+2) for even k. A dual-axis rotation circuit U∗ attains this minimum for every k. Asymptotically Ckopt≃(4/3)⋅(9/5)k: the exponential base of Wu et al.'s contractive unitary is optimal, and the prefactor improves from 2 to 4/3. For 1≤k≤7, exact certificates show that U∗ is optimal over the entire unitary group U(2k), and we conjecture that this holds for every k.
Classical shadows are a powerful method for learning many properties of quantum states in a sample-efficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli operators via "shallow shadows," a recently proposed version of classical shadows in which the randomization step is effected by a local unitary circuit of variable depth t. We show that the shadow norm (the quantity controlling the sample complexity) is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing ("twirling") circuit-namely the evolution of the weight distribution characterizing the number of sites on which an operator acts nontrivially. For spatially contiguous Pauli operators of weight k, this entails a competition between two processes: operator spreading (whereby the support of an operator grows over time, increasing its weight) and operator relaxation (whereby the bulk of the operator develops an equilibrium density of identity operators, decreasing its weight). From this simple picture we derive (i) an upper bound on the shadow norm which, for depth t∼log(k), guarantees an exponential gain in sample complexity over the t=0 protocol in any spatial dimension, and (ii) quantitative results in one dimension within a mean-field approximation, including a universal subleading correction to the optimal depth, found to be in excellent agreement with infinite matrix product state numerical simulations. Our Letter connects fundamental ideas in quantum many-body dynamics to applications in quantum information science, and paves the way to highly optimized protocols for learning different properties of quantum states.
Abstract Efficiently learning expectation values of a quantum state using classical shadow tomography has become a fundamental task in quantum information theory. In a classical shadows protocol, one measures a state in a chosen basis W after it has evolved under a unitary transformation randomly sampled from a chosen distribution U . In this work we study the case where U corresponds to either local or global orthogonal Clifford gates, and W consists of real-valued vectors. Our results show that for various situations of interest, this ‘real’ classical shadow protocol improves the sample complexity over the standard scheme based on general Clifford unitaries. For example, when one is interested in estimating the expectation values of arbitrary real-valued observables, global orthogonal Cliffords typically decrease the required number of samples by a factor of two. More dramatically, for k -local observables composed only of real-valued Pauli operators, sampling local orthogonal Cliffords leads to a reduction by an exponential-in- k factor in the sample complexity over local unitary Cliffords. Finally, we show that by measuring in a basis containing complex-valued vectors, orthogonal shadows can, in the limit of large system size, exactly reproduce the original unitary shadows protocol.
Estimating many local expectation values over time is a central measurement bottleneck in quantum simulation and device characterization. We study the task of reconstructing the Pauli-signal matrix Sij=Tr(Oiρ(tj)) for a collection of M low-weight Pauli observables {Oi}i=1M over N timesteps {tj}j=1N, while minimizing the total number of device shots. We propose a Compressed Sensing Shadow Tomography (CSST) protocol that combines two complementary reductions. First, local classical shadows reduce the observable dimension by enabling many Pauli expectation values to be estimated from the same randomized snapshots at a fixed time. Second, compressed sensing reduces the time dimension by exploiting the fact that many expectation-value traces are spectrally sparse or compressible in a unitary (e.g., Fourier) transform basis. Operationally, CSST samples m≪N timesteps uniformly at random, collects shadows only at those times, and then reconstructs each length-N signal via standard ℓ1-based recovery in the unitary transform domain. We provide end-to-end guarantees that explicitly combine shadow estimation error with compressed sensing recovery bounds. For exactly s-sparse signals in a unitary transform basis, we show that m=O(slog2slogN) random timesteps suffice (with high probability), leading to total-shot savings scaling as Θ(N/s) (i.e., up to polylogarithmic factors) relative to collecting shadows at all N timesteps. For approximately sparse signals, the reconstruction error decomposes into a compressibility (tail) term plus a noise term. We present numerical experiments on noisy many-qubit dynamics that support strong Fourier compressibility of Pauli traces and demonstrate substantial shot reductions with accurate reconstruction.
Quantum shadow tomography based on the classical shadow representation provides an efficient way to estimate properties of an unknown quantum state without performing a full quantum state tomography. In scenarios where estimating the expectation values for only certain classes of observables is required, obtaining information about the entire density matrix is unnecessary. We propose a partial quantum shadow tomography protocol that estimates a subset of density matrix elements relevant to the expectation values of structured observables. Specifically, we identify specific subsets of the tomographically complete set Cl(2)⊗n and a simple pseudo-inverse of the associated channel, which can be used to estimate all elements of the density matrix with the same active order. By restricting the protocol to smaller subsets of single-qubit Pauli measurements, it becomes experimentally more efficient. We demonstrate the advantage over unitary designs, such as the Clifford, full Pauli basis, and methods utilizing mutually unbiased bases, by analytically deriving error bounds and numerically evaluating the protocol on structured operators. We experimentally demonstrate the partial shadow estimation scheme for a wide class of two-qubit states (pure, entangled, and mixed) in the nuclear magnetic resonance (NMR) platform. The full density matrix, reconstructed experimentally by combining different partial estimators, achieves fidelities around 99%.