Výsledky vyhledávání - "Tonchev, Hristo"

Report

Robustness of Quantum Random Walk Search with multi-phase matching

In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration, the algorithm

Externí odkaz: http://arxiv.org/abs/2404.05084

Zobrazit plný text záznamu

Report

Robustness of different modifications of Grovers algorithm based on generalized Householder reflections with different phases

Autor: Tonchev, Hristo, Danev, Petar

In this work we study five Grovers algorithm modifications, where each iteration is constructed by two generalized Householder reflections, against inaccuracies in the phases. By using semi-empirical methods, we investigate various characteristics of

Externí odkaz: http://arxiv.org/abs/2401.03602

Zobrazit plný text záznamu

Report

Security of a Grover's Algorithm-based secret sharing protocol, generalized for an arbitrary number of participants, against interception attacks

Autor: Tonchev, Hristo, Bahtev, Rosen

In this work, we study interception attacks against a secret sharing protocol based on Grovers search algorithm. Unlike previous works that only give the algorithm for two and three participants, we have generalized the algorithm for any number of pa

Externí odkaz: http://arxiv.org/abs/2310.02136

Zobrazit plný text záznamu

Report

Robustness of Quantum Random Walk Search Algorithm in Hypercube when only first or both first and second neighbors are measured

Autor: Tonchev, Hristo, Danev, Petar

In this work we study the robustness of two modifications of quantum random walk search algorithm on hypercube. In the first previously suggested modification, on each even iteration only quantum walk is applied. And in the second, the closest neighb

Externí odkaz: http://arxiv.org/abs/2305.15073

Zobrazit plný text záznamu

Report

Reducing number of gates in quantum random walk search algorithm via modification of coin operators

Autor: Tonchev, Hristo, Danev, Petar

This paper examines a way to simplify the circuit of quantum random walk search algorithm, when the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier. If an appropriate relation between corre

Externí odkaz: http://arxiv.org/abs/2204.12858

Zobrazit plný text záznamu

Report

High robustness quantum walk search algorithm with qudit Householder traversing coin, machine learning study

Autor: Tonchev, Hristo, Danev, Petar

In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combina

Externí odkaz: http://arxiv.org/abs/2111.10926

Zobrazit plný text záznamu

Report

Optimizing the walk coin in the quantum random walk search algorithm through machine learning

Autor: Tonchev, Hristo, Danev, Petar

This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift, against inaccuracies in the phases used to construct the coin. The opti

Externí odkaz: http://arxiv.org/abs/2105.08020

Zobrazit plný text záznamu