Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Universum Technical sciences

DESIGN OF GROVER'S QUANTUM SEARCH ALGORITHM FOR 2-KBIT STATES

Shukhrat Toirov

Published Dec 27, 2023• 1 citation
Publisher

Abstract

Toirov Sh.A. DESIGN OF GROVER'S QUANTUM SEARCH ALGORITHM FOR 2-KBIT STATES // Universum: технические науки : электрон. научн. журн. 2023. 12(117). URL: https://7universum.com/ru/tech/archive/item/16497

DOI
10.32743/unitech.2023.117.12.16497

Related papers

RESEARCH OF QUANTUM TECHNOLOGY AND QUANTUM DEVICES IN CRYPTOGRAPHY

Noilakhon Sobirjоnovna Yakubova, Sarvinoz Jamolova, Muhammadjon Aloydinov

Якубова Н.С., Жамолова С.Р., Алойдинов М.Г. ИССЛЕДОВАНИЕ КВАНТОВЫХ ТЕХНОЛОГИЙ В СИСТЕМАХ ИНТЕЛЛЕКТУАЛЬНОГО УПРАВЛЕНИЯ // Universum: технические науки : электрон. научн. журн. 2024. 3(120). URL: https://7universum.com/ru/tech/archive/item/17067

Universum Technical sciences•Mar 27, 2024•0 citations

The Research of Grover’s Quantum Search Algorithm with Use of Quantum Circuits QX2 and QX4

Arkadiusz Liber, Laurentiu Nita

Advances in intelligent systems and computing•Aug 29, 2018•1 citation

THE PHYSICAL AND MATHEMATICAL MODEL OF DISINTEGRATION PROCESS OF BIOLOGICAL SYSTEMS BY RESONANCE AT THE QUANTUM LEVEL

Evgeniy Sidorov, Evgeniy Yakubovsky

Сидоров Е.П., Якубовский Е.Г. ФИЗИКО-МАТЕМАТИЧЕСКАЯ МОДЕЛЬ ПРОЦЕССА ДЕЗИНТЕГРАЦИИ БИОЛОГИЧЕСКИХ СИСТЕМ ПУТЕМ РЕЗОНАНСА НА КВАНТОВОМ УРОВНЕ // Universum: медицина и фармакология : электрон. научн. журн. 2023. 6(99). URL: https://7universum.com/ru/med/archive/item/15639

Universum Medicine & pharmacology•Jun 11, 2023•0 citations

Quantum searching algorithm based on the weighting marked items

Xin Li, Kaoping Song, Ning Sun +1 more

The current Grover quantum searching algorithm can not identify the difference in importance of the marked items when it is applied to an unsorted quantum database, and the probability for each marked item is equal. To solve the problem, a Grover searching algorithm based on the weighted marked items is proposed. Firstly, each marked item is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the marked items are represented as a quantum superposition state. Secondly, the novel Grover searching algorithm based on the quantum superposition of the weighting marked items is constructed. Using this algorithm the probability of getting each marked item can be approximated to the corresponding weight coefficient, which the flexibility of this algorithm is shown. Finally, the validity of the algorithm is validated by a simple searching example.

Chinese Control Conference (CCC)•Jul 26, 2013•0 citations

Grover's quantum search algorithm and Diophantine approximation (4 pages)

Itamar Pitowsky, Shahar Dolev

Physical Review A•Jan 1, 2006•0 citations

Current Status and Prospects of Quantum Search Algorithm: Grover’s Algorithm

Joonho Bae

New Physics Sae Mulli•Oct 31, 2024•0 citations
Toirov Sh.A. DESIGN OF GROVER'S QUANTUM SEARCH ALGORITHM FOR 2-KBIT STATES // Universum: технические науки : электрон. научн. журн. 2023. 12(117). URL: https://7universum.com/ru/tech/archive/item/16497
The current Grover quantum searching algorithm can not identify the difference in importance of the marked items when it is applied to an unsorted quantum database, and the probability for each marked item is equal. To solve the problem, a Grover searching algorithm based on the weighted marked items is proposed. Firstly, each marked item is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the marked items are represented as a quantum superposition state. Secondly, the novel Grover searching algorithm based on the quantum superposition of the weighting marked items is constructed. Using this algorithm the probability of getting each marked item can be approximated to the corresponding weight coefficient, which the flexibility of this algorithm is shown. Finally, the validity of the algorithm is validated by a simple searching example.