Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2505.14953 · IEEE International Symposium on Information Theory (ISIT)

Improved Classical Shadow Tomography Using Quantum Computation

Zahra Honjani, Mohsen Heidari

Published Jun 22, 2025• 0 citations
arXivHTMLPDF

Abstract

Classical shadow tomography (CST) involves obtaining enough classical descriptions of an unknown state via quantum measurements to predict the outcome of a set of quantum observables. CST has numerous applications, particularly in algorithms that utilize quantum data for tasks such as learning, detection, and optimization. This paper introduces a new CST procedure that exponentially reduces the space complexity and quadratically improves the running time of CST with single-copy measurements. The approach utilizes a quantum-to-classical-to-quantum process to prepare quantum states that represent shadow snapshots, which can then be directly measured by the observables of interest. With that, calculating large matrix traces is avoided, resulting in improvements in running time and space complexity. The paper presents analyses of the proposed methods for CST, with Pauli measurements and Clifford circuits.

DOI
10.1109/isit63088.2025.11195326

Related papers

Hamiltonian-driven shadow tomography of quantum states

Hong-Ye Hu, Yi‐Zhuang You

Classical shadow tomography provides an efficient method for predicting functions of an unknown quantum state from a few measurements of the state. It relies on a unitary channel that efficiently scrambles the quantum information of the state to the measurement basis. Facing the challenge of realizing deep unitary circuits on near-term quantum devices, we explore the scenario in which the unitary channel can be shallow and is generated by a quantum chaotic Hamiltonian via time evolution. We provide an unbiased estimator of the density matrix for all ranges of the evolution time. We analyze the sample complexity of the Hamiltonian-driven shadow tomography. For Pauli observables, we find that it can be more efficient than the unitary-2-design-based shadow tomography in a sequence of intermediate time windows that range from an order-1 scrambling time to a timescale of ${D}^{1/6}$, given the Hilbert space dimension $D$. In particular, the efficiency of predicting diagonal Pauli observables is improved by a factor of $D$ without sacrificing the efficiency of predicting off-diagonal Pauli observables.

arXiv:2102.10132•Physical Review Research•Jan 28, 2022•47 citations

Shadow bootstrapping: Nearly minimal-setting pure-state tomography with shallow Clifford measurements

Gyungmin Cho, Dohun Kim

We present a pure-state tomography algorithm that uses a nearly minimal number of measurement settings while achieving optimal sample complexity with nonadaptive single-copy shallow Clifford measurements. For an arbitrary $n$-qubit pure state $|ψ\rangle \in \mathbb{C}^{d}$, where $d=2^n$, the algorithm uses $O(d/ε)$ copies and $\widetilde{O}(1)$ measurement settings to output a state vector $|\hatψ\rangle$ satisfying $1-|\langleψ|\hatψ\rangle|^2\leε$ with high probability. Each measurement is implemented by a Clifford circuit of depth $O(\log n)$. Reusing each measurement setting allows the data to be stored compactly as per-basis outcome histograms. Given these histograms, classical post-processing runs in $\widetilde{O}(d)$ time. Our key technique, \textit{shadow bootstrapping}, uses the current estimate to reduce the variance of subsequent residual estimation, enabling progressively more accurate reconstruction with only a constant number of new measurement settings per stage.

arXiv:2611.06073•Nov 4, 2026•0 citations

Optimal strategies for shadow tomography with limited resources

Zhen-Peng Xu, Qi Ye, Jie Wang +3 more

Shadow tomography addresses the task of efficiently predicting many expectation values of an unknown quantum state from randomized measurements on comparatively few copies. Existing analyses promise large scaling advantages, but the optimal strategies realizing these guarantees are not always known, and the required measurements are potentially challenging to implement on current hardware. We address this gap for Pauli observables by computing optimal sample-complexity parameters and constructing optimal measurement strategies under realistic resource constraints. We focus on memoryless protocols, where each copy is measured only once, and on measurements with bounded interaction range. Our approach reduces the problem to the analysis of graph parameters of the frustration graph encoding the Pauli anticommutation relations. We provide efficient numerical methods for the general case and analytically prove that Clifford measurements are optimal in many situations. This includes all perfect graphs, all single-qubit, all two-qubit measurement scenarios, and more. Applied to Hamiltonian energy estimation, our framework yields constructive strategies and improved variance bounds for molecular benchmarks.

quant-pharXiv:2608.08429•Aug 11, 2026•3 citations

Scalable and Flexible Classical Shadow Tomography with Tensor Networks

Ahmed A. Akhtar, Hong-Ye Hu, Yi‐Zhuang You

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.

arXiv:2209.02093•Quantum•Jun 1, 2023•76 citations

Classical shadows for quantum process tomography on near-term quantum computers

Ryan Levy, Di Luo, Bryan K. Clark

Quantum process tomography is a powerful tool for understanding quantum channels and characterizing the properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and J. Preskill, .], we have developed ShadowQPT, a classical shadow method for quantum process tomography. We introduce two related formulations with and without ancilla qubits. ShadowQPT stochastically reconstructs the Choi matrix of the device allowing for an classical evaluation of the device on arbitrary inputs with respect to arbitrary outputs. Using shadows, we then show how to compute overlaps, generate all k -weight reduced processes, and perform reconstruction via Hamiltonian learning. These latter two tasks are efficient for large systems as the number of quantum measurements needed scales only logarithmically with the number of qubits. A number of additional approximations and improvements are developed, including the use of a pair-factorized Clifford shadow and a series of postprocessing techniques that significantly enhance the accuracy for recovering the quantum channel. We have implemented ShadowQPT using both Pauli and Clifford measurements on the IonQ trapped ion quantum computer for quantum processes up to n=4 qubits, and we achieved good performance. Published by the American Physical Society 2024

arXiv:2110.02965•Physical Review Research•Jan 10, 2024•105 citations

A computationally efficient approach to quantum state reconstruction using robust classical shadows

Sanjay Sharma, Shyam Akashe, Govind Murari Upadhyay +1 more

Quantum state tomography is a fundamental technique for characterizing quantum systems, but its scalability remains a significant challenge. This paper investigates an efficient alternative using classical shadows to reconstruct a Bell state with high fidelity. Classical shadows provide a compressed representation of a quantum state using randomized measurements, reducing the measurement complexity compared to full quantum tomography when full state reconstruction is not required. We employed a quantum circuit to generate a Bell state and utilize 1000 snapshots to construct its classical shadow. The reconstructed density matrix is evaluated using fidelity and norm difference metrics against the ideal Bell state. Our analysis demonstrates that as the number of snapshots increases, the fidelity of reconstruction stabilizes around 0.98-1.0, with the norm difference decreasing accordingly. The results also confirm the convergence of reconstructed states towards the ideal Bell state, highlighting the efficiency and accuracy of classical shadows in quantum state estimation. Shallow shadow tomography uses shallow random circuits to estimate global quantum state properties on noisy hardware. By combining low-depth entangling gates with randomized measurements and noise-aware postprocessing, it reduces sample complexity compared to Pauli shadows while remaining experimentally feasible. Recent experiments on superconducting processors confirmed up to fivefold measurement savings.

Scientific Reports•Feb 2, 2026•0 citations
Classical shadow tomography (CST) involves obtaining enough classical descriptions of an unknown state via quantum measurements to predict the outcome of a set of quantum observables. CST has numerous applications, particularly in algorithms that utilize quantum data for tasks such as learning, detection, and optimization. This paper introduces a new CST procedure that exponentially reduces the space complexity and quadratically improves the running time of CST with single-copy measurements. The approach utilizes a quantum-to-classical-to-quantum process to prepare quantum states that represent shadow snapshots, which can then be directly measured by the observables of interest. With that, calculating large matrix traces is avoided, resulting in improvements in running time and space complexity. The paper presents analyses of the proposed methods for CST, with Pauli measurements and Clifford circuits.
Classical shadow tomography provides an efficient method for predicting functions of an unknown quantum state from a few measurements of the state. It relies on a unitary channel that efficiently scrambles the quantum information of the state to the measurement basis. Facing the challenge of realizing deep unitary circuits on near-term quantum devices, we explore the scenario in which the unitary channel can be shallow and is generated by a quantum chaotic Hamiltonian via time evolution. We provide an unbiased estimator of the density matrix for all ranges of the evolution time. We analyze the sample complexity of the Hamiltonian-driven shadow tomography. For Pauli observables, we find that it can be more efficient than the unitary-2-design-based shadow tomography in a sequence of intermediate time windows that range from an order-1 scrambling time to a timescale of D1/6{D}^{1/6}D1/6, given the Hilbert space dimension DDD. In particular, the efficiency of predicting diagonal Pauli observables is improved by a factor of DDD without sacrificing the efficiency of predicting off-diagonal Pauli observables.
We present a pure-state tomography algorithm that uses a nearly minimal number of measurement settings while achieving optimal sample complexity with nonadaptive single-copy shallow Clifford measurements. For an arbitrary nnn-qubit pure state ∣ψ⟩∈Cd|ψ\rangle \in \mathbb{C}^{d}∣ψ⟩∈Cd, where d=2nd=2^nd=2n, the algorithm uses O(d/ε)O(d/ε)O(d/ε) copies and O~(1)\widetilde{O}(1)O(1) measurement settings to output a state vector ∣ψ^⟩|\hatψ\rangle∣ψ^​⟩ satisfying 1−∣⟨ψ∣ψ^⟩∣2≤ε1-|\langleψ|\hatψ\rangle|^2\leε1−∣⟨ψ∣ψ^​⟩∣2≤ε with high probability. Each measurement is implemented by a Clifford circuit of depth O(log⁡n)O(\log n)O(logn). Reusing each measurement setting allows the data to be stored compactly as per-basis outcome histograms. Given these histograms, classical post-processing runs in O~(d)\widetilde{O}(d)O(d) time. Our key technique, \textit{shadow bootstrapping}, uses the current estimate to reduce the variance of subsequent residual estimation, enabling progressively more accurate reconstruction with only a constant number of new measurement settings per stage.
Shadow tomography addresses the task of efficiently predicting many expectation values of an unknown quantum state from randomized measurements on comparatively few copies. Existing analyses promise large scaling advantages, but the optimal strategies realizing these guarantees are not always known, and the required measurements are potentially challenging to implement on current hardware. We address this gap for Pauli observables by computing optimal sample-complexity parameters and constructing optimal measurement strategies under realistic resource constraints. We focus on memoryless protocols, where each copy is measured only once, and on measurements with bounded interaction range. Our approach reduces the problem to the analysis of graph parameters of the frustration graph encoding the Pauli anticommutation relations. We provide efficient numerical methods for the general case and analytically prove that Clifford measurements are optimal in many situations. This includes all perfect graphs, all single-qubit, all two-qubit measurement scenarios, and more. Applied to Hamiltonian energy estimation, our framework yields constructive strategies and improved variance bounds for molecular benchmarks.
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.
Quantum process tomography is a powerful tool for understanding quantum channels and characterizing the properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and J. Preskill, .], we have developed ShadowQPT, a classical shadow method for quantum process tomography. We introduce two related formulations with and without ancilla qubits. ShadowQPT stochastically reconstructs the Choi matrix of the device allowing for an classical evaluation of the device on arbitrary inputs with respect to arbitrary outputs. Using shadows, we then show how to compute overlaps, generate all k -weight reduced processes, and perform reconstruction via Hamiltonian learning. These latter two tasks are efficient for large systems as the number of quantum measurements needed scales only logarithmically with the number of qubits. A number of additional approximations and improvements are developed, including the use of a pair-factorized Clifford shadow and a series of postprocessing techniques that significantly enhance the accuracy for recovering the quantum channel. We have implemented ShadowQPT using both Pauli and Clifford measurements on the IonQ trapped ion quantum computer for quantum processes up to n=4 qubits, and we achieved good performance. Published by the American Physical Society 2024
Quantum state tomography is a fundamental technique for characterizing quantum systems, but its scalability remains a significant challenge. This paper investigates an efficient alternative using classical shadows to reconstruct a Bell state with high fidelity. Classical shadows provide a compressed representation of a quantum state using randomized measurements, reducing the measurement complexity compared to full quantum tomography when full state reconstruction is not required. We employed a quantum circuit to generate a Bell state and utilize 1000 snapshots to construct its classical shadow. The reconstructed density matrix is evaluated using fidelity and norm difference metrics against the ideal Bell state. Our analysis demonstrates that as the number of snapshots increases, the fidelity of reconstruction stabilizes around 0.98-1.0, with the norm difference decreasing accordingly. The results also confirm the convergence of reconstructed states towards the ideal Bell state, highlighting the efficiency and accuracy of classical shadows in quantum state estimation. Shallow shadow tomography uses shallow random circuits to estimate global quantum state properties on noisy hardware. By combining low-depth entangling gates with randomized measurements and noise-aware postprocessing, it reduces sample complexity compared to Pauli shadows while remaining experimentally feasible. Recent experiments on superconducting processors confirmed up to fivefold measurement savings.