Related papers: Graph approach to quantum teleportation dynamics
Near-term large quantum computers are not able to operate as a single processing unit. It is therefore required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit. This approach is known as…
Graph states are used to represent mathematical graphs as quantum states on quantum computers. They can be formulated through stabilizer codes or directly quantum gates and quantum states. In this paper we show that a quantum graph neural…
Quantum teleportation establishes a correspondence between an entangled state shared by two separate par- ties that can communicate classically and the presence of a quantum channel connecting the two parties. The standard benchmark for…
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,…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
Quantum computing, leveraging the principles of quantum mechanics, has been found to significantly enhance computational capabilities in principle, in some cases beyond classical computing limits. This paper explores quantum computing's…
We consider the dynamical properties of dissipative continuous-time quantum walks on directed graphs. Using a large-deviation approach we construct a thermodynamic formalism allowing us to define a dynamical order parameter, and to identify…
Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be…
Quantum entanglement and decoherence are the two counterforces of many quantum technologies and protocols. For example, while quantum teleportation is fueled by a pair of maximally entangled resource qubits, it is vulnerable to decoherence.…
In this paper, we want to present a simple and comprehensive method to implement teleportation of a system of N qubits and its discussion on the corresponding quantum circuit. The paper can be read for nonspecialists in quantum information.
This article provides a quick overview of quantum communication, bringing together several innovative aspects of quantum enabled transmission. We first take a neutral look at the role of quantum communication, presenting its importance for…
Large-scale operations in quantum networks require efficient sorting of desired paths between nodes. In this article, we consider entanglement routing, which involves establishing an entanglement link between specific nodes in a large…
Entanglement is a crucial resource in quantum information theory. We investigate the use of different forms of entangled states in continuous variable quantum teleportation, specifically the use of a finite-basis entanglement resource. We…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
We derive the maximum fidelity attainable for teleportation using a shared pair of d-level systems in an arbitrary pure state. This derivation provides a complete set of necessary and sufficient conditions for optimal teleportation…
A quantum teleportation scheme based on the EPR-pair entangled with respect to the ``energy+time'' variables is proposed. Teleportation of the multimode state of a single-photon wave packet is considered.
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
The study of quantum evolution on graphs for diversified topologies is beneficial to modeling various realistic systems. A systematic method, the dimerized decomposition, is proposed to analyze the dynamics on an arbitrary network. By…
Quantum computing holds a great promise and this work proposes to use new quantum data networks (QDNs) to connect multiple small quantum computers to form a cluster. Such a QDN differs from existing QKD networks in that the former must…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…