Probability Analysis of a Quantum Computer
G\"oran Einarsson
TL;DR
This paper analyzes the probability distribution of outcomes in Shor's quantum algorithm for integer factorization, focusing on the quantum nature-induced randomness and success probabilities.
Contribution
It provides a detailed investigation of the output probability distribution and success chances of Shor's quantum algorithm, enhancing understanding of its probabilistic behavior.
Findings
Quantifies the success probability of Shor's algorithm
Analyzes the impact of quantum randomness on outcomes
Provides insights into optimizing quantum factorization processes
Abstract
The quantum computer algorithm by Peter Shor for factorization of integers is studied. The quantum nature of a QC makes its outcome random. The output probability distribution is investigated and the chances of a successful operation is determined
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications