3 papers
quant-ph2001
Entanglement Simulations of Shor's Algorithm
S. Parker, M. B. Plenio
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 w…
quant-ph2000
Efficient factorization with a single pure qubit and mixed qubits
S. Parker, M. B. Plenio
It is commonly assumed that Shor's quantum algorithm for the efficient factorization of a large number requires a pure initial state. Here we demonstrate that a single pure qub…
quant-ph1999
Entanglement quantification and purification in continuous variable systems
S. Parker, S. Bose, M. B. Plenio
We develop theoretical and numerical tools for the quantification of entanglement in systems with continuous degrees of freedom. Continuous variable entanglement swapping is introd…