Related papers: Quantum routing with fast reversals
Nowadays, quantum router is playing a key role in quantum communication and quantum network- s. Here we propose a tunable single-photon routing scheme, based on quantum interference, which uses two distant artificial atoms coupling to two…
We present an experimental realization of a robust quantum communication scheme [Phys. Rev. Lett. 93, 220501 (2004)] using pairs of photons entangled in polarization and time. Our method overcomes errors due to collective rotation of the…
Quantum networks enable a number of important applications such as quantum key distribution. The basic function of a quantum network is to enable long-distance quantum entanglement between two remote communication parties. This work focuses…
We analyze how the performance of a quantum-repeater network depends on the protocol employed to distribute entanglement, and we find that the choice of repeater-to-repeater link protocol has a profound impact on communication rate as a…
One of the most basic tasks required for Quantum Information Technology is the ability to connect different components of a Quantum Computer by quantum wires that obey the superposition principle. Since superpositions can be very sensitive…
We consider a queue with renewal arrivals and n exponential servers in the Halfin-Whitt heavy traffic regime, where n and the arrival rate increase without bound, so that a critical loading condition holds. Server k serves at rate $\mu_k $,…
Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it allows for exploiting the large computational capacity of the qubits without suffering from…
Transfer of quantum information between physical systems of a different nature is a central matter in quantum technologies. Particularly challenging is the transfer between discrete- and continuous degrees of freedom of various harmonic…
We extend quantum rate distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum rate distortion coding…
Quantum repeaters with multiple quantum memories provide high throughput, low latency, and high fidelity quantum state (qubit) transfer over long distances. However, conventional quantum repeater protocols require full connections among the…
We assume the permutation $\pi$ is given by an $n$-element array in which the $i$-th element denotes the value $\pi(i)$. Constructing its inverse in-place (i.e. using $O(\log{n})$ bits of additional memory) can be achieved in linear time…
We study quantum information scrambling in a random unitary circuit that exchanges qubits with an environment at a rate $p$. As a result, initially localized quantum information not only spreads within the system, but also spills into the…
We introduce a framework for computing time-dependent quantum transition rates (QTRs) that describe the pace of evolution of a quantum state from a given subspace to a target subspace. QTRs are expressed in terms of flux-flux correlators…
In this work we use the concept of quantum fingerprinting to develop a quantum communication protocol in the simultaneous message passing model that calculates the Hamming distance between two $n$-bit strings up to relative error…
Regular families of coupled quantum networks are described such the unknown state of a qubit can be perfectly routed from any node to any other node in a time linear in the distance. Unlike previous constructions, the transfer can be…
In this paper, we derive sharp lower bounds, also known as quantum speed limits, for the time it takes to transform a quantum system into a state such that an observable assumes its lowest average value. We assume that the system is…
Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these…
Today's quantum computers are comprised of tens of qubits interacting with each other and the environment in increasingly complex networks. In order to achieve the best possible performance when operating such systems, it is necessary to…
Sampling from the stationary distribution is one of the fundamental tasks of Markov chain-based algorithms and has important applications in machine learning, combinatorial optimization and network science. For the quantum case, qsampling…