Hybrid scheme for factorisation: Factoring 551 using a 3-qubit NMR quantum adiabatic processor

AbstractQuantum processors are potentially superior to their classical counterparts for many computational tasks including factorisation. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the factors of a given composite number. The main challenge in scaling it to larger numbers is the unavailability of large number of qubits. Here, we propose a hybrid scheme that involves both classical and quantum computation, based on the previous work of Peng et al, Phys. Rev. Lett.101(22), 220405 (2008), which reduces the number of qubits required for factorisation. The classical part involves setting up and partially simplifying a set of bit-wise factoring equations and the quantum part involves solving these coupled equations using a quantum adiabatic process. We demonstrate the hybrid scheme by factoring 551 using a 3-qubit NMR quantum register.

[1]  A. Pati,et al.  Experimental test of the quantum no-hiding theorem. , 2010, Physical review letters.

[2]  Biao Wu,et al.  Optimizing the quantum adiabatic algorithm , 2015, 1508.05089.

[3]  Dieter Suter,et al.  Quantum adiabatic algorithm for factorization and its experimental implementation. , 2008, Physical review letters.

[4]  N. Koblitz.  A Course in Number Theory and Cryptography , 1987 .

[5]  M. Levitt.  Spin Dynamics: Basics of Nuclear Magnetic Resonance , 2001 .

[6]  Jian-Wei Pan,et al.  Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits. , 2007, Physical review letters.

[7]  T. S. Mahesh,et al.  NMR implementation of adiabatic SAT algorithm using strongly modulated pulses. , 2008, The Journal of chemical physics.

[8]  T. Monz,et al.  Realization of a scalable Shor algorithm , 2015, Science.

[9]  Gaurav Bhole,et al.  Steering quantum dynamics via bang-bang control: Implementing optimal fixed-point quantum search algorithm , 2015, 1512.08385.

[10]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[11]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[12]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[13]  E. Knill,et al.  EFFECTIVE PURE STATES FOR BULK QUANTUM COMPUTATION , 1997, quant-ph/9706053.

[14]  I. Chuang,et al.  Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.

[15]  H. Kalbitzer,et al.  Protein NMR Spectroscopy. Principles and Practice , 1997 .

[16]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[17]  Efficient quantum-state tomography for quantum-information processing using a two-dimensional Fourier-transform technique , 2002, quant-ph/0212116.

[18]  J. Linnett,et al.  Quantum mechanics , 1975, Nature.

[19]  Jonathan A. Jones,et al.  Magnetic Field Sensing Beyond the Standard Quantum Limit Using 10-Spin NOON States , 2008, Science.

[20]  Jiangfeng Du,et al.  Quantum factorization of 143 on a dipolar-coupling nuclear magnetic resonance system. , 2012, Physical review letters.

[21]  D. Leung,et al.  Bulk quantum computation with nuclear magnetic resonance: theory and experiment , 1998, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[22]  Andrew M. Childs,et al.  Robustness of adiabatic quantum computation , 2001, quant-ph/0108048.

[23]  Timothy F. Havel,et al.  Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing , 1997, quant-ph/9709001.