Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1611.00998 · Pramana

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

Soham Pal, Saranyo Moitra, V S Anjusha, Anil Kumar, T S Mahesh

Published Jan 1, 2019• 18 citations
arXivHTMLPDF
DOI
10.1007/s12043-018-1684-0

Related papers

A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor

Ashwin Saxena, Abhishek Shukla, Anirban Pathak

arXiv:2009.05840•Quantum Information Processing•Mar 1, 2021•11 citations

Quantum factorization algorithm by NMR ensemble computers

Chien-Yuan Chen, Chih-Cheng Hsueh

Applied Mathematics and Computation•Sep 1, 2005•4 citations

Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

Xinhua Peng, Zeyang Liao, Nanyang Xu +4 more

We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales polynomially with the problem size.

arXiv:0808.1935•Physical Review Letters•Nov 26, 2008•186 citations

Experimental prime factorization via the feedback quantum control

K. B. Hari Krishnan, Vishal Varma, T. S. Mahesh

Prime factorization on quantum processors is typically implemented either via circuit-based approaches such as Shor's algorithm or through Hamiltonian optimization methods based on adiabatic, annealing, or variational techniques. While Shor's algorithm demands high-fidelity quantum gates, Hamiltonian optimization schemes, with prime factors encoded as degenerate ground states of a problem Hamiltonian, generally require substantial classical post-processing to determine control parameters. We propose an all-quantum, measurement-based feedback approach that iteratively steers a quantum system toward the target ground state, eliminating the need for classical computation of drive parameters once the problem Hamiltonian is determined and realized. As a proof of principle, we experimentally factor the biprime 551 using a three-qubit NMR quantum register and numerically analyze the robustness of the method against control field-errors. We further demonstrate scalability by numerically implementing the FALQON factorization of larger biprimes, 9,167 and 2,106,287, using 5 and 9 qubits, respectively.

quant-pharXiv:2601.16116•Physical Review A•Jan 23, 2026•0 citations

Prime Factorization by Quantum Adiabatic Computation

Daniel Eppens

•Jan 1, 2013•0 citations

Quantum Factorization of 143 on a Dipolar-Coupling Nuclear Magnetic Resonance System

Nanyang Xu, Jing Zhu, Dawei Lu +3 more

Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid-crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.

Physical Review Letters•Mar 30, 2012•187 citations
Prime factorization on quantum processors is typically implemented either via circuit-based approaches such as Shor's algorithm or through Hamiltonian optimization methods based on adiabatic, annealing, or variational techniques. While Shor's algorithm demands high-fidelity quantum gates, Hamiltonian optimization schemes, with prime factors encoded as degenerate ground states of a problem Hamiltonian, generally require substantial classical post-processing to determine control parameters. We propose an all-quantum, measurement-based feedback approach that iteratively steers a quantum system toward the target ground state, eliminating the need for classical computation of drive parameters once the problem Hamiltonian is determined and realized. As a proof of principle, we experimentally factor the biprime 551 using a three-qubit NMR quantum register and numerically analyze the robustness of the method against control field-errors. We further demonstrate scalability by numerically implementing the FALQON factorization of larger biprimes, 9,167 and 2,106,287, using 5 and 9 qubits, respectively.
Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid-crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.