Virtual Markov Chains

We introduce the space of virtual Markov chains (VMCs) as a projective limit of the spaces of all finite state space Markov chains (MCs), in the same way that the space of virtual permutations is the projective limit of the spaces of all permutations of finite sets.We introduce the notions of virtual initial distribution (VID) and a virtual transition matrix (VTM), and we show that the law of any VMC is uniquely characterized by a pair of a VID and VTM which have to satisfy a certain compatibility condition.Lastly, we study various properties of compact convex sets associated to the theory of VMCs, including that the Birkhoff-von Neumann theorem fails in the virtual setting.

Efficient quantum gate teleportation in higher dimensions

The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and ‘nearly diagonal’ semi-Clifford gates are particularly important: they admit efficient gate teleportation protocols that implement these gates with fewer ancillary quantum resources such as magic states. Despite the practical importance of these sets of gates, many questions about their structure remain open; this is especially true in the higher-dimensional qudit setting. Our contribution is to leverage the discrete Stone–von Neumann theorem and the symplectic formalism of qudit stabilizer theory towards extending the results of Zeng et al . (2008) and Beigi & Shor (2010) to higher dimensions in a uniform manner. We further give a simple algorithm for recursively enumerating all gates of the Clifford hierarchy, a simple algorithm for recognizing and diagonalizing semi-Clifford gates, and a concise proof of the classification of the diagonal Clifford hierarchy gates due to Cui et al . (2016) for the single-qudit case. We generalize the efficient gate teleportation protocols of semi-Clifford gates to the qudit setting and prove that every third-level gate of one qudit (of any prime dimension) and of two qutrits can be implemented efficiently. Numerical evidence gathered via the aforementioned algorithms supports the conjecture that higher-level gates can be implemented efficiently.

On the categoricity of quantum mechanics

The paper offers an argument against an intuitive reading of the Stone-von Neumann theorem as a categoricity result, thereby pointing out that, against what is usually taken to be the case, this theorem does not entail any model-theoretical difference between the theories that validate it and those that don’t.

A new proof of the Tikuisis–White–Winter theorem

A trace on a {\mathrm{C}^{*}}-algebra is amenable (resp. quasidiagonal) if it admits a net of completely positive, contractive maps into matrix algebras which approximately preserve the trace and are approximately multiplicative in the 2-norm (resp. operator norm). Using that the double commutant of a nuclear {\mathrm{C}^{*}}-algebra is hyperfinite, it is easy to see that traces on nuclear {\mathrm{C}^{*}}-algebras are amenable. A recent result of Tikuisis, White, and Winter shows that faithful traces on separable, nuclear {\mathrm{C}^{*}}-algebras in the UCT class are quasidiagonal. We give a new proof of this result using the extension theory of {\mathrm{C}^{*}}-algebras and, in particular, using a version of the Weyl–von Neumann Theorem due to Elliott and Kucerovsky.

Superunitary Representations of Heisenberg Supergroups

Numerous Lie supergroups do not admit superunitary representations (SURs) except the trivial one, for example, Heisenberg and orthosymplectic supergroups in mixed signature. To avoid this situation, we introduce in this paper a broader definition of SUR, relying on a new definition of Hilbert superspace. The latter is inspired by the notion of Krein space and was developed initially for noncommutative supergeometry. For Heisenberg supergroups, this new approach yields a smooth generalization, whatever the signature, of the unitary representation theory of the classical Heisenberg group. First, we obtain Schrödinger-like representations by quantizing generic coadjoint orbits. They satisfy the new definition of irreducible SURs and serve as ground to the main result of this paper: a generalized Stone–von Neumann theorem. Then, we obtain the superunitary dual and build a group Fourier transformation, satisfying Parseval theorem. We eventually show that metaplectic representations, which extend Schrödinger-like representations to metaplectic supergroups, also fit into this definition of SURs.

The Weyl–von Neumann theorem in von Neumann factors

In a von Neumann factor