Displaying similar documents to “The simplex of tracial quantum symmetric states”

When is a quantum space not a group?

Piotr Mikołaj Sołtan (2010)

Banach Center Publications

Similarity:

We give a survey of techniques from quantum group theory which can be used to show that some quantum spaces (objects of the category dual to the category of C*-algebras) do not admit any quantum group structure. We also provide a number of examples which include some very well known quantum spaces. Our tools include several purely quantum group theoretical results as well as study of existence of characters and traces on C*-algebras describing the considered quantum spaces as well as...

Contractible quantum Arens-Michael algebras

Nina V. Volosova (2010)

Banach Center Publications

Similarity:

We consider quantum analogues of locally convex spaces in terms of the non-coordinate approach. We introduce the notions of a quantum Arens-Michael algebra and a quantum polynormed module, and also quantum versions of projectivity and contractibility. We prove that a quantum Arens-Michael algebra is contractible if and only if it is completely isomorphic to a Cartesian product of full matrix C*-algebras. Similar results in the framework of traditional (non-quantum) approach are established,...

An introduction to quantum annealing

Diego de Falco, Dario Tamascelli (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by quantum...

An introduction to quantum annealing

Diego de Falco, Dario Tamascelli (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by quantum...

Quantum permutation groups: a survey

Teodor Banica, Julien Bichon, Benoît Collins (2007)

Banach Center Publications

Similarity:

This is a presentation of recent work on quantum permutation groups. Contains: a short introduction to operator algebras and Hopf algebras; quantum permutation groups, and their basic properties; diagrams, integration formulae, asymptotic laws, matrix models; the hyperoctahedral quantum group, free wreath products, quantum automorphism groups of finite graphs, graphs having no quantum symmetry; complex Hadamard matrices, cocycle twists of the symmetric group, quantum groups acting on...

A noncommutative 2-sphere generated by the quantum complex plane

Ismael Cohen, Elmar Wagner (2012)

Banach Center Publications

Similarity:

S. L. Woronowicz's theory of C*-algebras generated by unbounded elements is applied to q-normal operators satisfying the defining relation of the quantum complex plane. The unique non-degenerate C*-algebra of bounded operators generated by a q-normal operator is computed and an abstract description is given by using crossed product algebras. If the spectrum of the modulus of the q-normal operator is the positive half line, this C*-algebra will be considered as the algebra of continuous...