A prime factorization based on quantum dynamics on a spin ensemble (I)

Abstract

In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime factorization is based on the basic principle that both a closed quantum system and its ensemble obey the same unitary dynamics of quantum mechanics if there is not any decoherence effect in both the quantum system and its ensemble. It uses the NMR multiple-quantum measurement techniques to output the quantum computational results that are the inphase multiple-quantum spectra of the spin ensemble. It has been shown that the inphase NMR multiple-quantum spectral intensities used to search for the period of the modular exponential function may reduce merely in a polynomial form as the qubit number of the spin ensemble. The time evolution process of the modular exponential operation on the quantum computer obeys the unitary dynamics of quantum mechanics and hence the computational output is governed by the quantum dynamics. This essential difference between the quantum computer and the classical one could be the key point for the quantum computation outperforming the classical one in the prime factorization on a spin ensemble without any quantum entanglement. It has been shown that the prime factorization based on the quantum dynamics on a spin ensemble is locally efficient at least. This supports the conjecture that the quantum dynamics could play an important role for the origin of power of quantum computation and quantum entanglement could not be a unique resource to achieve power of quantum computation in the prime factorization.

Latex2 file with 39 Pages without figures

References in corpus (14)

• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Quantum Algorithms Revisited
• On the Power of One Bit of Quantum Information
• Quantum Networks for Elementary Arithmetic Operations
• Separability of very noisy mixed states and implications for NMR quantum computing
• Efficient Networks for Quantum Factoring
• Sophisticated quantum search without entanglement
• Quantum Algorithms: Entanglement Enhanced Information Processing
• Quantum search without entanglement
• Quantum factoring, discrete logarithms and the hidden subgroup problem
• A polynomial-time solution to the parity problem on an NMR quantum computer
• Universal construction of unitary transformation of quantum computation with one- and two-body interactions
• Solving the quantum search problem in polynomial time on an NMR quantum computer
• Universal construction for the unsorted quantum search algorithms

Cited by in corpus (2)

• The universal quantum driving force to speed up a quantum computation -- The unitary quantum dynamics
• The basic principles to construct a generalized state-locking pulse field and simulate efficiently the reversible and unitary halting protocol of a universal quantum computer