Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

2008/08/14 by Xinhua Peng, Zeyang Liao, Nanyang Xu +4 · 1 citation
Computer Science · Physics and Astronomy · #Adiabatic process #Adiabatic quantum computation #Algorithm #Computer science #Factorization #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum computer #Quantum error correction #Quantum mechanics #Quantum phase estimation algorithm #Quantum-Dot Cellular Automata #Qubit #Range (aeronautics) #quant-ph

paper · pdf · doi:10.1103/physrevlett.101.220405

5 pages, 3 figures

arxiv created 2008/08/14 · openalex publication_date 2008/11/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

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.

Citations

• A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability
• Demonstration of a Compiled Version of Shor’s Quantum Factoring Algorithm Using Photonic Qubits
• Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
• Simple Proof of Equivalence between Adiabatic Quantum Computation and the Circuit Model
• Noise resistance of adiabatic quantum computation using random matrix theory
• Quantum Search by Local Adiabatic Evolution
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Experimental Implementation of an Adiabatic Quantum Optimization Algorithm

Cited by

• Quantum coherence and counterdiabatic quantum computing