Live briefing
Everything about Shor's algorithm
Quantum algorithm for integer factorization
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (non-quantum) algorithms. However, beating classical computers may require quantum computers with millions of qubits due to the overhead caused by quantum error correction. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Shor's algorithmA 5-minute orientation
- Skim a recent paper: QUANTUM COMPUTING CHALLENGES: EXPLORING DECOHERENCE THROUGH THE LENS OF SHOR'S ALGORITHMInfluential work since 2022
- Pick up a classic book: HackingThe most-reprinted book on the subject
- Read the landmark paper: Realization of a scalable Shor algorithmCited 426 times
- Go sideways: Quantum Fourier transformA closely related topic
- Go sideways: Quantum computingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Realization of a scalable Shor algorithm
Collective decoherence of the superpositional entangled states in the quantum Shor algorithm
Nonresonant effects in the implementation of the quantum Shor algorithm
The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics
Peter Shor on the genesis of Shor’s algorithm
Performance Evaluation of Shor Algorithm on Simulated Quantum Hardware with Circuit Level Analysis
Simulation of Shor Algorithm for Discrete Logarithm Problems With Comprehensive Pairs of Modulo $p$ and Order $q$
Semiclassical Shor algorithm
🆕 Influential since 2022
QUANTUM COMPUTING CHALLENGES: EXPLORING DECOHERENCE THROUGH THE LENS OF SHOR'S ALGORITHM
ALGORITMO DE SHOR
Controller-decoder system requirements derived by implementing Shor's algorithm with surface code
Implementasi Algoritma Kuantum Shor pada Platform IBM Quantum
A Novel Hybrid Quantum Framework for Assessing Noise Effects on Performance of Shor’s Algorithm
📚 Books worth reading
HackingJon Erickson, Jon Erickson · 2003
Classical and Quantum Information TheoryEmmanuel Desurvire · 2009- 📕Modifications and implementation of the Shor-Khachian algorithm for linear programmingDonald Goldfarb · 1980
- 📕Simulation of a Quantum ComputerA. Brailas · 2013
A shortcut through timeJohnson, George · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Quantum Fourier transform In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier…
- Quantum computing A quantum computer is a computer that represents and processes information using quantum states. Quantum computations exploit phenomena such as superposition…
- Quantum supremacy In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that…
- Quantum logic gate In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit…
- Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
- Quantum algorithm In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the…
- Grover's algorithm In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high…
- BQP In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial…