Scalability of Shor’s algorithm with a limited set of rotation gates

DOI10.1103/PhysRevA.70.032329zbMath1227.81115arXivquant-ph/0306018OpenAlexW1976592666WikidataQ59423839 ScholiaQ59423839MaRDI QIDQ3102502

Lloyd C. L. Hollenberg, Austin G. Fowler

Publication date: 4 December 2011

Published in: Physical Review A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0306018

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (6)

Optimal length of decomposition sequences composed of imperfect gates ⋮ An improved circuit for Shor's factoring algorithm using \(2n+2\) qubits ⋮ Shor's Factoring Algorithm and Modular Exponentiation Operators ⋮ Faster quantum chemistry simulation on fault-tolerant quantum computers ⋮ Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms ⋮ Structural stability of the quantum Fourier transform

Cites Work

• Multiple-particle interference and quantum error correction
• A method for obtaining digital signatures and public-key cryptosystems
• Quantum computations: algorithms and error correction

This page was built for publication: Scalability of Shor’s algorithm with a limited set of rotation gates