Unordered Tuples in Quantum Computation

  title={Unordered Tuples in Quantum Computation},
  author={Robert Furber and Bas Westerbaan},
  journal={arXiv: Quantum Algebra},
It is well known that the C*-algebra of an ordered pair of qubits is M_2 (x) M_2. What about unordered pairs? We show in detail that M_3 (+) C is the C*-algebra of an unordered pair of qubits. Then we use Schur-Weyl duality to characterize the C*-algebra of an unordered n-tuple of d-level quantum systems. Using some further elementary representation theory and number theory, we characterize the quantum cycles. We finish with a characterization of the von Neumann algebra for unordered words. 

Tables from this paper

Dagger and Dilation in the Category of Von Neumann Algebras

This doctoral thesis is a mathematical study of quantum computing, concentrating on two related, but independent topics: dilations and effectus theory.

Dagger and dilations in the category of von Neumann algebras



Categories of quantum and classical channels

A construction that turns a category of pure state spaces and operators into a categories of observable algebras and superoperators is introduced, providing elegant abstract notions of preparation and measurement.

Applying quantitative semantics to higher-order quantum computing

This paper proposes a denotational semantics for a quantum lambda calculus with recursion and an infinite data type, using constructions from quantitative semantics of linear logic.

Towards a quantum programming language

  • P. Selinger
  • Computer Science
    Mathematical Structures in Computer Science
  • 2004
This paper describes the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

On certain trigonometrical sums and their applications in the theory of numbers

  • Mathematics
  • 2013
These sums are obviously of very great interest, and a few of their properties have been discussed already∗. But, so far as I know, they have never been considered from the point of view which I

An Introduction to the Theory of Numbers

  • E. T.
  • Mathematics
  • 1946
THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.

Concrete mathematics - a foundation for computer science

From the Publisher: This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid

Representation theory

These are notes from the course MAT4270 on representation theory, autumn 2015. The lectures were held by Sergey Neshyevey. The notes are mine. The first half is about representations of finite

Thanks! Thanks! Questions?

  • Thanks! Thanks! Questions?

They are more interesting than expected. 3. Representation theory of finite groups is a perfect fit to study them

  • They are more interesting than expected. 3. Representation theory of finite groups is a perfect fit to study them

Algebras for unordered types are given by coequalizers

  • Algebras for unordered types are given by coequalizers