Direct reconstruction of the quantum density matrix elements with classical shadow tomography
- URL: http://arxiv.org/abs/2505.15243v1
- Date: Wed, 21 May 2025 08:19:39 GMT
- Title: Direct reconstruction of the quantum density matrix elements with classical shadow tomography
- Authors: Yu Wang,
- Abstract summary: We introduce a direct estimation framework for reconstructing multiple density matrix elements of an unknown quantum state using classical shadow tomography.<n>We prove that estimating (K) off-diagonal matrix elements up to additive error (epsilon) requires only (mathcalO(log K/epsilon2)) samples.<n>When extended to full state tomography, our method attains trace distance error (le epsilon) with sample complexity (mathcalO(d3 log d/
- Score: 3.19428095493284
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce a direct estimation framework for reconstructing multiple density matrix elements of an unknown quantum state using classical shadow tomography. Traditional direct measurement protocols (DMPs), while effective for individual elements, suffer from poor scalability due to post-selection losses and the need for element-specific measurement configurations. In contrast, our method, DMP-ST, leverages random Clifford or biased mutually unbiased basis measurements to enable global estimation: a single dataset suffices to estimate arbitrary off-diagonal entries with high accuracy. We prove that estimating \(K\) off-diagonal matrix elements up to additive error \(\epsilon\) requires only \(\mathcal{O}(\log K/\epsilon^2)\) samples, achieving exponential improvement over conventional DMPs. The number of required measurement configurations can also be exponentially reduced for large K. When extended to full state tomography, DMP-ST attains trace distance error \(\le \epsilon\) with sample complexity \(\mathcal{O}(d^3 \log d/\epsilon^2)\), which is closed to the optimal scaling for single-copy measurements. Moreover, biased MUB measurements reduce sample complexity by a constant factor than random Clifford measurements. This work provides both theoretical guarantees and explicit protocols for efficient, entrywise quantum state reconstruction. It significantly advances the practicality of direct tomography, especially for high-dimensional systems and near-term quantum platforms.
Related papers
- Partial Quantum Shadow Tomography for Structured Operators and its Experimental Demonstration using NMR [0.0]
We propose a partial quantum shadow tomography protocol, which allows estimation of a subset of density matrix elements.<n>We experimentally demonstrate the partial shadow estimation scheme for a wide class of two-qubit states.
arXiv Detail & Related papers (2025-03-18T17:57:54Z) - Reconstruction of quantum states by applying an analytical optimization model [1.0499611180329804]
We show that when restricting the measurement sample size, improvement over existing algorithms can be achieved.<n>Our findings underline the multiplicity of solutions in the reconstruction problem, depending upon the generated state and measurement model utilized.
arXiv Detail & Related papers (2025-01-13T15:21:08Z) - Contractive Unitary and Classical Shadow Tomography [8.406921897932131]
Full quantum state tomography requires an exponential number of measurements in system size.<n>This work shows that a random-deterministic hybridized protocol can be more efficient than fully random measurements.
arXiv Detail & Related papers (2024-11-28T18:59:12Z) - Precision Bounds on Continuous-Variable State Tomography using Classical
Shadows [0.46603287532620735]
We recast experimental protocols for continuous-variable quantum state tomography in the classical-shadow framework.
We analyze the efficiency of homodyne, heterodyne, photon number resolving (PNR), and photon-parity protocols.
numerical and experimental homodyne tomography significantly outperforms our bounds.
arXiv Detail & Related papers (2022-11-09T19:01:13Z) - Lower bounds for learning quantum states with single-copy measurements [3.2590610391507444]
We study the problems of quantum tomography and shadow tomography using measurements performed on individual copies of an unknown $d$-dimensional state.
In particular, this rigorously establishes the optimality of the folklore Pauli tomography" algorithm in terms of its complexity.
arXiv Detail & Related papers (2022-07-29T02:26:08Z) - Quantum state tomography with tensor train cross approximation [84.59270977313619]
We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings.
Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
arXiv Detail & Related papers (2022-07-13T17:56:28Z) - Neural network enhanced measurement efficiency for molecular
groundstates [63.36515347329037]
We adapt common neural network models to learn complex groundstate wavefunctions for several molecular qubit Hamiltonians.
We find that using a neural network model provides a robust improvement over using single-copy measurement outcomes alone to reconstruct observables.
arXiv Detail & Related papers (2022-06-30T17:45:05Z) - Mixed Precision Low-bit Quantization of Neural Network Language Models
for Speech Recognition [67.95996816744251]
State-of-the-art language models (LMs) represented by long-short term memory recurrent neural networks (LSTM-RNNs) and Transformers are becoming increasingly complex and expensive for practical applications.
Current quantization methods are based on uniform precision and fail to account for the varying performance sensitivity at different parts of LMs to quantization errors.
Novel mixed precision neural network LM quantization methods are proposed in this paper.
arXiv Detail & Related papers (2021-11-29T12:24:02Z) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z) - Improving Metric Dimensionality Reduction with Distributed Topology [68.8204255655161]
DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term.
We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets.
arXiv Detail & Related papers (2021-06-14T17:19:44Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.