Related papers: A high-fidelity quantum state transfer algorithm o…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
Grover's quantum search algorithm can be formulated as a quantum particle randomly walking on the (highly symmetric) complete graph, with one vertex marked by a nonzero potential. From an initial equal superposition, the state evolves in a…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
Quantum state transfer between distant nodes is essential for distributed quantum information processing. Existing protocols are typically optimized for specific coupling regimes, such as adiabatic dark-state transfer in the single-mode…
One of the strengths of quantum information theory is that it can treat quantum states without referring to their particular physical representation. In principle, quantum states can be therefore fully swapped between various quantum…
Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…
In this paper we study a class of discrete quantum walks, known as bipartite walks. These include the well-known Grover's walks. Any discrete quantum walk is given by the powers of a unitary matrix $U$ indexed by arcs or edges of the…
In quantum communication, quantum state transfer from one location to another in a quantum network plays a prominent role, where the impact of noise could be crucial. The idea of state transfer can be fruitfully associated with quantum walk…
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C_4, C_6 and C_8 for three choices of coin operator. Perfect state transfer was found, in general, to be…
The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…
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…
A fully homomorphic encryption system hides data from unauthorized parties, while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more…
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…
A continuous-time quantum walk on a graph $X$ is represented by the complex matrix $\exp (-\mathrm{i} t A)$, where $A$ is the adjacency matrix of $X$ and $t$ is a non-negative time. If the graph models a network of interacting qubits,…
We present two quantum state sharing protocols where the channels are not maximally entangled states. By properly choosing the measurement basis it is possible to achieve unity fidelity transfer of the state if the parties collaborate. We…
In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…