Related papers: On the waiting time in quantum repeaters with prob…
Scalable quantum networks require quantum repeaters to overcome major challenges such as photon loss and decoherence in long-distance quantum communication. In this paper, we present a cavity-magnon quantum repeater architecture that…
Quantum repeaters are essential for achieving long-distance quantum communication due to photon loss, which grows exponentially with the channel distance. Current quantum repeater generations use entanglement distillation protocols, where…
Entanglement shared between distant parties is a key resource in quantum networks. However, photon losses in quantum channels significantly reduce the success probability of entanglement sharing, which scales quadratically with the channel…
In this paper we study the production of entanglement between two atoms which are far from each other. We consider a system including eight two-level atoms (1; 2;... ; 8) such that any atom with its adjacent atom is in atomic Bell state, so…
A full-fledged quantum network relies on the formation of entangled links between remote location with the help of quantum repeaters. The famous Duan-Lukin-Cirac-Zoller quantum repeater protocol is based on long distance single-photon…
We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in…
Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that…
The past decade has seen tremendous progress in experimentally realizing the building blocks of quantum repeaters. Repeater architectures with multiplexed quantum memories have been proposed to increase entanglement distribution rates, but…
We propose a novel one-way quantum repeater architecture based on photonic tree-cluster states. Encoding a qubit in a photonic tree-cluster protects the information from transmission loss and enables long-range quantum communication through…
The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical…
Quantum communication is a secure way to transfer quantum information and to communicate with legitimate parties over distant places in a network. Although communication over a long distance has already been attained, technical problem…
Satellite-based quantum repeaters are a promising means to reach global distances in quantum networking due to the polynomial decrease of optical transmission with distance in free space, in contrast to the exponential decrease in optical…
Protocols for distributed quantum systems commonly require the simultaneous availability of $n$ entangled states, each with a fidelity above some fixed minimum $F_{\mathrm{app}}$ relative to the target maximally-entangled state. However,…
The convergence, convergence rate and expected hitting time play fundamental roles in the analysis of randomised search heuristics. This paper presents a unified Markov chain approach to studying them. Using the approach, the sufficient and…
Conventional wisdom suggests that realistic quantum repeaters will require quasi-deterministic sources of entangled photon pairs. In contrast, we here study a quantum repeater architecture that uses simple parametric down-conversion…
Distributing quantum states reliably among distant locations is a key challenge in the field of quantum networks. One-way quantum networks address this by using one-way communication and quantum error correction. Here, we analyze quantum…
Markov chain Monte Carlo algorithms have important applications in counting problems and in machine learning problems, settings that involve estimating quantities that are difficult to compute exactly. How much can quantum computers speed…
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to…
We present a novel approach to quantizing Markov chains. The approach is based on the Markov chain coupling method, which is frequently used to prove fast mixing. Given a particular coupling, e.g., a grand coupling, we construct a…
A quantum repeater node is presented based on trapped ions that act as single photon emitters, quantum memories and an elementary quantum processor. The node's ability to establish entanglement across two 25 km-long optical fibers…