Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
From MaRDI portal
(Redirected from Publication:2102279)
Recommendations
- scientific article; zbMATH DE number 5320229
- A low-resource quantum factoring algorithm
- Quantum factoring algorithm: resource estimation and survey of experiments
- Scalability of Shor’s algorithm with a limited set of rotation gates
- Implementation of Shor's algorithm on a linear nearest neighbour qubit array
Cites work
- scientific article; zbMATH DE number 5320229 (Why is no real title available?)
- Multiple-particle interference and quantum error correction
- Quantum computation and quantum information. 10th anniversary edition
- Scalability of Shor’s algorithm with a limited set of rotation gates
- Surface code quantum computing by lattice surgery
Cited in
(9)- Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor
- Hierarchical system mapping for large-scale fault-tolerant quantum computing
- MINIMAL EXECUTION TIME OF SHOR'S ALGORITHM AT LOW TEMPERATURES
- Quantum factoring algorithm: resource estimation and survey of experiments
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- An improved circuit for Shor's factoring algorithm using 2n+2 qubits
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Logarithmic-depth MCT gate implementation method on a given arbitrary number of clean ancillae
This page was built for publication: Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102279)
