Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We consider the problem of quantum state discrimination on such a system, and we solve it by optimizing the network topology weights. Finally, we test it on different quantum network topologies and compare it with optimal theoretical bounds.
We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all possible quantum, classical and quantum-stochastic transitions from a vertex as defined by its connectivity. We show how the family of possible QSWs encompasses both the classical random walk (CRW) and the quantum walk (QW) as special cases, but also includes more general probability distributions. As an example, we study the QSW on a line, the QW to CRW tran…
We demonstrate an implementation of unambiguous state discrimination of two equally probable single-qubit states via a one-dimensional photonic quantum walk experimentally. Furthermore we experimentally realize a quantum walk algorithm for implementing a generalized measurement in terms of positive operator value measurement on a single qubit. The measurement of the single-photons' positions corresponds to a measurement of an element of the positive operator value measurement on the polarizations of the single-photons.
We show that a one-dimensional discrete time quantum walk can be used to implement a generalized measurement in terms of positive operator value measure (POVM) on a single qubit. More precisely, we show that for a single qubit any set of rank 1 and rank 2 POVM elements can be generated by a properly engineered quantum walk. In such a scenario the measurement of particle at position x=i corresponds to a measurement of a POVM element E_i on a qubit. We explicitly construct quantum walks implementing unambiguous state discrimination and SIC-POVM.
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent movement of the walker, and therefore, directionality, is a generalization on the fully coherent quantum walk. While a quantum stochastic walk can always be described in Lindblad formalism, this does not mean that it can be microscopically derived in the standard weak-coupling limit under the Born-Markov approximation. This restricts the class of quantum stochas…
This work focuses on the study of quantum stochastic walks, which are a generalization of coherent, i. e. unitary quantum walks. Our main goal is to present a measure of a coherence of the walk. To this end, we utilize the asymptotic scaling exponent of the second moment of the walk i. e. of the mean squared distance covered by a walk. As the quantum stochastic walk model encompasses both classical random walks and quantum walks, we are interested how the continuous change from one regime to the other influences the asymptotic scaling exponent. Moreover this model allows for behavior which is …
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a Quantum Stochastic Walk. In particular, the structure of the graph mimics those of neural networks, with the quantum states to discriminate encoded on input nodes and with the discrimination obtained on the output nodes. We optimize the parameters of the network to obtain the highest probability of correct discrimination. Numerical simulations show that af…
Quantum walks are a promising framework that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a quantum walk with that of a classical random walk, through open system evolution of a quantum system. Quantum stochastic walks have been shown to have applications in as far reaching fields as artificial intelligence. However, there are significant constraints on the kind of open system evolutions that can be realized in a physical experiment. In this work, we discuss the rest…
We present an entanglement swapping process for unknown nonmaximally entangled photonic states, where the standard Bell-state measurement is replaced by a three-step quantum walk-like state discrimination process, i.e., the practically nontrivial coupling element of two photons is replaced by manipulating their trajectories, which will greatly enrich the dynamics of the coupling between photons in realizing quantum computation, and reduce the integration complexity of optical quantum processing. In addition, the output state can be maximally entangled, which allows for entanglement concentrati…
We report an experimental implementation of a single-qubit generalised measurement scenario(POVM) based on a quantum walk model. The qubit is encoded in a single-photon polarisation. The photon performs a quantum walk on an array of optical elements, where the polarisation-dependent translation is performed via birefringent beam displacers and a change of the polarisation is implemented with the help of wave-plates. We implement: (i) Trine-POVM, i.e., the POVM elements uniformly distributed on an equatorial plane of the Bloch sphere; (ii) Symmetric-Informationally- Complete (SIC) POVM; and (ii…
The presented paper describes QSWalk.jl package for Julia programming language, developed for the purpose of simulating the evolution of open quantum systems. The package enables the study of quantum procedures developed using stochastic quantum walks on arbitrary directed graphs. We provide a detailed description of the implemented functions, along with a number of usage examples. The package is compared with the existing software offering a similar functionality.
We present a Mathematica package, QSWalk, to simulate the time evaluation of Quantum Stochastic Walks (QSWs) on arbitrary directed and weighted graphs. QSWs are a generalization of continuous time quantum walks that incorporate both coherent and incoherent dynamics and as such, include both quantum walks and classical random walks as special cases. The incoherent component allows for quantum walks along directed graph edges. The dynamics of QSWs are expressed using the Lindblad formalism, originally developed for open quantum systems, which frames the problem in the language of density matrice…
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal gate set. In this paper we examine computation in terms of language acceptance and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as classical inputs, and we show that when the input is quantum, the walks can be interpreted as performing state discrimination.
We consider two identical bosons propagating on a one-dimensional lattice and address the prob- lem of discriminating whether their mutual on-site interaction is attractive or repulsive. We suggest a probing scheme based on the properties of the corresponding two-particle quantum walks, and show that the sign of the interaction introduces specific and detectable features in the dynamics of quantum correlations, thus permitting to discriminate between the two cases. We also discuss how these features are connected to the band-structure of the Hubbard Hamiltonian, and prove that discrimination m…
Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straight-forward generalization leads to simple scalin…
The main results of our work is determining the differences between limiting properties in various models of quantum stochastic walks. In particular, we prove that in the case of strongly connected and a class of weakly connected directed graphs, local environment interaction evolution is relaxing, and in the case of undirected graphs, global environment interaction evolution is convergent. For other classes of directed graphs we show, that the character of connectivity large influence on the limiting properties. We also study the limiting properties for the non-moralizing global interaction c…
In this paper we define a quantum stochastic walk on arbitrary directed graph with super-diffusive propagation on a line graph. Our model is based on global environment interaction QSW, which is known to have ballistic propagation. However we discovered, that in this case additional amplitude transitions occur, hence graph topology is changed into moral graph. Because of that we call the effect a spontaneous moralization. We propose a general correction scheme, which is proved to remove unnecessary transition and thus to preserve the graph topology. In the end we numerically show, that super-d…
Random walks are fundamental models of stochastic processes with applications in various fields including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on arbitrary networks. Based on the mathematical formalism of quantum stochastic walks, we provide a framework of classical and quantum walks whose evolution is determined by graph Laplacians. We study the influence of quantum effects on the stationary and long-time average probability distribution by interpolating between the classical and quantum regime. We comp…
The amount of information generated by a discrete time stochastic processes in a single step can be quantified by the entropy rate. We investigate the differences between two discrete time walk models, the discrete time quantum walk and the classical random walk in terms of entropy rate. We develop analytical methods to calculate and approximate it. This allows us to draw conclusions about the differences between classical stochastic and quantum processes in terms of the classical information theory.
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language acceptance, and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as classical inputs, and we show that when the input is quantum, the walks can also be interpreted as performing the task of quantum state discrimination.
We propose a new model for a measurement of a characteristic of a microscopic quantum state by a large system that selects stochastically the different eigenstates with appropriate quantum weights. Unlike previous works which formulate a modified Schrödinger equation or an explicit modified Hamiltonian, or more complicated mechanisms for reduction and decoherence to introduce transition to classical stochasticity, we propose the novel use of couplings to the environment, and random walks in the product Hilbert space of the combined system, with first passage stopping rules, which seem intuitiv…
QSW_MPI is a python package developed for time-series simulation of continuous-time quantum stochastic walks. This model allows for the study of Markovian open quantum systems in the Lindblad formalism, including a generalisation of the continuous-time random walk and continuous-time quantum walk. Consisting of a python interface accessing parallelised Fortran libraries utilising sparse data structures, QSW_MPI is scalable to massively parallel computers, which makes possible the simulation of a wide range of walk dynamics on directed and undirected graphs of arbitrary complexity.
While free and weakly interacting particles are well described by a a second-quantized nonlinear Schrödinger field, or relativistic versions of it, the fields of strongly interacting particles are governed by effective actions, whose quadratic terms are extremized by fractional wave equations. Their particle orbits perform universal Lévy walks rather than Gaussian random walks with perturbations.
We investigate the discrimination of two candidates of an unknown parameter in quantum systems with continuous weak measurement, inspired by the application of hypothesis testing in distinguish-ing two Hamiltonians [Kiilerich and Mølmer, Phys. Rev. A, 98, 022103 (2018)]. Based on the measurement output and stochastic master equation, temporal evolutions of posterior probabilities of two hypotheses are given by Bayes' formula. The Bayes criterion is presented by the likelihood ratio conditioned on the outcome of measurements. Different from the calculation method based on maximum a posteriori c…
We study a quantum stochastic neural network (QSNN) based on quantum stochastic walks on a graph, and use gradient descent to update the network parameters. We apply a toy model of QSNN with a few neurons to the problems of function approximation, two-dimensional data classification, and sequence classification. A simple QSNN with five neurons is trained to determine whether a sequence of words is a sentence or not, and we find that a QSNN can reduce the number of training steps. A QSNN with 11 neurons shows a quantum advantage in improving the accuracy of recognizing new types of inputs like …
A massless Dirac particle is considered, moving along the x-axis while Pauli-coupled by its anomalous magnetic moment to a piecewise constant magnetic field along the same axis, with stochastically varying sign. The motion is approximated as a quantum walk with unitary noise, for which the evolution can be found exactly. Initially ballistic, the motion approaches a classical diffusion on a time-scale determined by the speed of light, the size of the magnetic moment, the strength of the field and the time interval between changes in its direction. It is suggested that a process of this type cou…
The role of classical noise in quantum walks (QW) on integers is investigated in the form of discrete dichotomic random variable affecting its reshuffling matrix parametrized as a SU2)/U(1) coset element. Analysis in terms of quantum statistical moments and generating functions, derived by the completely positive trace preserving (CPTP) map governing evolution, reveals a pronounced eventual transition in walk's diffusion mode, from a quantum ballistic regime with rate O(t) to a classical diffusive regime with rate O(\surdt), when condition (strength of noise parameter)^{2}\times(number of step…
With the increasing crossover between quantum information and machine learning, quantum simulation of neural networks has drawn unprecedentedly strong attention, especially for the simulation of associative memory in Hopfield neural networks due to their wide applications and relatively simple structures that allow for easier mapping to the quantum regime. Quantum stochastic walk, a strikingly powerful tool to analyze quantum dynamics, has been recently proposed to simulate the firing pattern and associative memory with a dependence on Hamming Distance. We successfully map the theoretical sche…
Stochastic treatments of magnetic resonance spectroscopy and optical spectroscopy require evaluations of functions like <exp(i int_0^t Q(s)ds)>, where t is time, Q(s) is the value of a stochastic process at time s, and the angular brackets denote ensemble averaging. This paper gives an exact evaluation of these functions for the case where Q is a continuous-time random walk process. The continuous time random walk describes an environment that undergoes slow, step-like changes in time. It also has a well-defined Gaussian limit, and so allows for non-Gaussian and Gaussian stochastic dynamics to…
Photosynthesis is a highly efficient process, nearly 100 percent of the red photons falling on the surface of leaves reach the reaction center and get transformed into energy. Most theoretical studies on photosynthetic complexes focus mainly on the Fenna-Matthews-Olson complex obtained from green-sulfur bacteria. Quantum coherence was speculated to play a significant role in this very efficient transport process. However, recent reports indicate quantum coherence via exciton transport may not be as relevant as coherence originating via vibronic processes to Photosynthesis. Regardless of the or…
