Unordered tuples in quantum computation

MaRDI QIDQ5015199zbMATH OpenFDO

Authors

Publication date 6 December 2021

Full work available at URL https://arxiv.org/abs/1409.1020, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QPL2015.15

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: 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.

Recommendations

• scientific article; zbMATH DE number 63039
• Universal quantum computation with unlabelled qubits
• Representations of quantum permutation algebras
• Algebraic structures of multipartite quantum systems
• Quantum Markov chains: a unification approach

Cites work

• scientific article; zbMATH DE number 51906 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• Applying quantitative semantics to higher-order quantum computing
• Categories of quantum and classical channels
• Towards a quantum programming language

Describes a project that uses

Uses Software

• QPL

This page was built for publication: Unordered tuples in quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015199)