Related papers: Probabilistic Representation of Commutative Quantu…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
Parameterized quantum circuits have been extensively used as the basis for machine learning models in regression, classification, and generative tasks. For supervised learning, their expressivity has been thoroughly investigated and several…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
We present a general formalism for studying the effects of dynamical heterogeneity in open quantum systems. We develop this formalism in the state space of density operators, on which ensembles of quantum states can be conveniently…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…
We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time…
The aim of this paper is to apply a contextual probabilistic model (in the spirit of Mackey, Gudder, Ballentine) to represent and to generalize some results of quantum logic about possible macroscopic quantum-like (QL) behaviour. The…
We present a random matrix model suitable for the quantum mechanical description of a particle confined to move inside a two-dimensional domain. Here, the ensemble average corresponds to an average over domain shapes. Although this approach…
A Lagrangian description of the qubit based on a generalization of Schwinger's picture of Quantum Mechanics using the notion of groupoids is presented. In this formalism a Feynman-like computation of its probability amplitudes is done. The…
Random matrix theory of the transition strengths is applied to transport in the strongly localized regime. The crossover distribution function between the different ensembles is derived and used to predict quantitatively the {\sl universal}…
We derive an expression for the mean square displacement of a particle whose motion is governed by a uniform, periodic, quantum multi-baker map. The expression is a function of both time, $t$, and Planck's constant, $\hbar$, and allows a…
On the basis of extensive numerical studies it is argued that there are strong analogies between the probabilistic behavior of quantum systems defined by Hermitian Hamiltonians and the deterministic behavior of classical mechanical systems…
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide…
We present numerical study of a model of quantum walk in periodic potential on the line. We take the simple view that different potentials affect differently the way the coin state of the walker is changed. For simplicity and definiteness,…
We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…
Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I…
This paper establishes a robust link between quantum dynamics and classical ones by deriving probabilistic representation for both continuous time and discrete time quantum walks. We first adapt Molchanov formula, originally employed in the…
We present a low-depth randomised algorithm for the estimation of entanglement fidelity between an $n$-qubit matchgate circuit $\mathcal{U}$ and its noisy implementation $\mathcal{E}$. Our procedure makes use of a modified Pauli-Liouville…
We investigate a novel quantum random walk (QRW) model, possibly useful in quantum algorithm implementation, that achieves a quadratically faster diffusion rate compared to its classical counterpart. We evaluate its asymptotic behavior…
The ensemble $\CUE^{(q)}$ of truncated random unitary matrices is a deformation of the usual Circular Unitary Ensemble depending on a discrete non-negative parameter $q.$ $\CUE^{(q)}$ is an exactly solved model of random contraction…