The Church of the Symmetric Subspace
read the original abstract
The symmetric subpace has many applications in quantum information theory. This review article begins by explaining key background facts about the symmetric subspace from a quantum information perspective. Then we review, and in some places extend, work of Werner and Chiribella that connects the symmetric subspace to state estimation, optimal cloning, the de Finetti theorem and other topics. In the third and final section, we discuss how the symmetric subspace can yield concentration-of-measure results via the calculation of higher moments of random quantum states. There are no new results in this article, but only some new proofs of existing results, such as a variant of the exponential de Finetti theorem. The purpose of the article is (a) pedagogical, and (b) to collect in one place many, if not all, of the quantum information applications of the symmetric subspace.
This paper has not been read by Pith yet.
Forward citations
Cited by 20 Pith papers
-
Optimal Stabilizer Testing and Learning with Limited Quantum Memory
Stabilizer testing requires Θ(n-k) copies and non-adaptive learning Θ(n²/k) copies with k-qubit memory, removing the testing-learning separation.
-
An Exponential Sample-Complexity Advantage for Coherent Quantum Inference
Coherent quantum inference achieves O(1/ε) sample complexity for d-dimensional quantum purity amplification, exponentially better than the Ω(d/ε) required by any incoherent measurement-mediated protocol.
-
Quantum state isomorphism problems for groups
Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ru...
-
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlin...
-
Generic Number-of-Copies Amplification for Pseudorandom States
Any 1-PRS can be amplified to t-PRS for polynomial t by randomness accounting and quantum extractors that eliminate arbitrary ancilla.
-
Blind Symmetry Matching in Quantum States with Application to Shot-Count Reduction
A framework for blind discovery of finite-group symmetries in quantum states via scoring of candidate groups, with unbiased selection proven and a circuit that tests both weak commutation and strong charge-sector conf...
-
Projected logical ensembles in surface codes via the random-matrix theory of quantum dots
For single-logical-qubit surface codes with uniform X rotations, the projected logical ensemble after syndrome extraction and maximum-likelihood decoding is isomorphic to scattering-matrix ensembles of chaotic quantum...
-
Randomized simulation of quantum channels using small ancilla
Any unital quantum channel on d dimensions admits exact simulation with ancilla dimension k and success probability Ω(k/log d) via randomization and postselection; the bound is tight and fails for strongly non-unital ...
-
Mixed-State Long-Range Entanglement from Dimensional Constraints
The maximally mixed state in the translation-invariant subspace of a 1D ring is long-range entangled because the dimension of translationally symmetric short-range entangled states grows polynomially while the full su...
-
The most discriminable quantum states in the multicopy regime
k-designs achieve maximal multi-copy discriminability for pure states when N suffices, mixed states outperform beyond that, and quantum offers quadratic advantage over classical in Bayes capacity terms.
-
The most discriminable quantum states in the multicopy regime
k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.
-
Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition
Quantum channel tomography query complexity transitions from Heisenberg scaling Θ(r d1 d2 / ε) at dilation rate τ=1 to classical scaling Θ(r d1 d2 / ε²) for τ ≥ 1+Ω(1).
-
Structural Obstruction to Replica Symmetry Breaking for Multi-Entropy in Random Tensor Networks
Multi-entropy exhibits a structural obstruction to replica symmetry breaking in random tensor networks due to incompatible boundary permutations in the replica hypercube, unlike entanglement negativity.
-
Non-stabilizerness and U(1) symmetry in chaotic many-body quantum systems
Exact results show U(1) symmetry substantially suppresses non-stabilizerness in random states, with different leading scaling from entanglement near zero charge density.
-
Code-agnostic bosonic noise suppression with hybrid rotations
A code-agnostic hybrid rotation protocol using a qubit ancilla and controlled-Fourier gates suppresses bosonic thermal and displacement noise quadratically while preserving high success probability.
-
Diagnosing chaos with projected ensembles of process tensors
Higher moments of the projected process ensemble reveal entanglement structures that distinguish chaotic from integrable dynamics more sharply than quantum dynamical or spatiotemporal entropies.
-
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program...
-
Late-time ensembles of quantum states in quantum chaotic systems
Late-time ensembles in chaotic systems with symmetries match Haar-random statistics for typical product states but follow constrained ensembles for atypical low-variance initial states.
-
Taming Trotter Errors with Quantum Resources
Higher entanglement entropy reduces variance of Trotter errors and higher magic reduces kurtosis, making error distributions more robust in quantum simulation.
-
How to sketch a learning algorithm
A sketching method based on higher-order derivatives enables efficient data deletion predictions for deep learning models under a stability assumption with near-linear overhead in error and failure parameters.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.