Displaying similar documents to “On quantum limits on flat tori.”

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

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,...

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

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

Contact Quantization: Quantum Mechanics = Parallel transport

G. Herczeg, E. Latini, Andrew Waldron (2018)

Archivum Mathematicum

Similarity:

Quantization together with quantum dynamics can be simultaneously formulated as the problem of finding an appropriate flat connection on a Hilbert bundle over a contact manifold. Contact geometry treats time, generalized positions and momenta as points on an underlying phase-spacetime and reduces classical mechanics to contact topology. Contact quantization describes quantum dynamics in terms of parallel transport for a flat connection; the ultimate goal being to also handle quantum...