A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
From MaRDI portal
Publication:3522571
zbMATH Open1152.81818MaRDI QIDQ3522571FDOQ3522571
Authors:
Publication date: 3 September 2008
Recommendations
Cited In (20)
- An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- An improved circuit for Shor's factoring algorithm using \(2n+2\) qubits
- \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
- Variational quantum computation integer factorization algorithm
- Power of uninitialized qubits in shallow quantum circuits
- A fast quantum circuit for addition with few qubits
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Title not available (Why is that?)
- On the various ways of quantum implementation of the modular exponentiation function for Shor's factorization
- Title not available (Why is that?)
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Title not available (Why is that?)
- Quantum factoring algorithm: resource estimation and survey of experiments
- Space-efficient and noise-robust quantum factoring
- Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm
- Shor’s Quantum Factoring Algorithm on a Photonic Chip
- A low-resource quantum factoring algorithm
- Implementation of Shor's algorithm on a linear nearest neighbour qubit array
This page was built for publication: A quantum 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 Q3522571)
