Quantum copying: a review.
Hillery, Mark (2000)
Electronic Journal of Differential Equations (EJDE) [electronic only]
Similarity:
Displaying similar documents to “Natural quantum operational semantics with predicates”
Quantum copying: a review.
Quantum theory and consciousness: an overview with selected examples.
Atmanspacher, Harald (2004)
Discrete Dynamics in Nature and Society
Similarity:
Irreversibility in quantum mechanics.
Bishop, R.C., Bohm, A., Gadella, M. (2004)
Discrete Dynamics in Nature and Society
Similarity:
Discourse on one way in which a quantum-mechanics language on the classical logical base can be built up
Roman Bek (1978)
Kybernetika
Similarity:
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...
Classical computing, quantum computing, and Shor's factoring algorithm
Yuri I. Manin (1998-1999)
Séminaire Bourbaki
Similarity:
Cluster state computation with quantum-dot charge qubits.
Katz, Matthew Lubelski, Wang, Jingbo (2010)
Advances in Mathematical Physics
Similarity:
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...
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.