Quantum computation and Shor's factoring algorithm
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for f...
| Main Authors: | , |
|---|---|
| פורמט: | Journal article |
| יצא לאור: |
1996
|
| _version_ | 1826256849921376256 |
|---|---|
| author | Ekert, A Jozsa, R |
| author_facet | Ekert, A Jozsa, R |
| author_sort | Ekert, A |
| collection | OXFORD |
| description | Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for solving this problem. The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory. They discuss experiments that may contribute to its practical implementation. |
| first_indexed | 2024-03-06T18:08:48Z |
| format | Journal article |
| id | oxford-uuid:024e1fab-5faa-497a-a106-c54ae0c6df71 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:08:48Z |
| publishDate | 1996 |
| record_format | dspace |
| spelling | oxford-uuid:024e1fab-5faa-497a-a106-c54ae0c6df712022-03-26T08:39:56ZQuantum computation and Shor's factoring algorithmJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:024e1fab-5faa-497a-a106-c54ae0c6df71Symplectic Elements at Oxford1996Ekert, AJozsa, RCurrent technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for solving this problem. The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory. They discuss experiments that may contribute to its practical implementation. |
| spellingShingle | Ekert, A Jozsa, R Quantum computation and Shor's factoring algorithm |
| title | Quantum computation and Shor's factoring algorithm |
| title_full | Quantum computation and Shor's factoring algorithm |
| title_fullStr | Quantum computation and Shor's factoring algorithm |
| title_full_unstemmed | Quantum computation and Shor's factoring algorithm |
| title_short | Quantum computation and Shor's factoring algorithm |
| title_sort | quantum computation and shor s factoring algorithm |
| work_keys_str_mv | AT ekerta quantumcomputationandshorsfactoringalgorithm AT jozsar quantumcomputationandshorsfactoringalgorithm |