Hypergraph states in Grover's quantum search algorithm

We study the entanglement content of the states employed in the Grover algorithm after the first oracle call when a few searched items are concerned. We then construct a link between these initial states and hypergraphs, which provides an illustration of their entanglement properties.

[1]  C. Macchiavello,et al.  Quantum hypergraph states , 2012, 1211.5554.

[2]  P. Goldbart,et al.  Geometric measure of entanglement and applications to bipartite and multipartite quantum states , 2003, quant-ph/0307219.

[3]  C. Macchiavello,et al.  Scale invariance of entanglement dynamics in Grover's quantum search algorithm , 2013 .

[4]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[5]  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.

[6]  A. P. Vinogradov,et al.  PT-symmetry in optics , 2014 .

[7]  C. Macchiavello,et al.  Multipartite entanglement in quantum algorithms , 2010, 1007.4179.

[8]  O. Gühne,et al.  Geometric measure of entanglement for symmetric states , 2009, 0905.4822.