An Algebraic Language for Distributed Quantum Computing

A classical circuit can be represented by a circuit graph or equivalently by a Boolean expression. The advantage of a circuit graph is that it can help us to obtain an intuitive understanding of the circuit under consideration, whereas the advantage of a Boolean expression is that it is suited to various algebraic manipulations. In the literature, however, quantum circuits are mainly drawn as circuit graphs, and a formal language for quantum circuits that has a function similar to that of Boolean expressions for classical circuits is still missing. Certainly, quantum circuit graphs will become unmanageable when complicated quantum computing problems are encountered, and in particular, when they have to be solved by employing the distributed paradigm where complex quantum communication networks are involved. In this paper, we design an algebraic language for formally specifying quantum circuits in distributed quantum computing. Using this language, quantum circuits can be represented in a convenient and compact way, similar to the way in which we use Boolean expressions in dealing with classical circuits. Moreover, some fundamental algebraic laws for quantum circuits expressed in this language are established. These laws form a basis of rigorously reasoning about distributed quantum computing and quantum communication protocols.

[1]  Rodney Van Meter,et al.  Arithmetic on a distributed-memory quantum multicomputer , 2006, JETC.

[2]  Yuan Feng,et al.  An algebra of quantum processes , 2007, TOCL.

[3]  Mingsheng Ying,et al.  Deterministic distributed dense coding with stabilizer states , 2007, 0710.4403.

[4]  Lov K. Grover.  Quantum Telecomputation , 1997 .

[5]  Philippe Jorrand,et al.  A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics , 2004, ArXiv.

[6]  Philippe Jorrand,et al.  From Quantum Physics to Programming Languages: A Process Algebraic Approach , 2004, UPP.

[7]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[8]  Mingsheng Ying,et al.  Perfect many-to-one teleportation with stabilizer states , 2008 .

[9]  Runyao Duan,et al.  Entanglement is not necessary for perfect discrimination between unitary operations. , 2007, Physical review letters.

[10]  Prakash Panangaden,et al.  The computational power of the W And GHZ States , 2006, Quantum Inf. Comput..

[11]  Rajagopal Nagarajan,et al.  Communicating quantum processes , 2004, POPL '05.

[12]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[13]  Marie Lalire,et al.  Relations among quantum processes: bisimilarity and congruence , 2006, Mathematical Structures in Computer Science.

[14]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

[15]  J. Eisert,et al.  Optimal local implementation of nonlocal quantum gates , 2000 .

[16]  Samuel J. Lomonaco,et al.  Generalized GHZ States and Distributed Quantum Computing , 2004 .

[17]  R. Jozsa,et al.  On the role of entanglement in quantum-computational speed-up , 2002, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[19]  Noah Linden,et al.  Nonlocal content of quantum operations , 2001 .

[20]  Yuan Feng,et al.  Probabilistic bisimulations for quantum processes , 2007, Inf. Comput..

[21]  Alessio Serafini,et al.  Distributed quantum computation via optical fibers. , 2006, Physical review letters.

[22]  Samuel J. Lomonaco, Jr.,et al.  Distributed quantum computing: a distributed Shor algorithm , 2004, SPIE Defense + Commercial Sensing.

[23]  Philippe Jorrand,et al.  Toward a quantum process algebra , 2004, CF '04.

[24]  Rajagopal Nagarajan,et al.  Types and Typechecking for Communicating Quantum Processes Nagarajan Is Supported by Epsrc Grant Gr/s34090 and the Eu Sixth Framework Programme (project Secoqc: Development of a Global Network for Secure Communication Based on Quantum Cryptography) , 2022 .

[25]  J. Cirac,et al.  Distributed quantum computation over noisy channels , 1998, quant-ph/9803017.

[26]  G. Ribordy,et al.  Enhancing ip security by integrating quantum key distribution into communication processes , 2005, Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005..

[27]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[28]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[29]  Rodney Van Meter,et al.  Communication Links for Distributed Quantum Computation , 2007, IEEE Transactions on Computers.