Cargando…
An introduction to quantum computing algorithms
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2000
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-1-4612-1390-1 http://cds.cern.ch/record/2006128 |