Cover Image

On the sample complexity of purity and inner product estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gong, Weiyuan, Haferkamp, Jonas, Ye, Qi, Zhang, Zhihan
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Data Structures and Algorithms Information Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

An optimal tradeoff between entanglement and copy complexity for state tomography
by: Chen, Sitan, et al.
Published: (2024)

Improved classical shadows from local symmetries in the Schur basis
by: Grier, Daniel, et al.
Published: (2024)

Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
by: Gong, Weiyuan, et al.
Published: (2025)

Simple algorithms to test and learn local Hamiltonians
by: Gutiérrez, Francisco Escudero
Published: (2024)

Hamiltonian Property Testing
by: Bluhm, Andreas, et al.
Published: (2024)

Optimal certification of constant-local Hamiltonians
by: Lee, Junseo, et al.
Published: (2025)

Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
by: Gong, Weiyuan, et al.
Published: (2023)

A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
by: Wang, Xinzhao, et al.
Published: (2022)

Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
by: Zhou, Shuo, et al.
Published: (2026)

The PRODSAT phase of random quantum satisfiability
by: Lee, Joon, et al.
Published: (2024)

Quantum search in a dictionary based on fingerprinting-hashing
by: Ablayev, Farid, et al.
Published: (2024)

Quantum Channel Certification with Incoherent Strategies
by: Fawzi, Omar, et al.
Published: (2023)

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
by: Chee, Yeow Meng, et al.
Published: (2023)

Predicting quantum channels over general product distributions
by: Chen, Sitan, et al.
Published: (2024)

The SMART approach to instance-optimal online learning
by: Banerjee, Siddhartha, et al.
Published: (2024)

Learning multivariate Gaussians with imperfect advice
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Entropy Coding of Unordered Data Structures
by: Kunze, Julius, et al.
Published: (2024)

Learning DNF through Generalized Fourier Representations
by: Heidari, Mohsen, et al.
Published: (2025)

Testing with Non-identically Distributed Samples
by: Garg, Shivam, et al.
Published: (2023)

Subsampling Suffices for Adaptive Data Analysis
by: Blanc, Guy
Published: (2023)

Learning Partitions with Optimal Query and Round Complexities
by: Black, Hadley, et al.
Published: (2025)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

Smoothed Score Queries and the Complexity of Sampling
by: Liu, Jingbo
Published: (2026)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
by: Black, Hadley, et al.
Published: (2025)

Sample-Optimal Private Regression in Polynomial Time
by: Anderson, Prashanti, et al.
Published: (2025)

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm
by: Chen, Jiale, et al.
Published: (2025)

Mean estimation in the add-remove model of differential privacy
by: Kulesza, Alex, et al.
Published: (2023)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
by: Saha, Barna, et al.
Published: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
by: Song, Zhao, et al.
Published: (2026)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
by: Chen, Tyler, et al.
Published: (2025)

Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer
by: Wang, Qisheng, et al.
Published: (2024)

Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)

The Information Theory of Similarity
by: Phadke, Nikit
Published: (2025)

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

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
by: Zhou, Leo, et al.
Published: (2024)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
by: Basiri, Salar, et al.
Published: (2022)

Distribution Learnability and Robustness
by: Ben-David, Shai, et al.
Published: (2024)