zoom_in Click to enlarge

Shor code

▲ ▼

description Shor code Overview

Shor’s code is a specific type of quantum circuit designed for stabilizer operations. It’s notable as a fundamental building block in constructing larger quantum computers and particularly useful for error correction within nine-qubit systems. Researchers and developers working on scalable quantum computing and advanced cryptography benefit from understanding Shor's code’s principles.

help Shor code FAQ

What is Shor's algorithm and why is it important?

Shor's algorithm is a quantum algorithm, published by Peter Shor in 1994, that can factor large integers in polynomial time. This matters because widely used public-key encryption systems like RSA rely on the computational difficulty of integer factorization for classical computers.

Could Shor's algorithm break RSA encryption?

In principle, a sufficiently large and error-corrected quantum computer running Shor's algorithm could factor RSA keys, breaking the encryption. However, current quantum hardware lacks the qubit count and fidelity needed to threaten RSA keys of practical sizes such as 2048 bits.

What is post-quantum cryptography and how does it relate to Shor's algorithm?

Post-quantum cryptography refers to classical encryption algorithms designed to resist attacks from both quantum and classical computers, including Shor's algorithm. NIST has been standardizing such algorithms, selecting CRYSTALS-Kyber (now ML-KEM) for key encapsulation in its finalized standard published in 2024.

Has Shor's algorithm been demonstrated on a real quantum computer?

Small-scale demonstrations of Shor's algorithm have factored trivial numbers such as 15 and 21 on early quantum processors. These experiments are proof-of-concept and are far from the qubit counts needed for cryptographically relevant factorization.

swap_horiz

Looking for Shor code alternatives? Compare top competitors ranked & scored

arrow_forward