Physical Review A · 2010 · 12 citations · 28 references
ComputingComputer SciencePhysicsAlgorithmsQuantum ComputingQuantum MechanicsQuantum AlgorithmsQuantum BitsQuantum ComputationQuantum EntanglementQuantum Fourier TransformQuantum StatesQuantum SpeedupShor's AlgorithmShor's Factoring Algorithm
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.
28
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
Quantum computation and quantum information
Jim Law · ACM SIGSOFT Software Engineering Notes · 2001 · 19.2K citations
Computing, Computer Science, Physics +13
Simulating physics with computers
Richard P. Feynman · International Journal of Theoretical Physics · 1982 · 7.5K citations
Three qubits can be entangled in two inequivalent ways
Wolfgang Dür, Guifré Vidal, J. I. Cirac · Physical Review A · 2000 · 3.4K citations · Full text