On quantum vector fields in general relativistic quantum mechanics.
Janys̆ka, Joseph, Modugno, Marco (1997)
General Mathematics
Similarity:
Janys̆ka, Joseph, Modugno, Marco (1997)
General Mathematics
Similarity:
Bagaev, A.A. (2005)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Jan Dereziński, Christian Gérard (2010)
Banach Center Publications
Similarity:
The abstract mathematical structure behind the positive energy quantization of linear classical systems is described. It is separated into three stages: the description of a classical system, the algebraic quantization and the Hilbert space quantization. Four kinds of systems are distinguished: neutral bosonic, neutral bosonic, charged bosonic and charged fermionic. The formalism that is described follows closely the usual constructions employed in quantum physics to introduce noninteracting...
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...
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...
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,...
James Glimm (1973-1974)
Séminaire Jean Leray
Similarity:
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...
Marcel Guenin (1969)
Recherche Coopérative sur Programme n°25
Similarity:
Marcel Guenin (1973)
Recherche Coopérative sur Programme n°25
Similarity:
Bishop, R.C., Bohm, A., Gadella, M. (2004)
Discrete Dynamics in Nature and Society
Similarity: