Temat: Oracle - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Design of Grover’s Algorithm over 2, 3 and 4- Qubit Systems in Quantum Programming Studio
Autorzy:: Diana, Jingle
Shylu, Sam
Mano, Mano
Ananth, Jude
Selvaraj, Daniel
Powiązania:: https://bibliotekanauki.pl/articles/2055247.pdf
Data publikacji:: 2022
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: quantum search
Oracle
Qubit
Hadamard
transform
phase shift
Opis:: In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.
Źródło:: International Journal of Electronics and Telecommunications; 2022, 68, 1; 77--82
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model
Autorzy:: Jurkiewicz, Mariusz
Powiązania:: https://bibliotekanauki.pl/articles/2055214.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: forward secure digital signature scheme
bilinear pairing of Type 3
random oracle model
bilinear Diffie-Hellman inversion problem
Opis:: In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn )[p] × E(Fqnk )[p] → Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak ℓ-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.
Źródło:: International Journal of Electronics and Telecommunications; 2021, 67, 4; 717--726
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Oracle" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język