An improved circuit for Shor's factoring algorithm using 2n+2 qubits
From MaRDI portal
Publication:6139230
DOI10.1007/S11128-023-04159-YOpenAlexW4388420055MaRDI QIDQ6139230FDOQ6139230
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
Cites Work
- Quantum computation and quantum information. 10th anniversary edition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Realization of a scalable Shor algorithm
- Title not available (Why is that?)
- Quantum arithmetic with the quantum Fourier transform
- 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)
