Mermin Polynomials for Entanglement Evaluation in Grover’s algorithm and Quantum Fourier Transform

Copyright (C) 2019 Henri de Boutray, Hamza Jaffali, Frédéric Holweck, Alain Giorgetti and Pierre-Alain Masson

Contact: henri.de_boutray[at]univ-fcomte.fr

Documentation

The code has been developed to study entanglement in Grover’s algorithm and in the QFT, using Mermin polynomials. The framework used for this project is SageMath. See file INSTALL.md for its installation and execution.

In an effort to check properties of quantum algorithms, we focus here on the entanglement property, the Grover’s quantum search algorithm and the QFT. Our results are summed up in an article available in arXiv [dJH+19]. The present code is a part of the implementation used to support those results.

A peculiar attention has been carried on code readability, so it can be easily usable. The code documentation can be found in pdf format or as a website. It is generated from the code using Sphinx.

A more literal description of the code can be found in the article [dJH+19].

Copyright

This program is distributed under the GNU GPL 3. See the enclosed file LICENSE.

References

[dJH+19] Henri de Boutray, Hamza Jaffali, Frédéric Holweck, Alain Giorgetti and Pierre-Alain Masson. Mermin Polynomials for Entanglement Evaluation in Grover’s algorithm and Quantum Fourier Transform arXiv:2001.05192