Related papers: Parrondo paradox in quantum image encryption
In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $\theta$ by performing…
We present a review of photonic implementations of discrete-time quantum walks (DTQW) in the spatial and temporal domains, based on spatial- and time-multiplexing techniques, respectively. Additionally, we propose a detailed novel scheme…
Recent findings suggest that processes such as the electronic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy…
Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological…
Topological phases, edge states, and flat bands in synthetic quantum systems are a key resource for topological quantum computing and noise-resilient information processing. We introduce a scheme based on step-dependent quantum walks on…
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. They have been…
In this study, the security of Novel Enhanced Quantum Representation (NEQR) of quantum images are suggested by using the Quantum Fourier Transform (QFT) with blind trent. In the protocol, QFT and keys are used to share signature with…
In this work, we present a new model of the Discrete-Time Open Quantum Walk (DTOQW) applicable to an arbitrary graph, thereby going beyond the case of quantum walks on regular graphs. We study the impact of noise in the dynamics of quantum…
The discrete time quantum walk (DTQW) is a universal quantum computational model. Significant relationships between discrete and corresponding continuous quantum systems have been studied since the work of Pauli and Feynman. This work…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
Quantum magic, which accounts for the non-stabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. We investigate the generation and evolution of quantum magic in discrete-time…
Quantum anomalies lead to finite expectation values that defy the apparent symmetries of a system. These anomalies are at the heart of topological effects in fundamental, electronic, photonic and ultracold atomic systems, where they result…
Discrete-time quantum walks (DTQWs) provide a convenient platform for a realisation of many topological phases in noninteracting systems. They often offer more possibilities than systems with a static Hamiltonian. Nevertheless, researchers…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
Distributing arbitrary graph states across quantum networks is a central challenge for modular quantum computing and measurement-based quantum communication. We introduce the phase quantum walk (PQW), a discrete-time quantum walk in which…
Cryptography plays an important role in ensuring data security and authentication within information processing systems. As the prevalence of digital imagery continues to grow, safeguarding this form of data becomes increasingly crucial.…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing, especially for designing quantum algorithms. However, how to efficiently implement CTQWs is a challenging issue. In this paper, we study implementation of CTQWs…
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the…