Displaying similar documents to “Quantum computing in decoherence-free subspace constructed by triangulation.”

Supersymmetry and Ghosts in Quantum Mechanics

Robert, Didier (2008)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 81Q60, 35Q40. A standard supersymmetric quantum system is defined by a Hamiltonian [^H] = ½([^Q]*[^Q] +[^Q][^Q]*), where the super-charge [^Q] satisfies [^Q]2 = 0, [^Q] commutes with [^H]. So we have [^H] ≥ 0 and the quantum spectrum of [^H] is non negative. On the other hand Pais-Ulhenbeck proposed in 1950 a model in quantum-field theory where the d'Alembert operator [¯] = [(∂2)/( ∂t2)] − Δx is replaced by fourth order operator [¯]([¯]...

Quantum copying: a review.

Hillery, Mark (2000)

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

Similarity:

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

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