1887

n Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie - 'n Universele programmeerbare kwantumrekenaar? : research and review article

Volume 27, Issue 3
  • ISSN : 0254-3486
  • E-ISSN: 2222-4173

Abstract

Research into quantum computation over the past 20 years has been very successful in stimulating the development of quantum cryptography (already in industrial application), the study of quantum information and the discovery of novel algorithms for traditionally hard and interesting problems such as prime factorisation. This paper attempts to explain why certain (strong and interesting) results in quantum computation still fall short of establishing universality (and programmability) for quantum computing. The notion of a universal computing device in a specific class is crucial for the development of a complexity theory and - more basically - establishes the notion of programmability. We review the well-established notions of universality in classical deterministic and probabilistic computing before moving on to examine the concept of a "universal QTM" introduced by Deutsch.

In hierdie bydrae word die vernaamste resultate oor sogenaamde kwantumberekening toegelig. Daar word 'n oorsig gegee oor die model wat gebaseer is op die kwantummeganiese Turing-masjien (KTM) van Deutsch. Ons lig die konsep van berekeningsuniversaliteit toe vir probabilistiese rekentoestelle en vergelyk dít met die vereistes wat aan 'n veronderstelde universele KTM gestel sou word. Die vermoede word geopper dat die semi-universele hibriede toestel (SUHT) wat deur die resultaat van Bernstein en Vazirani gesuggereer word, essensieel nie kwantummeganies is nie.

Loading full text...

Full text loading...

Loading

Article metrics loading...

/content/aknat/27/3/EJC20430
2008-09-01
2019-08-19

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error