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, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.
Higher moment theory and learnability of bosonic states
3 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A natural energy condition satisfied by most physical bosonic states, including outputs of universal bosonic circuits, allows the effective dimension for ε-approximations to scale as log(1/ε) instead of 1/ε², enabling improved learning and classical simulation algorithms.
A concise review of sample complexities and methods for tomography and learning in continuous-variable quantum systems, with emphasis on Gaussian versus non-Gaussian states.
citing papers explorer
-
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, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.
-
Exponentially-improved effective descriptions of physical bosonic systems
A natural energy condition satisfied by most physical bosonic states, including outputs of universal bosonic circuits, allows the effective dimension for ε-approximations to scale as log(1/ε) instead of 1/ε², enabling improved learning and classical simulation algorithms.
-
Advances in quantum learning theory with bosonic systems
A concise review of sample complexities and methods for tomography and learning in continuous-variable quantum systems, with emphasis on Gaussian versus non-Gaussian states.