Related papers: How to Compute Using Quantum Walks
Quantum robots and their interactions with environments of quantum systems are described and their study justified. A quantum robot is a mobile quantum system that includes a quantum computer and needed ancillary systems on board. Quantum…
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, we need…
In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
Identify, Transform, Benchmark, Show Quantum Advantage (ITBQ): Evaluating use cases for quantum computers. We introduce a four-step framework for assessing quantum computing applications -- from identifying relevant industry problems to…
Over the past few years, quantum computers and quantum algorithms have attracted considerable interest and attention from numerous scientific disciplines. In this article, we aim to provide a non-technical, yet informative introduction to…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
There has recently been considerable interest in quantum walks in connection with quantum computing. The walk can be considered as a quantum version of the so-called correlated random walk. We clarify a strong structural similarity between…
Quantum computing is a good way to justify difficult physics experiments. But until quantum computers are built, do computer scientists need to know anything about quantum information? In fact, quantum computing is not merely a recipe for…
Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is…
Quantum information processing is the use of inherently quantum mechanical phenomena to perform information processing tasks that cannot be achieved using conventional classical information technologies. One famous example is quantum…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Coin and scattering are the two major formulations for discrete quantum walks models, each believed to have its own advantages in different applications. Although they are related in some cases, it was an open question their equivalence in…
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…
Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…
Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…
This paper introduces a new notion of quantum recursion of which the control flow of the computation is quantum rather than classical as in the notions of recursion considered in the previous studies of quantum programming. A typical…
In the setting of networked computation, data security can be a significant concern. Here we consider the problem of allowing a server to remotely manipulate client supplied data, in such a way that both the information obtained by the…