An improved circuit for Shor's factoring algorithm using 2n+2 qubits

DOI10.1007/S11128-023-04159-YMaRDI QIDQ6139230OpenAlexFDO

Authors Song Xiuli, Wen Liangsen

Publication date 16 January 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-023-04159-y

zbMATH Keywords

quantum circuitfactoringShor's algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• A quantum circuit for Shor's factoring algorithm using \(2n+2\) qubits
• scientific article
• Implementation of Shor's algorithm on a linear nearest neighbour qubit array
• Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
• A fast quantum circuit for addition with few qubits

Cites work

• scientific article; zbMATH DE number 5320229 (Why is no real title available?)
• scientific article; zbMATH DE number 5320330 (Why is no real title available?)
• scientific article; zbMATH DE number 5320404 (Why is no real title available?)
• Quantum arithmetic with the quantum Fourier transform
• Quantum computation and quantum information. 10th anniversary edition
• Realization of a scalable shor algorithm
• Scalability of Shor’s algorithm with a limited set of rotation gates

This page was built for publication: An improved circuit for Shor's factoring algorithm using \(2n+2\) qubits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139230)