Displaying similar documents to “Topological views on computational complexity.”

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

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

Local Transition Functions of Quantum Turing Machines

Masanao Ozawa, Harumichi Nishimura (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Foundations of the notion of quantum Turing machines are investigated. According to Deutsch's formulation, the time evolution of a quantum Turing machine is to be determined by the local transition function. In this paper, the local transition functions are characterized for fully general quantum Turing machines, including multi-tape quantum Turing machines, extending the results due to Bernstein and Vazirani.