Document Open Access Logo

A Diagrammatic Axiomatisation of Fermionic Quantum Circuits

Authors Amar Hadzihasanovic, Giovanni de Felice, Kang Feng Ng



PDF
Thumbnail PDF

File

LIPIcs.FSCD.2018.17.pdf
  • Filesize: 0.55 MB
  • 20 pages

Document Identifiers

Author Details

Amar Hadzihasanovic
  • RIMS, Kyoto University, Japan
Giovanni de Felice
  • Department of Computer Science, University of Oxford, United Kingdom
Kang Feng Ng
  • Department of Computer Science, University of Oxford, United Kingdom

Cite AsGet BibTex

Amar Hadzihasanovic, Giovanni de Felice, and Kang Feng Ng. A Diagrammatic Axiomatisation of Fermionic Quantum Circuits. In 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 108, pp. 17:1-17:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSCD.2018.17

Abstract

We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and show how the main physical gates of interest in FQC can be represented in the language. We then list our axioms, and derive some additional equations. We prove that the axioms provide a complete equational axiomatisation of the monoidal category whose objects are quantum systems of finitely many local fermionic modes, with operations that preserve or reverse the parity (number of particles mod 2) of states, and the tensor product, corresponding to the composition of two systems, as monoidal product. We achieve this through a procedure that rewrites any diagram in a normal form. We conclude by showing, as an example, how the statistics of a fermionic Mach-Zehnder interferometer can be calculated in the diagrammatic language.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum computation theory
Keywords
  • Fermionic Quantum Computing
  • String Diagrams
  • Categorical Quantum Mechanics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. M. Backens. The ZX-calculus is complete for stabilizer quantum mechanics. New Journal of Physics, 16(9):093021, 2014. URL: http://dx.doi.org/10.1088/1367-2630/16/9/093021.
  2. M.-C. Bañuls, J.I. Cirac, and M.M. Wolf. Entanglement in fermionic systems. Physical Review A, 76(2), 2007. URL: http://dx.doi.org/10.1103/physreva.76.022311.
  3. S.B. Bravyi and A. Yu. Kitaev. Fermionic quantum computation. Annals of Physics, 298(1):210-226, 2002. URL: http://dx.doi.org/10.1006/aphy.2002.6254.
  4. B. Coecke and R. Duncan. Interacting quantum observables. In Automata, Languages and Programming, pages 298-310. Springer, 2008. URL: http://dx.doi.org/10.1007/978-3-540-70583-3_25.
  5. B. Coecke, R. Duncan, A. Kissinger, and Q. Wang. Strong complementarity and non-locality in categorical quantum mechanics. In 2012 27th Annual IEEE Symposium on Logic in Computer Science. IEEE, 2012. URL: http://dx.doi.org/10.1109/lics.2012.35.
  6. B. Coecke and A. Kissinger. The compositional structure of multipartite quantum entanglement. In Automata, Languages and Programming, pages 297-308. Springer Berlin Heidelberg, 2010. URL: http://dx.doi.org/10.1007/978-3-642-14162-1_25.
  7. B. Coecke and A. Kissinger. Picturing Quantum Processes. Cambridge University Press (CUP), 2017. URL: http://dx.doi.org/10.1017/9781316219317.
  8. B. Coecke and D. Pavlovic. Quantum measurements without sums. In Chapman & Hall/CRC Applied Mathematics & Nonlinear Science, pages 559-596. Chapman and Hall/CRC, 2007. URL: http://dx.doi.org/10.1201/9781584889007.ch16.
  9. B. Coecke, D. Pavlovic, and J. Vicary. A new description of orthogonal bases. Mathematical Structures in Computer Science, 23(03):555-567, 2012. URL: http://dx.doi.org/10.1017/s0960129512000047.
  10. G.M. D'Ariano, F. Manessi, P. Perinotti, and A. Tosini. The Feynman problem and fermionic entanglement: Fermionic theory versus qubit theory. International Journal of Modern Physics A, 29(17):1430025, 2014. URL: http://dx.doi.org/10.1142/s0217751x14300257.
  11. R. Duncan and S. Perdrix. Rewriting measurement-based quantum computations with generalised flow. In Automata, Languages and Programming, pages 285-296. Springer Berlin Heidelberg, 2010. URL: http://dx.doi.org/10.1007/978-3-642-14162-1_24.
  12. W. Dür, G. Vidal, and J.I. Cirac. Three qubits can be entangled in two inequivalent ways. Physical Review A, 62(6), 2000. URL: http://dx.doi.org/10.1103/physreva.62.062314.
  13. V. Eisler and Z. Zimborás. On the partial transpose of fermionic gaussian states. New Journal of Physics, 17(5):053048, 2015. URL: http://dx.doi.org/10.1088/1367-2630/17/5/053048.
  14. A.C. Elitzur and L. Vaidman. Quantum mechanical interaction-free measurements. Foundations of Physics, 23(7):987-997, 1993. URL: http://dx.doi.org/10.1007/bf00736012.
  15. N. Friis, A.R. Lee, and D.E. Bruschi. Fermionic-mode entanglement in quantum information. Physical Review A, 87(2), 2013. URL: http://dx.doi.org/10.1103/physreva.87.022338.
  16. A. Hadzihasanovic. A diagrammatic axiomatisation for qubit entanglement. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '15, pages 573-584. IEEE, 2015. URL: http://dx.doi.org/10.1109/LICS.2015.59.
  17. A. Hadzihasanovic. The algebra of entanglement and the geometry of composition. PhD thesis, University of Oxford, 2017. Available at URL: https://arxiv.org/abs/1709.08086.
  18. A. Hadzihasanovic, K.F. Ng, and Q. Wang. Two complete axiomatisations of pure-state qubit quantum computing, 2018. Accepted at the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2018. Google Scholar
  19. Y. Ji, Y. Chung, D. Sprinzak, M. Heiblum, D. Mahalu, and H. Shtrikman. An electronic MachendashZehnder interferometer. Nature, 422(6930):415-418, 2003. URL: http://dx.doi.org/10.1038/nature01503.
  20. A. Joyal and R. Street. The geometry of tensor calculus, I. Advances in Mathematics, 88(1):55-112, 1991. URL: http://dx.doi.org/10.1016/0001-8708(91)90003-p.
  21. L.H. Kauffman. Knots and Physics. World Scientific Publishing Co. Pte. Ltd., 2001. URL: http://dx.doi.org/10.1142/9789812384836.
  22. G.M. Kelly and M.L. Laplaza. Coherence for compact closed categories. Journal of Pure and Applied Algebra, 19:193-213, 1980. URL: http://dx.doi.org/10.1016/0022-4049(80)90101-2.
  23. A. Kissinger, A. Merry, and M. Soloviev. Pattern graph rewrite systems. Electronic Proceedings in Theoretical Computer Science, 143:54-66, 2014. URL: http://dx.doi.org/10.4204/eptcs.143.5.
  24. A. Kissinger and V. Zamdzhiev. Quantomatic: A proof assistant for diagrammatic reasoning. In Automated Deduction - CADE-25, pages 326-336. Springer International Publishing, 2015. URL: http://dx.doi.org/10.1007/978-3-319-21401-6_22.
  25. E. Knill, R. Laflamme, and G.J. Milburn. A scheme for efficient quantum computation with linear optics. Nature, 409(6816):46-52, 2001. Google Scholar
  26. S. Lack. Composing PROPs. Theory and Applications of Categories, 13(9):147-163, 2004. Google Scholar
  27. S. Majid. A Quantum Groups Primer. Cambridge University Press, 2002. URL: http://dx.doi.org/10.1017/cbo9780511549892.
  28. K.F. Ng and Q. Wang. A universal completion of the ZX-calculus. arXiv preprint arXiv:1706.09877, 2017. Google Scholar
  29. M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2009. URL: http://dx.doi.org/10.1017/cbo9780511976667.
  30. M.O. Scully and M.S. Zubairy. Quantum optics. Cambridge University Press, 1997. URL: http://dx.doi.org/10.1017/cbo9780511813993.
  31. P. Selinger. Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Electronic Notes in Theoretical Computer Science, 270(1):113-119, 2011. URL: http://dx.doi.org/10.1016/j.entcs.2011.01.010.
  32. P. Woit. Quantum Theory, Groups and Representations. Springer International Publishing, 2017. URL: http://dx.doi.org/10.1007/978-3-319-64612-1.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail