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

The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing that states during the algorithm are maximally entangled...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-01
Hauptverfasser:	de Boutray, Henri, Hamza Jaffali, Holweck, Frédéric, Giorgetti, Alain, Masson, Pierre-Alain
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Entanglement Evolutionary algorithms Fourier transforms Physics - Quantum Physics Polynomials Quantum computing Quantum theory Search algorithms Source code
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!