Optimizing Shor’s Algorithm for N=15 and 21

We investigate the optimization of Shor’s algorithm by exploring the factorization of N = 15 and N = 21. A simplified three-qubit circuit is found to successfully factor both cases when the testing integer numbers are appropriately chosen.

Authors

Xiaofeng Qian (ORCID: https://orcid.org/0000-0003-1627-288X)
Gabriele Herr

Publication Details

Published: 2025-01-01
DOI: https://doi.org/10.1364/cleo_at.2025.jps200_207
Primary Topic: Quantum Computing Algorithms and Architecture
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Optimizing Shor’s Algorithm for N=15 and 21

Xiaofeng Qian, Gabriele Herr

Jan 1, 2025

Quantum Computing Algorithms and Architecture

article

Optimizing Shor’s Algorithm for N=15 and 21

Xiaofeng Qian, Gabriele Herr

January 1, 2025article en

Abstract

Openalex Percentile: Top 87%

Quantum Computing Algorithms and Architecture

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimizing Shor’s Algorithm for N=15 and 21 — Xiaofeng Qian, Gabriele Herr · (2025) | TGRS Research Map | TGRS