Improved Classical Shadow Tomography Using Quantum Computation

• URL: http://arxiv.org/abs/2505.14953v1
• Date: Tue, 20 May 2025 22:28:46 GMT
• Title: Improved Classical Shadow Tomography Using Quantum Computation
• Authors: Zahra Honjani, Mohsen Heidari,
• Abstract summary: 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.<n>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.
• Score: 9.576327614980395
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• The Efficiency Frontier: Classical Shadows versus Quantum Footage [12.845988703864407]
  Interfacing quantum and classical processors is an important subroutine in full-stack quantum algorithms.<n>The so-called "classical shadow" method efficiently extracts essential classical information from quantum states.<n>But for a small number of highly non-local observables, or when classical post-processing power is limited, the classical shadow method is not always the most efficient choice.
  arXiv  Detail & Related papers  (2025-09-07T21:46:56Z)
• Quantum phase classification via quantum hypothesis testing [0.39102514525861415]
  We propose a classification algorithm based on the quantum Neyman-Pearson test, which is theoretically optimal for distinguishing between two quantum states.<n>Our results show that the proposed method achieves lower classification error probabilities and significantly reduces the training cost.<n>These findings highlight the potential of quantum hypothesis testing as a powerful tool for quantum phase classification.
  arXiv  Detail & Related papers  (2025-04-05T08:23:45Z)
• Shadow measurements for feedback-based quantum optimization [0.0]
  We present an implementation of the recently introduced Feedback-based algorithm for quantum optimization (FALQON) with the Ket quantum programming platform.<n>We employ classical shadows for the feedback routine of parameter estimation and compare this approach with the direct estimation of observables.<n>Our results show that depending on the graph geometry for the MaxCut problem, the number of measurements required to estimate expected values of observables with classical shadows can be up to 16 times lower than with direct observable estimation.
  arXiv  Detail & Related papers  (2025-02-27T18:36:30Z)
• Learning to Classify Quantum Phases of Matter with a Few Measurements [41.94295877935867]
  We study the identification of quantum phases of matter, at zero temperature, when only part of the phase diagram is known in advance. We show how to use our previous knowledge to construct an observable capable of classifying the phase even in the unknown region. An important application of our findings is the classification of the phases of matter obtained in quantum simulators.
  arXiv  Detail & Related papers  (2024-09-08T18:52:34Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A composite measurement scheme for efficient quantum observable estimation [2.4792831406904026]
  We propose a new approach, composite measurement scheme, which composes multiple measurement schemes by distributing shots to them with a trainable ratio. We numerically demonstrate C-LBCS on molecular systems up to $mathCO$ (30bits) and show that C-LBCS outperforms the previous state-of-the-art methods despite its simplicity.
  arXiv  Detail & Related papers  (2023-05-03T21:50:36Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Experimental single-setting quantum state tomography [2.510118175122992]
  Quantum computers solve ever more complex tasks using steadily growing system sizes. Gold-standard is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge. We demonstrate a scalable and practical QST approach that uses a single measurement setting.
  arXiv  Detail & Related papers  (2022-05-31T18:00:04Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum scrambling with classical shadows [1.3496380954381821]
  The four-point out-of-time-ordered correlator (OTOC) is traditionally used to quantify quantum information scrambling under many-body dynamics. Due to the OTOC's unusual time ordering, its measurement is challenging. We propose higher-point OTOCs to reveal early-time scrambling behavior, and present protocols to measure any higher-point OTOC.
  arXiv  Detail & Related papers  (2021-02-01T17:37:39Z)
• Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
  We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy. The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory. Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
  arXiv  Detail & Related papers  (2020-09-17T11:28:41Z)

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.