Generalization of the Bernstein–Vazirani algorithm beyond qubit systems

Koji Nagata; Han Geurdes; Santanu Kumar Patro; Shahrokh Heidari; Ahmed Farouk; Tadao Nakamura

doi:10.1007/s40509-019-00196-4

Generalization of the Bernstein–Vazirani algorithm beyond qubit systems

Koji Nagata^*
, Han Geurdes
, Santanu Kumar Patro
, Shahrokh Heidari
, Ahmed Farouk
, Tadao Nakamura

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	17-21
Number of pages	5
Journal	Quantum Studies: Mathematics and Foundations
Volume	7
Issue number	1
DOIs	https://doi.org/10.1007/s40509-019-00196-4
Publication status	Published - 1 Mar 2020
Externally published	Yes

Keywords

Quantum algorithms
Quantum computation
Quantum information theory

Access to Document

10.1007/s40509-019-00196-4

Cite this

@article{7ace8084a3f64ceca679bc84af321d48,

title = "Generalization of the Bernstein–Vazirani algorithm beyond qubit systems",

abstract = "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.",

keywords = "Quantum algorithms, Quantum computation, Quantum information theory",

author = "Koji Nagata and Han Geurdes and Patro, \{Santanu Kumar\} and Shahrokh Heidari and Ahmed Farouk and Tadao Nakamura",

note = "Publisher Copyright: {\textcopyright} 2019, Chapman University.",

year = "2020",

month = mar,

day = "1",

doi = "10.1007/s40509-019-00196-4",

language = "English",

volume = "7",

pages = "17--21",

journal = "Quantum Studies: Mathematics and Foundations",

issn = "2196-5609",

publisher = "Springer International Publishing",

number = "1",

}

TY - JOUR

T1 - Generalization of the Bernstein–Vazirani algorithm beyond qubit systems

AU - Nagata, Koji

AU - Geurdes, Han

AU - Patro, Santanu Kumar

AU - Heidari, Shahrokh

AU - Farouk, Ahmed

AU - Nakamura, Tadao

PY - 2020/3/1

Y1 - 2020/3/1

N2 - 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.

AB - 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.

KW - Quantum algorithms

KW - Quantum computation

KW - Quantum information theory

UR - https://www.scopus.com/pages/publications/85091781143

U2 - 10.1007/s40509-019-00196-4

DO - 10.1007/s40509-019-00196-4

M3 - Article

AN - SCOPUS:85091781143

SN - 2196-5609

VL - 7

SP - 17

EP - 21

JO - Quantum Studies: Mathematics and Foundations

JF - Quantum Studies: Mathematics and Foundations

IS - 1

ER -

Generalization of the Bernstein–Vazirani algorithm beyond qubit systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this