Displaying similar documents to “Classical computing, quantum computing, and Shor's factoring algorithm”

Natural quantum operational semantics with predicates

Marek Sawerwain, Roman Gielerak (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the existence of a GSOS format for quantum labelled transition systems. The first theorem is a slight...

Quantum copying: a review.

Hillery, Mark (2000)

Electronic Journal of Differential Equations (EJDE) [electronic only]

Similarity:

Noise effects in the quantum search algorithm from the viewpoint of computational complexity

Piotr Gawron, Jerzy Klamka, Ryszard Winiarczyk (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.

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.

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