Fast Quantum State Discrimination with Nonlinear Positive Trace‐Preserving Channels

Abstract Models of nonlinear quantum computation based on deterministic positive trace‐preserving (PTP) channels and evolution equations are investigated. The models are defined in any finite Hilbert space, but the main results are for dimension . For every normalizable linear or nonlinear positive map ϕ on bounded linear operators X , there is an associated normalized PTP channel . Normalized PTP channels include unitary mean field theories, such as the Gross–Pitaevskii equation for interacting bosons, as well as models of linear and nonlinear dissipation. They classify into four types, yielding three distinct forms of nonlinearity whose computational power are explored. In the qubit case, these channels support Bloch ball torsion and other distortions studied previously, where it has been shown that such nonlinearity can be used to increase the separation between a pair of close qubit states, suggesting an exponential speedup for state discrimination. Building on this idea, the authors argue that this operation can be made robust to noise by using dissipation to induce a bifurcation to a novel phase where a pair of attracting fixed points create an intrinsically fault‐tolerant nonlinear state discriminator.