Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure

Desouza, Luciano Serafim; Carvalho, Jonathan H. A. de; Ferreira, Tiago A. E.

doi:10.1109/tc.2021.3051559

Cited by 7 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the methods to implement various network-based protocols is to use the toolkit of the quantum walk formalism. Quantum walks on networks have been used for various applications such as search problems [28][29][30][31], state transfer and quantum routing [32][33][34][35], evaluation of information flow through networks [36][37][38][39], training of neural networks [40,41], properties of percolation graphs [42][43][44], and universal quantum computation [45][46][47][48].…”

Section: Introductionmentioning

confidence: 99%

Quantum walk-based protocol for secure communication between any two directly connected nodes on a network

Chawla,

Ajith,

Chandrashekar

2023

Phys. Scr.

View full text Add to dashboard Cite

The utilization of quantum entanglement as a cryptographic resource has superseded conventional approaches to secure communication. Security and fidelity of intranetwork communication between quantum devices is the backbone of a quantum network. This work presents an algorithm that generates entanglement between any two directly connected nodes of a quantum network to be used as a resource to enable quantum communication across that pair in the network. The algorithm is based on a directed discrete-time quantum walk and paves the way for private inter-node quantum communication channels in the network. We also present the simulation results of this algorithm on random networks generated from various models. We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible and this holds independent of the random graph generation model. This constitutes a viable method for the practical realisation of secure communication over any random network topology.

show abstract

Section: Introductionmentioning

confidence: 99%

Quantum walk-based protocol for secure communication between any two directly connected nodes on a network

Chawla,

Ajith,

Chandrashekar

2023

Phys. Scr.

View full text Add to dashboard Cite

show abstract

“…Retrieving higher than two quantities per solution is supposed to enlarge the spectrum of applications. For example, one application we glimpse is to use the LQW to search all weights and biases of artificial neural networks, inspired by the incipient work developed in [35] after consolidated in [36], which applied a lackadaisical quantum walk for complete graphs. As quantum information routing by quantum walks can benefit from high dimensional cases [13], spatial information search by quantum walks can also.…”

mentioning

confidence: 99%

On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids

Carvalho¹,

Souza²,

Neto³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Quantum computing holds the promise of improving the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than their classical counterparts. A quantum-walk-based algorithm that is standing out in the literature is the lackadaisical quantum walk. The lackadaisical quantum walk is an algorithm developed to search two-dimensional grids whose vertices have a self-loop of weight l. In this paper, we address several issues related to the application of the lackadaisical quantum walk to successfully search for multiple solutions on grids. Firstly, we show that only one of the two stopping conditions found in the literature is suitable for simulations. We also demonstrate that the final success probability depends on the space density of solutions and the relative distance between solutions. Furthermore, this work generalizes the lackadaisical quantum walk to search for multiple solutions on grids of arbitrary dimensions. In addition, we propose an optimal adjustment of the self-loop weight l for such scenarios of arbitrary dimensions. It turns out the other fits of l found in the literature are particular cases. Finally, we observe a two-to-one relation between the steps of the lackadaisical quantum walk and the ones of Grover's algorithm, which requires modifications in the stopping condition. In conclusion, this work deals with practical issues one should consider when applying the lackadaisical quantum walk, besides expanding the technique to a wider range of search problems.

show abstract

The Future of Drug Development with Quantum Computing

Bonde,

Patil,

Choubey

2023

Methods in Molecular Biology

View full text Add to dashboard Cite

Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure

Cited by 7 publications

References 31 publications

Quantum walk-based protocol for secure communication between any two directly connected nodes on a network

Quantum walk-based protocol for secure communication between any two directly connected nodes on a network

On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids

The Future of Drug Development with Quantum Computing

Contact Info

Product

Resources

About