Quantum hash function using discrete-time quantum walk on Hanoi network

We present a quantum hash function in a quantum walk framework on Johnson graphs. In this quantum hash function, the message bit decides which coin operator, i.e., Grover operator or DFT operator, is applied on the coin at each step. Then a fixed conditional shift operator is applied to decide the movement of the walker. Compared with existing quantum-walk-based hash functions, the present hash function has a lower collision rate and quantum resource cost. It provides a clue for the construction of other cryptography protocols by introducing the quantum walk model into hash functions.

We investigate the evolution dynamics of inhomogeneous discrete-time one-dimensional quantum walks displaying long-range correlations in both space and time. The associated quantum coin operators of internal states are built to exhibit random inhomogeneity distribution of long-range correlations embedded in the time evolution protocol through a fractional Brownian motion with spectrum following a power-law behavior, S(k)∼1/k^{ν}. From extensive numerical simulations with averages over a large number of independent realizations of the phases of quantum coins, the power-law correlated disorder encoded in the coin phases is shown to give rise to a wide variety of spreading patterns of the qubit states, from localized to subdiffusive, diffusive, and superdiffusive (including ballistic) behavior, depending on the relative strength of the parameters driving the correlation degree. Dispersion control is possible in one-dimensional discrete-time quantum walks by tuning the long-range correlation properties assigned to the inhomogeneous quantum coin operator.

We show that the Dirac quantum cellular automaton [Ann. Phys. 354 (2015) 244] shares many properties in common with the discrete-time quantum walk. These similarities can be exploited to study the automaton as a unitary process that takes place at regular time steps on a one-dimensional lattice, in the spirit of general quantum cellular automata. In this way, it becomes an alternative to the quantum walk, with a dispersion relation that can be controlled by a parameter, which plays a similar role to the coin angle in the quantum walk. The Dirac Hamiltonian is recovered under a suitable limit. We provide two independent analytical approximations to the long term probability distribution. It is shown that, starting from localized conditions, the asymptotic value of the entropy of entanglement between internal and motional degrees of freedom overcomes the known limit that is approached by the quantum walk for the same initial conditions, and are similar to the ones achieved by highly localized states of the Dirac equation.

Bloch oscillations appear when an electric field is superimposed on a quantum particle that evolves on a lattice with a tight-binding Hamiltonian (TBH), i.e., evolves via what we call an electric TBH; this phenomenon will be referred to as TBH Bloch oscillations. A similar phenomenon is known to show up in so-called electric discrete-time quantum walks (DQWs) [C. Cedzich et al., Phys. Rev. Lett. 111, 160601 (2013);] this phenomenon will be referred to as DQW Bloch oscillations. This similarity is particularly salient when the electric field of the DQW is weak. For a wide, i.e., spatially extended, initial condition, one numerically observes semiclassical oscillations, i.e., oscillations of a localized particle, for both the electric TBH and the electric DQW. More precisely, the numerical simulations strongly suggest that the semiclassical DQW Bloch oscillations correspond to two counterpropagating semiclassical TBH Bloch oscillations. In this work it is shown that, under certain assumptions, the solution of the electric DQW for a weak electric field and a wide initial condition is well approximated by the superposition of two continuous-time expressions, which are counterpropagating solutions of an electric TBH whose hopping amplitude is the cosine of the arbitrary coin-operator mixing angle. In contrast, if one wishes the continuous-time approximation to hold for spatially localized initial conditions, one needs at least the DQW to be lazy, as suggested by numerical simulations and by the fact that this has been proven in the case of a vanishing electric field [F. W. Strauch, Phys. Rev. A 74, 030301(R) (2006)].

Discrete-time quantum walks are known to exhibit exotic topological states and phases. Physical realization of quantum walks in a lossy environment may destroy these phases. We investigate the behaviour of topological states in quantum walks in the presence of a lossy environment. The environmental effects in the quantum walk dynamics are addressed using the non-Hermitian Hamiltonian approach. We show that the topological phases of the quantum walks are robust against moderate losses. The topological order in one-dimensional split-step quantum walk persists as long as the Hamiltonian respects exact {{mathcal {P}}}{{mathcal {T}}}-symmetry. Although the topological nature persists in two-dimensional quantum walks as well, the {{mathcal {P}}}{{mathcal {T}}}-symmetry has no role to play there. Furthermore, we observe topological phase transition in two-dimensional quantum walks that is induced by losses in the system.

In recent years, quantum walks have been proposed as promising resources for the simulation of physical quantum systems. In fact it is widely adopted to simulate quantum dynamics. Up to now single particle quantum walks have been experimentally demonstrated by different approaches, while only few experiments involving many-particle quantum walks have been realized. Here we simulate the 2-particle dynamics on a discrete time quantum walk, built on an array of integrated waveguide beam splitters. The polarization independence of the quantum walk circuit allowed us to exploit the polarization entanglement to encode the symmetry of the two-photon wavefunction, thus the bunching-antibunching behavior of non interacting bosons and fermions has been simulated. We have also characterized the possible distinguishability and decoherence effects arising in such a structure. This study is necessary in view of the realization of a quantum simulator based on an integrated optical array built on a large number of beam splitters.

Role embedding aims to embed role-similar nodes into similar representations. Role embedding is significant in graph mining, providing a key bridge between traditional role analysis and machine learning. However, current methods suffer from information loss due to the inherent drawbacks, thus failing to capture role information comprehensively from both global and local perspectives. This paper proposes RED (Role Embedding via Discrete-time quantum walk) to address the above issue via quantum walks, whose characters are naturally applicable to role embedding. Based on the superposition, RED simultaneously learns global role representations by evolving features in a global evolution. Besides, RED uses the quasi-periodicity to capture long-term evolving features within steps. To represent local role information, RED simulates a wave-like diffusion by biased walks, where it learns the closeness from accumulated probabilities for local role representations. To the best of our knowledge, RED is the first to apply quantum walks to the role embedding. Substantial experiments demonstrate that RED significantly outperforms state-of-the-art methods by up to 2300.00% in role detection, 90.93% in equivalency identification, and is overwhelmingly superior in robustness.

The discrete-time quantum walk (QW) is determined by a unitary matrix whose component is complex number. Konno (2015) extended the QW to a walk whose component is quaternion.We call this model quaternionic quantum walk (QQW). The probability distribution of a class of QQWs is the same as that of the QW. On the other hand, a numerical simulation suggests that the probability distribution of a QQW is different from the QW. In this paper, we clarify the difference between the QQW and the QW by weak limit theorems for a class of QQWs.

We study maximal coin-position entanglement generation via a discrete-time quantum walk, in which the coin operation is randomly selected from one of two coin operators set at each step. We solve maximal entanglement generation as an optimization problem with quantum process fidelity as the cost function. Then we determine the maximal entanglement that can be rigorously generated for any step beyond the second regardless of initial condition with appropriate coin sequences. The simplest coin sequence comprising Hadamard and identity operations is equivalent to the generalized elephant quantum walk, which exhibits an increasingly faster spreading in terms of probability distribution. Experimentally, we demonstrate a ten-step quantum walk driven by such coin sequences with linear optics, and thereby show the desired high-dimensional bipartite entanglement as well as the transport behavior of faster spreading.

We consider a discrete-time quantum walk W_{t,\kappa} at time t on a graph with joined half lines J_\kappa, which is composed of \kappa half lines with the same origin. Our analysis is based on a reduction of the walk on a half line. The idea plays an important role to analyze the walks on some class of graphs with symmetric initial states. In this paper, we introduce a quantum walk with an enlarged basis and show that W_{t,\kappa} can be reduced to the walk on a half line even if the initial state is asymmetric. For W_{t,\kappa}, we obtain two types of limit theorems. The first one is an asymptotic behavior of W_{t,\kappa} which corresponds to localization. For some conditions, we find that the asymptotic behavior oscillates. The second one is the weak convergence theorem for W_{t,\kappa}. On each half line, W_{t,\kappa} converges to a density function like the case of the one-dimensional lattice with a scaling order of t. The results contain the cases of quantum walks starting from the general initial state on a half line with the general coin and homogeneous trees with the Grover coin.

We present a protocol to realize topological discrete-time quantum walks, which comprise a sequence of spin-dependent flipping displacement operations and quantum coin tossing operations, with a single trapped ion. It is demonstrated that the information of bulk topological invariants can be extracted by measuring the average projective phonon number when the walk takes place in coherent state space. Interestingly, the specific chiral symmetry owned by our discrete-time quantum walks simplifies the measuring process. Furthermore, we prove the robustness of such bulk topological invariants by introducing dynamical disorder and decoherence. Our work provides a simple method to measure bulk topological features in discrete-time quantum walks, which can be experimentally realized in the system of single trapped ions.

We investigate the role of different aperiodic sequences in the dynamics of single quantum particles in discrete space and time. For this we consider three aperiodic sequences, namely, the Fibonacci, Thue-Morse, and Rudin-Shapiro sequences, as examples of tilings the diffraction spectra of which have pure point, singular continuous, and absolutely continuous support, respectively. Our interest is to understand how the order, intrinsically introduced by the deterministic rule used to generate the aperiodic sequences, is reflected in the dynamical properties of the quantum system. For this system we consider a single particle undergoing a discrete-time quantum walk (DTQW), where the aperiodic sequences are used to distribute the coin operations at different lattice positions (inhomogeneous DTQW) or by applying the same coin operation at all lattice sites at a given time but choosing different coin operation at each time step according to the chosen aperiodic sequence (time dependent DTQW). We study the energy spectra and the spreading of an initially localized wave packet for different cases, finding that in the case of Fibonacci and Thue-Morse tilings the system is superdiffusive, whereas in the Rudin-Shapiro case it is strongly subdiffusive. Trying to understand this behavior in terms of the energy spectra, we look at the survival amplitude as a function of time. By means of the echo we present strong evidence that, although the three orderings are very different as evidenced by their diffraction spectra, the energy spectra are all singular continuous except for the inhomogeneous DTQW with the Rudin-Shapiro sequence where it is discrete. This is in agreement with the observed strong localization both in real space and in the Hilbert space. Our paper is particularly interesting because quantum walks can be engineered in laboratories by means of ultracold gases or in optical waveguides, and therefore would be a perfect playground to study singular continuous energy spectra in a completely controlled quantum setup.

Advancements in noisy intermediate-scale quantum (NISQ) computing are steadily pushing these systems toward outperforming classical supercomputers on specific well-defined computational tasks. In this work we explore and control quantum chaos in NISQ systems using discrete-time quantum walks (DTQWs) on cyclic graphs. To efficiently implement quantum walks on NISQ hardware, we employ the quantum Fourier transform to diagonalize the conditional shift operator, optimizing circuit depth and fidelity. We experimentally realize the transition from quantum chaos to order via DTQW dynamics on both odd and even cyclic graphs, specifically 3- and 4-cycle graphs, using the counterintuitive Parrondo paradox strategy across three different NISQ devices. While the 4-cycle graphs exhibit high-fidelity quantum evolution, the 3-cycle implementation shows significant fidelity improvement when augmented with dynamical decoupling pulses. Our results demonstrate a practical approach to probing and harnessing controlled chaotic dynamics on real quantum hardware, laying the groundwork for future quantum algorithms and cryptographic protocols based on quantum walks.

The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk dynamics represents a valid tool in the task of engineering arbitrary quantum states. Here we affirm such potential in a linear-optics platform that realizes discrete-time quantum walks in the orbital angular momentum degree of freedom of photons. Different classes of relevant qudit states in a six-dimensional space are prepared and measured, confirming the feasibility of the protocol. Our results represent a further investigation of quantum walk dynamics in photonics platforms, paving the way for the use of such a quantum state-engineering toolbox for a large range of applications.

Open quantum walks often lead to a classical asymptotic behavior. Here, we look for a simple open quantum walk whose asymptotic behavior can be non-classical. We consider a discrete-time quantum walk on n-cycle subject to a random coin-dependent phase shift at a single position. This finite system, whose evolution is described by only two Kraus operators, can exhibit all kinds of asymptotic behavior observable in quantum Markov chains: it either evolves towards a maximally mixed state, or partially mixed state, or tends to an oscillatory motion on an asymptotic orbit. We find that the asymptotic orbits do not have a product structure, therefore the corresponding states can manifest entanglement between the position and the coin degrees of freedom, even if the system started in a product state.