Quantum Computing and Shor`s Factoring Algorithm

Igor V. Volovich

Quantum Computing and Shor`s Factoring Algorithm

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0109004 v1 pith:34I4PW7Z submitted 2001-09-02 quant-ph hep-thmath-phmath.MP

Igor V. Volovich This is my paper · ORCID

classification quant-phhep-thmath-phmath.MP

keywords quantumalgorithmcomputingfactoringshoralgorithmscircuitscomplexity

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm. Factoring integers. NP-complete problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

QuanUML: Towards A Modeling Language for Model-Driven Quantum Software Development
cs.SE 2025-06 conditional novelty 5.0 of 10

QuanUML extends UML with stereotypes and sequence-diagram conventions for qubits, gates, measurements, and classical control, demonstrated on dynamic circuits and Shor's algorithm.

Pith tools