Quantum percolation in quasicrystals using continuous-time quantum walk

Chawla, Prateek; Ambarish, C. V.; Chandrashekar, C. M.

doi:10.1088/2399-6528/ab5ce0

Cited by 11 publications

(6 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quantum walk [1][2][3][4][5] , a quantum mechanical analogue of classical random walk has been the basis for many quantum algorithms [6][7][8][9][10][11] and schemes for quantum simulations [12][13][14][15][16][17][18] . The dynamics of quantum walk have been described in several ways, however, they can be broadly classified under the two of the most distinct and prominent categories, the continuous-time and discrete-time quantum walks.…”

Section: Universal Quantum Computing Using Single-particle Discrete-t...mentioning

confidence: 99%

Universal quantum computing using single-particle discrete-time quantum walk

Singh

Chawla

Sarkar

et al. 2021

Sci Rep

Self Cite

View full text Add to dashboard Cite

Quantum walk has been regarded as a primitive to universal quantum computation. In this paper, we demonstrate the realization of the universal set of quantum gates on two- and three-qubit systems by using the operations required to describe the single particle discrete-time quantum walk on a position space. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.

show abstract

Section: Universal Quantum Computing Using Single-particle Discrete-t...mentioning

confidence: 99%

Universal quantum computing using single-particle discrete-time quantum walk

Singh

Chawla

Sarkar

et al. 2021

Sci Rep

Self Cite

View full text Add to dashboard Cite

show abstract

“…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.

Self Cite

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

“…In the recent years, quantum walks have gained considerable interest as efficient tool to model controlled quantum dynamics [1][2][3][4][5][6][7]. Much like a classical random walk, quantum walks also admit discrete-time and continuous-time realizations.…”

Section: Introductionmentioning

confidence: 99%

Superposition of causal order in quantum walks: non-Markovianity and causal asymmetry

Chawla¹,

Shrikant²,

Chandrashekar³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

We set the criteria for a quantum walk to exhibit nontrivial dynamics when placed in an indefinite causal order and study two-period quantum walks when the evolution operator is arranged in a causally ordered sequence and in an indefinite causal order using quantum switch. When either forward or backward causal sequence is implemented, one observes a causal asymmetry in the dynamics, in the sense that the reduced dynamics of the coin state is more non-Markovian for one particular temporal order of operations than that of the other. When the dynamics is defined using evolution operators in a superposition of causal orders, the reduced dynamics of the coin space exhibit higher non-Markovian behavior than either of the definite causal orders. This effect can be interpreted as a Parrondo-like effect in non-Markovianity of the reduced state dynamics of the coin. We further generalize the qualitative description of our results pertaining to the dynamics when the walk has a higher number of periods.

show abstract

Quantum percolation in quasicrystals using continuous-time quantum walk

Cited by 11 publications

References 47 publications

Universal quantum computing using single-particle discrete-time quantum walk

Universal quantum computing using single-particle discrete-time quantum walk

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

Superposition of causal order in quantum walks: non-Markovianity and causal asymmetry

Contact Info

Product

Resources

About