Related papers: Perfect chiral quantum routing
With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
In this paper we show how using complex valued edge weights in a graph can completely suppress the flow of probability amplitude in a continuous time quantum walk to specific vertices of the graph when the edge weights, graph topology and…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum…
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting…
Entanglement is a key resource in quantum communication, but bipartite schemes are often insufficient for advanced protocols like quantum secret sharing or distributed computing. Graph states offer a flexible way to represent and manage…
Classical optics can be used to efficiently implement certain quantum information processing tasks with a high degree of control, for example, one-dimensional quantum walks through the space of orbital angular momentum of light directed by…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…
Topological quantum computation is a promising technique to achieve large-scale, error-corrected computation. Quantum hardware is used to create a large, 3-dimensional lattice of entangled qubits while performing computation requires…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other. Therefore, to execute an arbitrary quantum circuit on the hardware, compilers have to first perform the task of qubit routing,…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…
Lattice actions and topological charges that are classically and quantum mechanically perfect (i.e. free of lattice artifacts) are constructed analytically for the quantum rotor. It is demonstrated that the Manton action is classically…
Quantum router is an essential ingredient in a quantum network. Here, we propose a new quantum circuit for designing quantum router by using IBM's five-qubit quantum computer. We design an equivalent quantum circuit, by the means of…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
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…