Cover Image

Efficient Pauli channel estimation with logarithmic quantum memory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Sitan, Gong, Weiyuan
Format:	Preprint
Published:	2023
Subjects:	Quantum Physics Computational Complexity Information Theory Machine Learning Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Noisy Quantum Learning Theory
by: Cotler, Jordan, et al.
Published: (2025)

Optimal tradeoffs for estimating Pauli observables
by: Chen, Sitan, et al.
Published: (2024)

Learning to erase quantum states: thermodynamic implications of quantum learning theory
by: Zhao, Haimeng, et al.
Published: (2025)

Adaptivity can help exponentially for shadow tomography
by: Chen, Sitan, et al.
Published: (2024)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
by: Lou, Mengqi, et al.
Published: (2025)

Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
by: Chen, Sitan, et al.
Published: (2024)

Information-theoretic generalization bounds for learning from quantum data
by: Caro, Matthias, et al.
Published: (2023)

On the undecidability of quantum channel capacities
by: Bhattacharyya, Archishna, et al.
Published: (2026)

Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility
by: Chen, Zhenyu, et al.
Published: (2025)

A learning theory for quantum photonic processors and beyond
by: Rosati, Matteo
Published: (2022)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
by: Chen, Sitan, et al.
Published: (2025)

Lower Bounds for Learning Quantum States with Single-Copy Measurements
by: Lowe, Angus, et al.
Published: (2022)

Exponential quantum advantage in processing massive classical data
by: Zhao, Haimeng, et al.
Published: (2026)

Computational hardness of estimating quantum entropies via binary entropy bounds
by: Liu, Yupan
Published: (2026)

The Exact Replica Threshold for Nonlinear Moments of Quantum States
by: Zeng, Shuai
Published: (2026)

Tight bounds on Pauli channel learning without entanglement
by: Chen, Senrui, et al.
Published: (2023)

A simple lower bound for the complexity of estimating partition functions on a quantum computer
by: Chen, Zherui, et al.
Published: (2024)

Learning and Generating Mixed States Prepared by Shallow Channel Circuits
by: Hu, Fangjun, et al.
Published: (2026)

An invitation to the sample complexity of quantum hypothesis testing
by: Cheng, Hao-Chung, et al.
Published: (2024)

Instance-optimal high-precision shadow tomography with few-copy measurements: A metrological approach
by: Chen, Senrui, et al.
Published: (2026)

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation
by: Chen, Sitan, et al.
Published: (2026)

The vast world of quantum advantage
by: Huang, Hsin-Yuan, et al.
Published: (2025)

Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Exponential speedups in fault-tolerant processing of quantum experiments
by: Kannan, Ishaan, et al.
Published: (2026)

Exact spectral gaps of random one-dimensional quantum circuits
by: Deneris, Andrew E., et al.
Published: (2024)

The role of shared randomness in quantum state certification with unentangled measurements
by: Liu, Yuhan, et al.
Published: (2024)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
by: Lin, Ting-Chun
Published: (2024)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
by: Liu, Yupan
Published: (2023)

A slightly improved upper bound for quantum statistical zero-knowledge
by: Gall, François Le, et al.
Published: (2025)

Random Circuit Sampling: Fourier Expansion and Statistics
by: Kalai, Gil, et al.
Published: (2024)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
by: Dinur, Irit, et al.
Published: (2024)

Optimal high-precision shadow estimation
by: Chen, Sitan, et al.
Published: (2024)

Approximate Computation via Le Cam Simulability
by: Akdemir, Deniz
Published: (2025)

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
by: Chen, Siyu, et al.
Published: (2025)

Causal Discovery under Latent Class Confounding
by: Mazaheri, Bijan, et al.
Published: (2023)

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
by: Buhai, Rares-Darius, et al.
Published: (2024)

Learning High-dimensional Gaussians from Censored Data
by: Bhattacharyya, Arnab, et al.
Published: (2025)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
by: Wein, Alexander S.
Published: (2025)

Improved Hardness Results for Learning Intersections of Halfspaces
by: Tiegel, Stefan
Published: (2024)

On the Hardness of Learning One Hidden Layer Neural Networks
by: Li, Shuchen, et al.
Published: (2024)