Quantum spectrum testing

DOI10.1007/s00220-021-04180-1zbMath1477.81013arXiv1501.05028OpenAlexW3195607530MaRDI QIDQ2231675

Yanyan Li

Publication date: 30 September 2021

Published in: Communications in Mathematical Physics, Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.05028

zbMATH Keywords

representation theorySchur-Weyl dualityproperty testingmixed states

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Paired and multiple comparisons; multiple testing (62J15) Quantum state spaces, operational and probabilistic concepts (81P16) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Schur polynomials do not have small formulas if the determinant does not, Error regions in quantum state tomography: computational complexity caused by geometry of quantum states, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Asymptotic performance of port-based teleportation, Unnamed Item, Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stanley's formula for characters of the symmetric group.
• Littlewood-Richardson polynomials
• The spectra of quantum states and the Kronecker coefficients of the symmetric group
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• An extension of Schensted's theorem
• A variational problem for random Young tableaux
• Random words, quantum statistics, central limits, random matrices
• Asymptotic theory of characters of the symmetric group
• The cyclic sieving phenomenon
• Content evaluation and class symmetric functions
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• An explicit formula for the characters of the symmetric group.
• Asymptotics of characters of symmetric groups, genus expansion and free probability.
• The pillowcase distribution and near-involutions
• Permutations, matrices, and generalized Young tableaux
• On the Limiting Shape of Young Diagrams Associated with Inhomogeneous Random Words
• The Surprising Mathematics of Longest Increasing Subsequences
• An Automatic Inequality Prover and Instance Optimal Identity Testing
• Quantum Computation and Quantum Information
• On Testing Expansion in Bounded-Degree Graphs
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Estimating Entropy on<tex>$m$</tex>Bins Given Fewer Than<tex>$m$</tex>Samples
• Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
• A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
• Symmetry properties of product states for the system of N n-level atoms
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• A Littlewood-Richardson rule for factorial Schur functions
• Products of Geck-Rouquier conjugacy classes and the Hecke algebra of composed permutations
• Robust Characterizations of Polynomials with Applications to Program Testing
• Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
• On the Limiting Shape of Young Diagrams Associated With Markov Random Words
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Testing Closeness of Discrete Distributions
• Estimating the unseen
• The Power of Linear Estimators
• The Complexity of Approximating the Entropy
• Automata, Languages and Programming
• The Hook Graphs of the Symmetric Group
• Combinatorial methods in density estimation
• Discrete orthogonal polynomial ensembles and the Plancherel measure
• On the distributions of the lengths of the longest monotone subsequences in random words
• The algebra of conjugacy classes in symmetric groups, and partial permutations