Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
Concept
No-deleting theorem
Résumé
In physics, the no-deleting theorem of quantum information theory is a no-go theorem which states that, in general, given two copies of some arbitrary quantum state, it is impossible to delete one of the copies. It is a time-reversed to the no-cloning theorem, which states that arbitrary states cannot be copied. This theorem seems remarkable, because, in many senses, quantum states are fragile; the theorem asserts that, in a particular case, they are also robust. Physicist Arun K. Pati along with Samuel L. Braunstein proved this theorem.
The no-deleting theorem, together with the no-cloning theorem, underpin the interpretation of quantum mechanics in terms of , and, in particular, as a . This formulation, known as categorical quantum mechanics, in turn allows a connection to be made from quantum mechanics to linear logic as the logic of quantum information theory (in exact analogy to classical logic being founded on ).
Suppose that there are two copies of an unknown quantum state. A pertinent question in this context is to ask if it is possible, given two identical copies, to delete one of them using quantum mechanical operations? It turns out that one cannot. The no-deleting theorem is a consequence of linearity of quantum mechanics. Like the no-cloning theorem this has important implications in quantum computing, quantum information theory and quantum mechanics in general.
The process of quantum deleting takes two copies of an arbitrary, unknown
quantum state at the input port and outputs a blank state along with the original. Mathematically,
this can be described by:
where is the deleting operation which is not necessarily unitary (but a linear operator), is the unknown quantum
state, is the blank state, is the initial state of
the deleting machine and is the final state of the machine.
It may be noted that classical bits can be copied and deleted, as can qubits in orthogonal states. For example, if we have two identical qubits and then we can transform to and . In this case we have deleted the second copy.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.