arXiv:quant-ph/0510042 · Physical Review A

Entangled quantum states generated by Shor’s factoring algorithm

Yishai Shimoni, Daniel Shapira, Ofer Biham

Published Dec 6, 2005• 36 citations

Abstract

The intermediate quantum states of multiple qubits, generated during the operation of Shor's factoring algorithm are analyzed. Their entanglement is evaluated using the Groverian measure. It is found that the entanglement is generated during the preprocessing stage of the algorithm and remains nearly constant during the quantum Fourier transform stage. The entanglement is found to be correlated with the speedup achieved by the quantum algorithm compared to classical algorithms.

DOI: 10.1103/physreva.72.062308

Related papers

Entanglement of periodic states, the quantum Fourier transform, and Shor’s factoring algorithm

Yonatan Most, Yishai Shimoni, Ofer Biham

The preprocessing stage of Shor's algorithm generates a class of quantum states referred to as periodic states, on which the quantum Fourier transform is applied. Such states also play an important role in other quantum algorithms that rely on the quantum Fourier transform. Since entanglement is believed to be a necessary resource for quantum computational speedup, we analyze the entanglement of periodic states and the way it is affected by the quantum Fourier transform. To this end, we derive a formula that evaluates the Groverian entanglement measure for periodic states. Using this formula, we explain the surprising result that the Groverian entanglement of the periodic states built up during the preprocessing stage is only slightly affected by the quantum Fourier transform.

arXiv:1001.3145Physical Review AMay 7, 201012 citations

Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure

Yishai Shimoni, Daniel Shapira, Ofer Biham

The Groverian entanglement measure $G(\ensuremath{\psi})$ is applied to characterize pure quantum states $\ensuremath{\mid}\ensuremath{\psi}⟩$ of multiple qubits. This is an operational measure of entanglement in the sense that it quantifies the utility of the state $\ensuremath{\mid}\ensuremath{\psi}⟩$ as an initial state for the search algorithm. A convenient parametrization is presented, which allows us to calculate the Groverian measure analytically for certain states of high symmetry. A numerical procedure is used in order to calculate it for arbitrary pure states of multiple qubits. Using the Groverian measure to evaluate the entanglement produced by quantum algorithms may provide useful insight into the role of entanglement in making quantum algorithms powerful. Here we calculate $G(\ensuremath{\psi})$ for the intermediate states generated during the evolution of Grover's algorithm for various initial states and for different sets of marked states. It is shown that Grover's iterations generate highly entangled states in intermediate stages of the quantum search process, even if the initial state and the target state are product states.

arXiv:quant-ph/0309062Physical Review AJun 2, 200447 citations

Entanglement and its role in Shor's algorithm

Viv M. Kendon, William J. Munro

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.

arXiv:quant-ph/0412140Quantum Information and ComputationNov 1, 200631 citations

Entanglement simulations of Shor's algorithm

S. Parker, Martin Bodo 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 with just one initial pure qubit and a supply of initially maximally mixed qubits (Parker, S. and Plenio, M. B., 2000, Phys. Rev. Lett., 85, 3049). 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:quant-ph/0102136Journal of Modern OpticsJul 1, 200225 citations

Simulation of a Quantum Prime Factoring Algorithm

Elizabeth Ellen Parsons

The intent of this thesis is to elucidate the quantum computing algorithm developed by Peter Shor called Shor's algorithm. We will provide a detailed description and simulation of the algorithm using MATLAB. Precursory information regarding quantum phenomena such as superposition, entanglement, and Dirac notation, will be described in great detail so that the reader may have a better understanding of the operations in Shor's algorithm. Quantum computers store and transport information quite differently than their classical counterparts. We will provide a quick overview of these differences to high- light the benefit of utilizing quantum phenomena in a computer in order to create massive parallel computations. Thus, reducing the complexity time for classical algorithms used to solve problems such as the prime factorization problem and the period finding problem. The Quantum Fourier Transform is a principle component in Shor's algorithm. We will explicitly define the Quantum Fourier Transform and show that it is a unitary transformation. We will also show how the Quantum Fourier Transform, as well as another unitary transformation called the Hadamard transform, functions in Shor's algorithm. One of the initial parameters in Shor's algorithm is to select a random variable. We will examine the erratic effects of this random variable as well as how it effects the probability of us successfully reducing an integer into a product of two primes. We will provide a thorough analysis of the randomness in Shor's algorithm. We will also show how measuring the state of our quantum system as well as selecting a suitable random variable impacts finding the period of the Quantum Fourier Transform which in turn will either give a high or low probability of obtaining a factor of some integer.

Jan 1, 20160 citations

Entanglement Simulations of Shor's Algorithm

Parker, S, Martin Bodo 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 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 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 it's efficiency.

Feb 27, 200117 citations