A low-resource quantum factoring algorithm
type: Item
instance of: scholarly article
title: A low-resource quantum factoring algorithm
zbMATH Open document ID: 1437.94048
DOI: 10.1007/978-3-319-59879-6_19
author: Daniel J. Bernstein
author: Jean-François Biasse
author: Michele Mosca
publication date: 2018-09-12T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 11Y05
zbMATH DE Number: 6935752
MaRDI profile type: Publication
full work available at URL: 978-3-319-59879-6 19
OpenAlex ID: W2621050557
Recommended article: Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments
Recommended article: ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
Recommended article: Efficient diabatic quantum algorithm in number factorization
Recommended article: Q2724450
Recommended article: The cost reduction of distributed quantum factorization circuits
Recommended article: Quantum algorithms for computing short discrete logarithms and factoring RSA integers
Recommended article: A FINE ESTIMATE OF QUANTUM FACTORIZATION SUCCESS PROBABILITY
Recommended article: Q3522571
Recommended article: Quantum Computers, Factoring, and Decoherence
description: scientific article; zbMATH DE number 6935752