GQSPI recasts binary hypothesis testing on Gaussian bosonic signals as a polynomial approximation problem, achieving O(1/d log d) decision error for circuit depth d and robustness to dephasing noise.
Quantum coding.Phys
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Differences in representation structure between the Ising minimal model and SU(2)_2 Chern-Simons theory do not impact observables relevant to topological quantum computation.
citing papers explorer
-
Robust Quantum Algorithmic Binary Decision-Making on Gaussian Signals
GQSPI recasts binary hypothesis testing on Gaussian bosonic signals as a polynomial approximation problem, achieving O(1/d log d) decision error for circuit depth d and robustness to dephasing noise.
-
Ising anyons in the $SU(2)_2$ Chern--Simons theory
Differences in representation structure between the Ising minimal model and SU(2)_2 Chern-Simons theory do not impact observables relevant to topological quantum computation.