filmov
tv
Quantum Query Complexity
Показать описание
About the Project:
Our paper explores new function promises for the Bernstein-Vazirani algorithm, aiming to identify configurations that yield orthogonal basis vectors, a key factor in the efficiency of quantum algorithms. We investigate Svetlichny-like functions and demonstrate that, for these functions, the bits of s can be recovered classically in n queries. Through simulation and analysis, we find that the complexity of the function terms inversely affects the basis size. Additionally, our project included the creation of tutorials on practical quantum programming topics.
#finalyearprojects #education #revolutionizing #quantum #query #complexity #research #paper #ibakarachi #ibasmcs
Our paper explores new function promises for the Bernstein-Vazirani algorithm, aiming to identify configurations that yield orthogonal basis vectors, a key factor in the efficiency of quantum algorithms. We investigate Svetlichny-like functions and demonstrate that, for these functions, the bits of s can be recovered classically in n queries. Through simulation and analysis, we find that the complexity of the function terms inversely affects the basis size. Additionally, our project included the creation of tutorials on practical quantum programming topics.
#finalyearprojects #education #revolutionizing #quantum #query #complexity #research #paper #ibakarachi #ibasmcs
1:00:04
0:02:23
0:49:50
0:34:30
0:27:18
0:21:44
0:47:30
1:21:31
1:21:05
0:46:55
0:40:07
1:19:18
0:26:45
1:17:22
0:29:32
0:35:09
0:22:16
0:55:20
0:22:52
0:59:04
0:34:36
0:50:23
0:43:56
0:28:18