Entanglement simulations of Shor's algorithm
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature?
- Mixed-state entanglement and quantum error correction
- On the Problem of Hidden Variables in Quantum Mechanics
- Ordering states with entanglement measures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum remote control: teleportation of unitary operations
- Separability Criterion for Density Matrices
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(13)- The elusive source of quantum speedup
- Quantum entanglement involved in Grover's and Shor's algorithms: the four-qubit case
- Simulation of a quantum algorithm for phase estimation
- Computer simulation of Einstein-Podolsky-Rosen-Bohm experiments
- Quantum entanglement
- Collective decoherence of the superpositional entangled states in the quantum Shor algorithm
- Scalability of Shor’s algorithm with a limited set of rotation gates
- The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics
- Entanglement and its role in Shor's algorithm
- On the role of entanglement in quantum-computational speed-up
- Entanglement spectroscopy with a depth-two quantum circuit
- A two-way algorithm for the entanglement problem
- Simulation of \(n\)-qubit quantum systems. II. Separability and entanglement
This page was built for publication: Entanglement simulations of Shor's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4463584)
