Hypergraph states in Grover's quantum search algorithm

Abstract

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.

7 pages, 2 figures, published version

References in corpus (6)

• Geometric measure of entanglement and applications to bipartite and multipartite quantum states
• On the role of entanglement in quantum computational speed-up
• Quantum Hypergraph States
• The geometric measure of entanglement for symmetric states
• Multipartite entanglement in quantum algorithms
• Scale invariance of entanglement dynamics in Grover's quantum search algorithm

Cited by in corpus (9)

• ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
• Entanglement and nonclassical properties of hypergraph states
• Reconfigurable optical implementation of quantum complex networks
• Extreme violation of local realism in quantum hypergraph states
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Quantum Experiments and Hypergraphs: Multi-Photon Sources for Quantum Interference, Quantum Computation and Quantum Entanglement
• Quantum Entanglement involved in Grover's and Shor's algorithms: the four-qubit case
• Randomized hypergraph states and their entanglement properties
• Non-symmetric GHZ states: weighted hypergraph and controlled-unitary graph representations