Quantum Entanglement involved in Grover's and Shor's algorithms: the four-qubit case

Abstract

In this paper, we study the nature of entanglement in quantum Grover's and Shor's algorithms. So far, the authors who have been interested in this problem have approached the question quantitatively by introducing entanglement measures (numerical ones most of the time). One can ask a different question: what about a qualitative measure of entanglement ? In other words, we try to find what are the different entanglement SLOCC classes that can be generated by these two algorithms. We treat in this article the case of pure four-qubit systems.

arXiv comment33 pages, 10 figures, 2 algorithms

References in corpus (30)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Efficient classical simulation of slightly entangled quantum computations
• On the role of entanglement in quantum computational speed-up
• Four qubits can be entangled in nine different ways
• Information and Computation: Classical and Quantum Aspects
• Global entanglement in multiparticle systems
• Quantum computers can search arbitrarily large databases by a single query
• Experimental demonstration of Shor's algorithm with quantum entanglement
• Classification of multipartite entangled states by multidimensional determinants
• Demonstration of Shor's quantum factoring algorithm using photonic qubits
• Quantum Algorithms: Entanglement Enhanced Information Processing
• The polynomial invariants of four qubits
• Universality of Entanglement and Quantum Computation Complexity
• An entanglement monotone derived from Grover's algorithm
• Multipartite entanglement in 2 x 2 x n quantum systems
• A Brief Overview of Bipartite and Multipartite Entanglement Measures
• Entangled Quantum States Generated by Shor's Factoring Algorithm
• Scale invariance of entanglement dynamics in Grover's quantum search algorithm
• Entanglement of three-qubit random pure states
• The Majorization Arrow in Quantum Algorithm Design
• Entanglement of four qubit systems: a geometric atlas with polynomial compass I (the finite world)
• Geometric descriptions of entangled states by auxiliaries varieties
• Entanglement Simulations of Shor's Algorithm
• Entanglement of four-qubit systems: a geometric atlas with polynomial compass II (the tame world)
• Analysis of Grover's quantum search algorithm as a dynamical system
• Hypergraph states in Grover's quantum search algorithm
• Entanglement Classification with Algebraic Geometry
• Entanglement of Periodic States, the Quantum Fourier Transform and Shor's Factoring Algorithm
• A link between Quantum Entanglement, Secant varieties and Sphericity
• Multipartite quantum correlations: symplectic and algebraic geometry approach

Cited by in corpus (6)

• Fine-Structure Classification of Multiqubit Entanglement by Algebraic Geometry
• Mermin Polynomials for Entanglement Evaluation in Grover's algorithm and Quantum Fourier Transform
• Learning Algebraic Models of Quantum Entanglement
• Classifying Entanglement by Algebraic Geometry
• Maximally entangled real states and SLOCC invariants: the 3-qutrit case
• Toward Jordan Decompositions of Tensors