Entanglement and its Role in Shor's Algorithm

Abstract

Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their classical counterparts. The nature of this resource is still not fully understood: here we use numerical simulation to investigate how entanglement between register qubits varies as Shor's algorithm is run on a quantum computer. The shifting patterns in the entanglement are found to relate to the choice of basis for the quantum Fourier transform.

15 pages, 4 eps figures, v1-3 were for conference proceedings (not included in the end); v4 is improved following referee comments, expanded explanations and added references

References in corpus (16)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Separability Criterion for Density Matrices
• Distributed Entanglement
• Efficient classical simulation of slightly entangled quantum computations
• Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
• A Theory of Fault-Tolerant Quantum Computation
• Exponential algorithmic speedup by quantum walk
• Quantum Networks for Elementary Arithmetic Operations
• Bound entanglement can be activated
• On the volume of the set of mixed entangled states II
• Fast Quantum Modular Exponentiation
• Universality of Entanglement and Quantum Computation Complexity
• Fast versions of Shor's quantum factoring algorithm
• Scalability of Shor's algorithm with a limited set of rotation gates
• Entangled Quantum States Generated by Shor's Factoring Algorithm
• Macroscopic entanglement in Quantum Computation