Causal Structures and the Classification of Higher Order Quantum Computations
Quantum operations are the most widely used tool in the theory of quantum information processing, representing elementary transformations of quantum states that are composed to form complex quantum circuits. The class of quantum transformations can be extended by including transformations on quantum operations, and transformations thereof, and so on up to the construction of a potentially infinite hierarchy of transformations. In the last decade, a sub-hierarchy, known as quantum combs, was exhaustively studied, and characterised as the most general class of transformations that can be achieved by quantum circuits with open slots hosting variable input elements, to form a complete output quantum circuit. The theory of quantum combs proved to be successful for the optimisation of information processing tasks otherwise untreatable. In more recent years the study of maps from combs to combs has increased, thanks to interesting examples showing how this next order of maps requires entanglement of the causal order of operations with the state of a control quantum system, or, even more radically, superpositions of alternate causal orderings. Some of these non-circuital transformations are known to be achievable and have even been achieved experimentally, and were proved to provide some computational advantage in various information-processing tasks with respect to quantum combs. Here we provide a formal language to form all possible types of transformations, and use it to prove general structure theorems for transformations in the hierarchy. We then provide a mathematical characterisation of the set of maps from combs to combs, hinting at a route for the complete characterisation of maps in the hierarchy. The classification is strictly related to the way in which the maps manipulate the causal structure of input circuits.
PACS numbers03.67.-a 03.67.Ac 03.65.Ta
The author is grateful Alessandro Bisio for carefully reading the first version and pointing out an important imprecision, and to Aleks Kissinger and Fabio Costa for insightful discussions. This publication was made possible through the support of a grant from the John Templeton Foundation (Grant ID# 60609). The opinions expressed in this publication are those of the author and do not necessarily reflect the views of the John Templeton Foundation.
- 1.M.A. Nielsen, I.L. Chuang Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2010)Google Scholar
- 2.D. Deutsch, Proc. R. Soc. Lond. Ser. A Math. Phys. Sci. 425, 73–90 (1989)Google Scholar
- 3.A.C.-C. Yao, in Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science (FOCS1993), pp. 352–361 (1993)Google Scholar
- 4.D. Aharonov, A. Kitaev, N. Nisan, in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC ’98 (ACM, New York, 1998), pp. 20–30Google Scholar
- 7.G.M. D’Ariano, G. Chiribella, P. Perinotti, Quantum Theory Form First Principles. An Informational Approach (Cambridge University Press, Cambridge, 2017)Google Scholar
- 9.K. Kraus, A. Böhm, J. Dollard, W. Wootters, States, Effects, and Operations: Fundamental Notions of Quantum Theory: Lectures in Mathematical Physics at the University of Texas at Austin, Lecture Notes in Physics (Springer, Berlin, 1983)Google Scholar
- 11.G. Chiribella, G.M. D’Ariano, P. Perinotti, Phys. Rev. Lett. 101, 4 (2008)Google Scholar
- 13.G. Gutoski, J. Watrous, in Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, STOC ’07 (ACM, New York, 2007), pp. 565–574Google Scholar
- 16.Ä. Baumeler, S. Wolf, in 2014 IEEE International Symposium on Information Theory (ISIT), pp. 526–530 (2014)Google Scholar
- 18.A. Bisio, P. Perinotti, in preparationGoogle Scholar