Displaying similar documents to “Contact Quantization: Quantum Mechanics = Parallel transport”

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

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