Image de couverture de livre

An optimal tradeoff between entanglement and copy complexity for state tomography

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Sitan, Li, Jerry, Liu, Allen
Format:	Preprint
Publié:	2024
Sujets:	Quantum Physics Data Structures and Algorithms Information Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal high-precision shadow estimation
par: Chen, Sitan, et autres
Publié: (2024)

On the sample complexity of purity and inner product estimation
par: Gong, Weiyuan, et autres
Publié: (2024)

Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
par: Chen, Sitan, et autres
Publié: (2024)

Predicting quantum channels over general product distributions
par: Chen, Sitan, et autres
Publié: (2024)

Improved classical shadows from local symmetries in the Schur basis
par: Grier, Daniel, et autres
Publié: (2024)

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation
par: Chen, Sitan, et autres
Publié: (2026)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
par: Chen, Sitan, et autres
Publié: (2025)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
par: Gupta, Shivam, et autres
Publié: (2024)

The SMART approach to instance-optimal online learning
par: Banerjee, Siddhartha, et autres
Publié: (2024)

Provably learning a multi-head attention layer
par: Chen, Sitan, et autres
Publié: (2024)

Optimal Quantum State Testing Even with Limited Entanglement
par: Wadhwa, Chirag, et autres
Publié: (2026)

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

Hamiltonian Property Testing
par: Bluhm, Andreas, et autres
Publié: (2024)

Optimal certification of constant-local Hamiltonians
par: Lee, Junseo, et autres
Publié: (2025)

Unrolled denoising networks provably learn optimal Bayesian inference
par: Karan, Aayush, et autres
Publié: (2024)

A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
par: Wang, Xinzhao, et autres
Publié: (2022)

Structure learning of Hamiltonians from real-time evolution
par: Bakshi, Ainesh, et autres
Publié: (2024)

Learning quantum Hamiltonians at any temperature in polynomial time
par: Bakshi, Ainesh, et autres
Publié: (2023)

Smoothed Score Queries and the Complexity of Sampling
par: Liu, Jingbo
Publié: (2026)

(No) Quantum space-time tradeoff for USTCON
par: Apers, Simon, et autres
Publié: (2022)

The PRODSAT phase of random quantum satisfiability
par: Lee, Joon, et autres
Publié: (2024)

Quantum search in a dictionary based on fingerprinting-hashing
par: Ablayev, Farid, et autres
Publié: (2024)

Quantum Channel Certification with Incoherent Strategies
par: Fawzi, Omar, et autres
Publié: (2023)

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
par: Chee, Yeow Meng, et autres
Publié: (2023)

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm
par: Chen, Jiale, et autres
Publié: (2025)

Learning general Gaussian mixtures with efficient score matching
par: Chen, Sitan, et autres
Publié: (2024)

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
par: Haah, Jeongwan, et autres
Publié: (2021)

Learning multivariate Gaussians with imperfect advice
par: Bhattacharyya, Arnab, et autres
Publié: (2024)

Entropy Coding of Unordered Data Structures
par: Kunze, Julius, et autres
Publié: (2024)

Learning DNF through Generalized Fourier Representations
par: Heidari, Mohsen, et autres
Publié: (2025)

Testing with Non-identically Distributed Samples
par: Garg, Shivam, et autres
Publié: (2023)

Subsampling Suffices for Adaptive Data Analysis
par: Blanc, Guy
Publié: (2023)

Learning Partitions with Optimal Query and Round Complexities
par: Black, Hadley, et autres
Publié: (2025)

A Framework for Searching in Graphs in the Presence of Errors
par: Dereniowski, Dariusz, et autres
Publié: (2018)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
par: Black, Hadley, et autres
Publié: (2025)

Sample-Optimal Private Regression in Polynomial Time
par: Anderson, Prashanti, et autres
Publié: (2025)

BalLOT: Balanced $k$-means clustering with optimal transport
par: Luo, Wenyan, et autres
Publié: (2025)

Quantum Multi-Level Estimation of Functionals of Discrete Distributions
par: Chen, Kean, et autres
Publié: (2026)

QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design
par: Yang, Rui, et autres
Publié: (2024)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
par: Diakonikolas, Ilias, et autres
Publié: (2025)