Diagrammatic differentiation for quantum machine learning

10Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

We introduce diagrammatic differentiation for tensor calculus by generalising the dual number construction from rigs to monoidal categories. Applying this to ZX diagrams, we show how to calculate diagrammatically the gradient of a linear map with respect to a phase parameter. For diagrams of parametrised quantum circuits, we get the well-known parameter-shift rule at the basis of many variational quantum algorithms. We then extend our method to the automatic differentation of hybrid classical-quantum circuits, using diagrams with bubbles to encode arbitrary non-linear operators. Moreover, diagrammatic differentiation comes with an open-source implementation in DisCoPy, the Python library for monoidal categories. Diagrammatic gradients of classical-quantum circuits can then be simplified using the PyZX library and executed on quantum hardware via the tket compiler. This opens the door to many practical applications harnessing both the structure of string diagrams and the computational power of quantum machine learning.

Cite

CITATION STYLE

APA

Toumi, A., Yeung, R., & de Felice, G. (2021). Diagrammatic differentiation for quantum machine learning. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 343, pp. 132–144). Open Publishing Association. https://doi.org/10.4204/EPTCS.343.7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free