Related papers: Simulating Non Commutative Geometry with Quantum W…
We study the discrete quantum groups $\Gamma$ whose group algebra has an inner faithful representation of type $\pi:C^*(\Gamma)\to M_K(\mathbb C)$. Such a representation can be thought of as coming from an embedding $\Gamma\subset U_K$. Our…
We present an in-depth analytic study of discrete-time quantum walks driven by a non-reflective coin. Specifically, we compare the properties of the widely-used Grover coin ${\cal C}_{G}$ that is unitary and reflective (${\cal…
Open quantum walks (OQWs) are a new type of quantum walks which are entirely driven by the dissipative interaction with external environments and are formulated as completely positive trace-preserving maps on graphs. A generalized quantum…
We discuss generalizations of the notion of i) the group of unitary elements of a (real or complex) finite dimensional C*-algebra, ii) gauge transformations and iii) (real) automorphisms, in the framework of compact quantum group theory and…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves…
Some time ago we presented an article (which was in fact the outline of a research programme) in which we argued for the need to develop a nonommutative version of topological quantum field theories (NCTQFT for short). Recent work by C.J.…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
Inspired by the classical phenomenon of random walk, the concept of quantum walk has emerged recently as a powerful platform for the dynamical simulation of complex quantum systems, entanglement production and universal quantum computation.…
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…
Research has shown that quantum walks can accelerate certain quantum algorithms and act as a universal paradigm for quantum processing. The discrete-time quantum walk (DTQW) model, owing to its discrete nature, stands out as one of the most…
We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…
We have previously presented a version of the Weak Equivalence Principle for a quantum particle as an exact analog of the classical case, based on the Heisenberg picture analysis of free particle motion. Here, we take that to a full…
Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…
A quantum walk, \emph{i.e.}, the quantum evolution of a particle on a graph, is termed \emph{scalar} if the internal space of the moving particle (often called the coin) has a dimension one. Here, we study the existence of scalar quantum…
We present an experimental implementation of the coined discrete time quantum walk on a square using a three qubit liquid state nuclear magnetic resonance (NMR) quantum information processor (QIP). Contrary to its classical counterpart, we…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
We propose a model for noncommutative quantum cosmology by means of a deformation of minisuperspace. For the Kantowski-Sachs metric we are able to find the exact wave function. We construct wave packets and show that new quantum states that…