Title
Solving Bernstein and Vazirani's Problem with the 2-bit Permutation Function
Abstract
In this paper, we propose a novel quantum algorithm, based on the Bernstein-Vazirani algorithm, for finding a if the function f (x) = a . pi(x), where a, x is an element of {0, 1}(2) and pi(x) is a 2-bit permutation function. Note that theBernstein-Vazirani algorithm cannot find a when we select the function f (x) = a . pi(x), where pi(x) = ((2013) (0123)). Our algorithm can be further applied to Nagata et al.'s problem. Our algorithm will output g(A(1)) and g(A(0)) if the function f (x) = (g(A(1))g(A(0)))(2) . pi(x), where A(1), A(0) is an element of {0, 1}(m), x is an element of {0, 1}(2) and g : {0, 1}(m) -> {0, 1}.
Year
DOI
Venue
2022
10.1007/s11128-021-03345-0
QUANTUM INFORMATION PROCESSING
Keywords
DocType
Volume
Quantum algorithm, Bernstein-Vazirani algorithm
Journal
21
Issue
ISSN
Citations 
1
1570-0755
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Chien-Yuan Chen100.34
Chung-Yao Chang200.34
Chih-Cheng Hsueh300.34