Entanglement Simulations of Shor's Algorithm
arXiv:quant-ph/0102136 · doi:10.1080/09500340110107207
Abstract
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally maximally mixed qubits (S. Parker and M. B. Plenio, Phys. Rev. Lett. 85, 3049 (2000)) . This leads us to ask how this affects the entanglement in the algorithm. We thus investigate the behaviour of entanglement in Shor's algorithm for small numbers of qubits by classical computer simulation of the quantum computer at different stages of the algorithm. We find that entanglement is an intrinsic part of the algorithm and that the entanglement through the algorithm appears to be closely related to the amount of mixing. Furthermore, if the computer is in a highly mixed state any attempt to remove entanglement by further mixing of the algorithm results in a significant decrease in its efficiency.
arXiv comment17 pages including 16 figures. Typos corrected and more efficient simulation methods outlined
References in corpus (18)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Mixed State Entanglement and Quantum Error Correction
- Separability Criterion for Density Matrices
- Concentrating Partial Entanglement by Local Operations
- Entanglement of a Pair of Quantum Bits
- Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
- On the Power of One Bit of Quantum Information
- Quantum Networks for Elementary Arithmetic Operations
- Entanglement monotones
- Robustness of entanglement
- Semiclassical Fourier Transform for Quantum Computation
- A comparison of entanglement measures
- Entanglement in Quantum Information Theory
- Quantum remote control: Teleportation of unitary operations
- Minimal conditions for local pure-state entanglement manipulation
- Efficient factorization with a single pure qubit and mixed qubits
- Ordering States with Entanglement Measures
- Effects of noise on quantum error correction algorithms
Cited by in corpus (19)
- Quantum entanglement
- Quantum Coherence as a Resource
- Universality of Entanglement and Quantum Computation Complexity
- The elusive source of quantum effectiveness
- Noise-resilient Quantum Computing with a Nitrogen-Vacancy Center and Nuclear Spins
- Entanglement and coherence in Bernstein-Vazirani algorithm
- Arbitrary Nuclear Spin Gates in Diamond Mediated by a NV-center Electron Spin
- Thermal Equilibrium as an Initial State for Quantum Computation by NMR
- Of Local Operations and Physical Wires
- Coherence Depletion in Quantum Algorithms
- Decoherence of two maximally entangled qubits in a lossy nonlinear cavity
- Quantum Entanglement involved in Grover's and Shor's algorithms: the four-qubit case
- Entanglement of Periodic States, the Quantum Fourier Transform and Shor's Factoring Algorithm
- Effects of dynamical phases in Shor's factoring algorithm with operational delays
- ZKCM: a C++ library for multiprecision matrix computation with applications in quantum information
- Necessity of Superposition of Macroscopically Distinct States for Quantum Computational Speedup
- Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation
- Fermionic Partial Transpose in the Overlap Matrix Framework for Entanglement Negativity
- Entanglement Trajectory and its Boundary