- Accueil »
- Higher-order quantum computations and causal structures

Le contenu de cette page n’est pas disponible en français. Veuillez nous en excuser.

Playing this video requires the latest flash player from Adobe.

Download link (right click and 'save-as') for playing in VLC or other compatible player.

Speaker(s):

Scientific Areas:

Collection/Series:

PIRSA Number:

17110058

Conventional quantum processes are described by quantum circuits, that represent evolutions of states of systems from input to output. In this seminar we consider transformations of an input circuit to an output circuit, which then represent the transformation of quantum evolutions. At this level, all the processes complying to admissibility conditions have in principle a physical realization scheme. The construction of a hierarchy of transformations of transformations, however, can proceed arbitrarily far, and in the higher orders one encounters admissible functions that have indefinite causal structures. These give rise to questions about possible realization schemes. Still, many of the maps in the hierarchy can be proved to have a realistic physical interpretation. In order to study the hierarchy, we introduce a simple rule for constructing new types of maps from known ones, and show how the tensor product can be rephrased in terms of the new rule. We use the hierarchy of types to introduce a partial order, which allows us to prove properties of maps by induction. We will then use induction proofs to discuss the characterisation of mathematically admissible maps at every level. We show an important structural result for a subclass of higher-order maps, and we conclude with the open question of their physical achievability.

Share This PageShare this on TwitterShare on FacebookPublish this post to LinkedInSubmit this post on reddit.com

©2012 Institut Périmètre de Physique Théorique