pith. sign in

arxiv: 2408.05279 · v1 · pith:FMNC7NKInew · submitted 2024-08-09 · 🪐 quant-ph

Classical shadows with symmetries

classification 🪐 quant-ph
keywords classicalobservablesshadowscasegenericknowledgeprovidedquantum
0
0 comments X
read the original abstract

Classical shadows (CS) have emerged as a powerful way to estimate many properties of quantum states based on random measurements and classical post-processing. In their original formulation, they come with optimal (or close to) sampling complexity guarantees for generic states and generic observables. Still, it is natural to expect to even further lower sampling requirements when equipped with a priori knowledge regarding either the underlying state or the observables. Here, we consider the case where such knowledge is provided in terms of symmetries of the unknown state or of the observables. Criterion and guidelines for symmetric shadows are provided. As a concrete example we focus on the case of permutation invariance (PI), and detail constructions of several families of PI-CSs. In particular, building on results obtained in the field of PI quantum tomography, we develop and study shallow PI-CS protocol. Benefits of these symmetric CS are demonstrated compared to established CS protocols showcasing vastly improved performances.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum machine learning models for graphs

    quant-ph 2026-07 unverdicted novelty 7.0

    Characterizes constituents of n-qubit graph quantum ML models and supplies a toolbox enabling integration with classical models, generalization of prior GQML approaches, and classical pre-training.

  2. Particle-preserving fermionic shadows with mode-independent sample complexity

    quant-ph 2026-06 unverdicted novelty 7.0

    Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.

  3. RandomMeas.jl: A Julia Package for Randomized Measurements in Quantum Devices

    quant-ph 2025-09 conditional novelty 6.0

    RandomMeas.jl is a modular Julia package implementing randomized measurement protocols and classical shadow estimators for quantum computing applications.

  4. Quantum Convolutional Neural Networks are Effectively Classically Simulable

    quant-ph 2024-08 unverdicted novelty 6.0

    QCNNs are classically simulable via Pauli shadows on low-bodyness subspaces of locally-easy datasets, with explicit simulation demonstrated up to 1024 qubits for phases of matter classification.