State-Based Classical Shadows

• URL: http://arxiv.org/abs/2507.10362v1
• Date: Mon, 14 Jul 2025 15:03:43 GMT
• Title: State-Based Classical Shadows
• Authors: Zvika Brakerski, Nir Magrafta, Tomer Solomon,
• Abstract summary: Classical Shadow Tomography is a method for creating a classical snapshot of an unknown quantum state.<n>We show that suitable distributions over emphstates can be used as the building block instead.<n> cryptographically-inspired analysis shows that for emphefficiently computable observables, it suffices to use emphpseudorandom families of states.
• Score: 4.710921988115686
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical Shadow Tomography (Huang, Kueng and Preskill, Nature Physics 2020) is a method for creating a classical snapshot of an unknown quantum state, which can later be used to predict the value of an a-priori unknown observable on that state. In the short time since their introduction, classical shadows received a lot of attention from the physics, quantum information, and quantum computing (including cryptography) communities. In particular there has been a major effort focused on improving the efficiency, and in particular depth, of generating the classical snapshot. Existing constructions rely on a distribution of unitaries as a central building block, and research is devoted to simplifying this family as much as possible. We diverge from this paradigm and show that suitable distributions over \emph{states} can be used as the building block instead. Concretely, we create the snapshot by entangling the unknown input state with an independently prepared auxiliary state, and measuring the resulting entangled state. This state-based approach allows us to consider a building block with arguably weaker properties that has not been studied so far in the context of classical shadows. Notably, our cryptographically-inspired analysis shows that for \emph{efficiently computable} observables, it suffices to use \emph{pseudorandom} families of states. To the best of our knowledge, \emph{computational} classical shadow tomography was not considered in the literature prior to our work. Finally, in terms of efficiency, the online part of our method (i.e.\ the part that depends on the input) is simply performing a measurement in the Bell basis, which can be done in constant depth using elementary gates.

Related papers

• Is Lindblad for me? [56.71474844967995]
  The Lindblad master equation is a foundational tool for modeling the dynamics of open quantum systems.<n>We re-examine the folklore surrounding its three standard approximations.<n>We offer a checklist that contrasts common lore with refined expectations.
  arXiv  Detail & Related papers  (2025-06-27T17:59:59Z)
• In the shadow of the Hadamard test: Using the garbage state for good and further modifications [0.9421843976231369]
  This work combines the Hadamard test on a single auxiliary readout qubit with classical shadows on the remaining $n$-qubit work register.<n>There, we can use the Hadamard test to estimate eigenvalues on the auxiliary qubit, while classical shadows on the remaining $n$ qubits provide access to additional features.
  arXiv  Detail & Related papers  (2025-05-21T18:06:58Z)
• (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
  Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects. Despite its strength, indifferentiability is not known to offer security against pre-processing attacks. We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
  arXiv  Detail & Related papers  (2024-10-22T00:41:47Z)
• Quantum-state texture and gate identification [55.2480439325792]
  We show that texture of an arbitrary quantum state is adequately described by an easily computable monotone. It is shown that textures are useful in the characterization of unknown quantum gates in universal circuit layers.
  arXiv  Detail & Related papers  (2024-09-10T13:11:34Z)
• Quantum information with quantum-like bits [0.0]
  We show how arbitrary gates can be implemented by manipulating many-body correlations.<n>This suggests the possibility of quantum-like information processing on a special class of many-body classical systems.
  arXiv  Detail & Related papers  (2024-08-12T20:40:54Z)
• Shadow tomography with noisy readouts [0.0]
  Shadow tomography is a scalable technique to characterise the quantum state of a quantum computer or quantum simulator. By construction, classical shadows are intrinsically sensitive to readout noise. We show that classical shadows accept much more flexible constructions beyond the standard ones.
  arXiv  Detail & Related papers  (2023-10-26T11:47:51Z)
• Overlapping qubits from non-isometric maps and de Sitter tensor networks [41.94295877935867]
  We show that processes in local effective theories can be spoofed with a quantum system with fewer degrees of freedom. We highlight how approximate overlapping qubits are conceptually connected to Hilbert space dimension verification, degree-of-freedom counting in black holes and holography.
  arXiv  Detail & Related papers  (2023-04-05T18:08:30Z)
• 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)
• On Classical and Hybrid Shadows of Quantum States [0.0]
  Classical shadows are a computationally efficient approach to storing quantum states on a classical computer. We discuss the advantages and limitations of using classical shadows to simulate many-body dynamics. We introduce the notion of a hybrid shadow, constructed from measurements on a part of the system instead of the entirety.
  arXiv  Detail & Related papers  (2022-06-14T06:25:24Z)
• A Bayesian analysis of classical shadows [0.2867517731896504]
  We investigate classical shadows through the lens of Bayesian mean estimation (BME) In direct tests on numerical data, BME is found to attain significantly lower error on average, but classical shadows prove remarkably more accurate in specific situations. We introduce an observable-oriented pseudo-likelihood that successfully emulates the dimension-independence and state-specific optimality of classical shadows.
  arXiv  Detail & Related papers  (2020-12-16T14:45:18Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• 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)
• Contextuality in entanglement-assisted one-shot classical communication [0.0]
  In the zero-error regime, entanglement can increase the oneshot zero-error capacity of a family of classical channels. We show that preparation contextuality powers the quantum advantage in this task increasing the one-shot success probability.
  arXiv  Detail & Related papers  (2020-05-31T08:37:12Z)

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.