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

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

Full description

Saved in:
Bibliographic Details
Published in:Pramāṇa 2019-02, Vol.92 (2), p.1-8, Article 26
Main Authors: Pal, Soham, Moitra, Saranyo, Anjusha, V S, Kumar, Anil, Mahesh, T S
Format: Article
Language:English
Subjects:
Adiabatic flow
Astronomy
Astrophysics and Astroparticles
Factorization
Mathematical analysis
Microprocessors
NMR
Nuclear magnetic resonance
Observations and Techniques
Physics
Physics and Astronomy
Qubits (quantum computing)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0304-4289
0973-7111
DOI:10.1007/s12043-018-1684-0