Sample efficient identity testing and independence testing of quantum states
From MaRDI portal
Cites work
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- A new approach for testing properties of discrete distributions
- A new proof for the existence of mutually unbiased bases
- An automatic inequality prover and instance optimal identity testing
- Combinatorial methods in density estimation
- Efficient quantum tomography
- Efficient quantum tomography. II
- Entanglement is necessary for optimal quantum property testing
- Estimating the unseen, an \(n/\log(n)\)-sample estimator for entropy and support size, shown optimal via new CLTs
- Estimating the unseen, improved estimators for entropy and other properties
- Exponential separation of quantum communication and classical information
- Gentle measurement of quantum states and differential privacy
- High-dimensional robust mean estimation in nearly-linear time
- scientific article; zbMATH DE number 5485550 (Why is no real title available?)
- scientific article; zbMATH DE number 742944 (Why is no real title available?)
- scientific article; zbMATH DE number 7650373 (Why is no real title available?)
- Instance optimal learning of discrete distributions
- Introduction to Property Testing
- Low rank matrix recovery from rank one measurements
- Lower bounds for testing complete positivity and quantum separability
- Minimax Estimation of Functionals of Discrete Distributions
- Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
- Near-Optimal Closeness Testing of Discrete Histogram Distributions
- ON MUTUALLY UNBIASED BASES
- On testing expansion in bounded-degree graphs
- Optimal algorithms and lower bounds for testing closeness of structured distributions
- Optimal algorithms for testing closeness of discrete distributions
- Property testing and its connection to learning and approximation
- Quantum Algorithms for Testing Properties of Distributions
- Quantum spectrum testing
- Quantum state certification
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Robust Characterizations of Polynomials with Applications to Program Testing
- Robust estimators in high dimensions without the computational intractability
- Sample-optimal density estimation in nearly-linear time
- Sample-optimal tomography of quantum states
- Shadow tomography of quantum states
- Sublinear algorithms for testing monotone and unimodal distributions
- Testing k-modal distributions: optimal algorithms via reductions
- Testing conditional independence of discrete distributions
- Testing Ising models
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- Testing shape restrictions of discrete distributions
- Testing Statistical Hypotheses
- The complexity of approximating entropy
- The learnability of quantum states
- The Power of Linear Estimators
This page was built for publication: Sample efficient identity testing and independence testing of quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229294)
