Related papers: Universal computation by multi-particle quantum wa…
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…
A quantum robot is a mobile quantum system including an on bord quantum computer and ancillary systems, that interact with an environment of quantum systems. Quantum robots carry out tasks whose goals include carrying out measurements and…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
Quantum walks are versatile simulators of topological phases and phase transitions as observed in condensed matter physics. Here, we utilize a step dependent coin in quantum walks and investigate what topological phases we can simulate with…
The subject of this paper is quantum walks, which are expected to simulate several kinds of quantum dynamical systems. In this paper, we define analyticity for quantum walks on Z. Almost all the quantum walks on $\mathbb{Z}$ which have been…
We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…
A powerful tool emerging from the study of many-body quantum dynamics is that of dual-unitary circuits, which are unitary even when read `sideways', i.e., along the spatial direction. Here, we show that this provides the ideal framework to…
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform…
In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such…
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
Quantum walks are powerful tools for quantum applications and for designing topological systems. Although they are simulated in a variety of platforms, genuine two-dimensional realizations are still challenging. Here we present an…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
We study a quantum walk of a single particle that is subject to stroboscopic projective measurements on a graph with two sites. This two-level system is the minimal model of a measurement induced quantum walk. The mean first detected…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…