• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pram/092/02/0026

    • Keywords

       

      Quantum computation, quantum cryptography; quantum communication; NMR implementation of quantum computation

    • Abstract

       

      Quantum 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.

    • Author Affiliations

       

      SOHAM PAL1 SARANYO MOITRA2 V S ANJUSHA1 ANIL KUMAR3 T S MAHESH1

      1. Department of Physics, Indian Institute of Science Education and Research, Pashan 411 008, India
      2. SISSA – International School for Advanced Studies, via Bonomea 265, 34136 Trieste, Italy
      3. Department of Physics and NMR Research Centre, Indian Institute of Science, Bengaluru 560 012, India
    • Dates

       
  • Pramana – Journal of Physics | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2017-2019 Indian Academy of Sciences, Bengaluru.