Generalization of the Bernstein-Vazirani algorithm beyond qubit systems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 9
  • Download : 0
Here, we generalize the Bernstein-Vazirani algorithm beyond qubit systems. First, we review the Bernstein-Vazirani algorithm for determining a bit string. Second, we discuss the generalized Bernstein-Vazirani algorithm for determining a natural number string. The speed of determining the strings is shown to outperform the best classical case by a factor of the number of the systems in every cases.
Publisher
SPRINGER
Issue Date
2020-03
Language
English
Article Type
Article
Citation

QUANTUM STUDIES-MATHEMATICS AND FOUNDATIONS, v.7, no.1, pp.17 - 21

ISSN
2196-5609
DOI
10.1007/s40509-019-00196-4
URI
http://hdl.handle.net/10203/281090
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0