Related papers: A high-fidelity quantum state transfer algorithm o…
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…
Qubit-resolved operations and measurements are required for most current quantum information processing schemes. However, these operations can be experimentally costly due to the need for local addressing, demanding significant classical…
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
We introduce quantized bipartite walks, compute their spectra, generalize the algorithms of Grover \cite{g} and Ambainis \cite{amb03} and interpret them as quantum walks with memory. We compare the performance of walk based classical and…
Let $L$ denote the Laplacian matrix of a graph $G$. We study continuous quantum walks on $G$ defined by the transition matrix $U(t)=\exp\left(itL\right)$. The initial state is of the pair state form, $e_a-e_b$ with $a,b$ being any two…
Quantum state transfer is a fundamental requirement for scalable quantum computation, where fast and reliable communication between distant subsystems is essential. In this work, we present a protocol for quantum state transfer in linear…
We present a general scheme for implementing bi-directional quantum state transfer in a quantum swapping channel. Unlike many other schemes for quantum computation and communication, our method does not require qubit couplings to be…
Semiconductor quantum-dot spin qubits are a promising platform for quantum computation, because they are scalable and possess long coherence times. In order to realize this full potential, however, high-fidelity information transfer…
The goal in quantum state transfer is to avoid the need to physically transport carriers of quantum information. This is achieved by using a suitably engineered Hamiltonian that induces the transfer of the state of one subsystem to another.…
Quantum state transfer (QST) via homogeneous spin chains plays a crucial role in building scalable quantum hardware. A basic quantum state transmission protocol prepares a state in one qubit and transfers it to another through a channel,…
A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…
We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success…
We propose a protocol to realize fast high-fidelity quantum state transfer between distant optomechanical interfaces connected by a continuum waveguide. The scheme consists of three steps: two accelerating adiabatic processes joined by a…
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…
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition…
Quantum walks are expected to serve important modelling and algorithmic applications in many areas of science and mathematics. Although quantum walks have been successfully implemented physically in recent times, no major efforts have been…
Gap-protected topological channels are a promising way to realize robust and high-fidelity state transfer in quantum networks. Although various topological transfer protocols based on the Su-Schrieffer-Heeger model or its variants have been…
We propose a realistic setup, inspired by already existing experiments, within which we develop a general formalism for the implementation of distributed quantum gates. Mediated by a quantum link that establishes a bidirectional quantum…
Graph states are a class of important multiparty entangled states, of which bell pairs are the special case. Realizing a robust and fast distribution of arbitrary graph states in the downstream layer of the quantum network can be essential…