Related papers: Quantum Routing with Teleportation
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
Continuous time quantum walks (CTQW) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRW). For one special graph, where a recent analysis showed that in a particular direction of…
Quantum computers promise dramatic speed ups for many computational tasks. For large-scale quantum computation however, the inevitable coupling of physical qubits to the noisy environment imposes a major challenge for a real-life…
Teleporting physical quantities to remote locations is a remaining key challenge for quantum information science and technology. Quantum teleportation has enabled the transfer of quantum information, but teleportation of quantum physical…
Quantum state teleportation represents a pillar of quantum information and a milestone on the roadmap towards quantum networks with a large number of nodes. Successful photonic demonstrations of this protocol have been carried out employing…
We show that a quantum clock cannot be teleported without prior synchronization between sender and receiver: every protocol using a finite amount of entanglement and an arbitrary number of rounds of classical communication will necessarily…
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…
Quantum teleportation provides a "disembodied" way to transfer quantum states from one object to another at a distant location, assisted by priorly shared entangled states and a classical communication channel. In addition to its…
Distributed Quantum Computing (DQC) enables scalability by interconnecting multiple QPUs. Among various DQC implementations, quantum data centers (QDCs), which utilize reconfigurable optical switch networks to link QPUs across different…
Distributed quantum networks are not merely information conduits but intricate systems that embody the principles of quantum mechanics. In our study, we examine the underlying mechanisms of quantum connectivity within a distributed…
We describe two protocols for efficient data transmission using a single passive bus. Different types of interactions are obtained enabling deterministic transfer and teleportation of composite quantum systems for arbitrary subsystem…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…
We show that low-depth random quantum circuits can be efficiently simulated by a quantum teleportation-inspired algorithm. By using logical qubits to redirect and teleport the quantum information in quantum circuits, the original circuits…
Quantum scrambling is the dispersal of local information into many-body quantum entanglements and correlations distributed throughout the entire system. This concept underlies the dynamics of thermalization in closed quantum systems, and…
Distinguishing non-local orders, including global and topological orders of states through solely local measurements and classical communications (LOCC) is a highly non-trivial and challenging task since the topology of states is determined…
We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as a quantum remote control. We investigate protocols which achieve this using local operations,…
We analyze permutation routing of rigid blocks representing surface code patches of $d_C^2$ atoms on a reconfigurable lattice with hypergraph transformations. For a hypergraph $H$, code distance $d_C$, $s=d_C^2$, number of blocks $N_L$, and…
Spatial separation restricts the set of locally implementable quantum operations on distributed multipartite quantum systems. We propose that indefinite causal structure arising due to quantum superposition of different space-time…
This paper proposes a quantum routing protocol using multihop teleportation for wireless mesh backbone networks. After analyzing the quantum multihop protocol, a four-qubit cluster state is selected as the quantum channel for the protocol.…