Displaying similar documents to “Instruments and mutual entropies in quantum information”

Quantum copying: a review.

Hillery, Mark (2000)

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

Similarity:

When is a quantum space not a group?

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

Contractible quantum Arens-Michael algebras

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

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

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

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.

Quantum states satisfying classical probability constraints

Elena R. Loubenets (2006)

Banach Center Publications

Similarity:

For linear combinations of quantum product averages in an arbitrary bipartite state, we derive new quantum Bell-form and CHSH-form inequalities with the right-hand sides expressed in terms of a bipartite state. This allows us to specify bipartite state properties sufficient for the validity of a classical CHSH-form inequality and the perfect correlation form of the original Bell inequality for any bounded quantum observables. We also introduce a new general condition on a bipartite state...