2,953 research outputs found
Quantum information with continuous variables
Quantum information is a rapidly advancing area of interdisciplinary
research. It may lead to real-world applications for communication and
computation unavailable without the exploitation of quantum properties such as
nonorthogonality or entanglement. We review the progress in quantum information
based on continuous quantum variables, with emphasis on quantum optical
implementations in terms of the quadrature amplitudes of the electromagnetic
field.Comment: accepted for publication in Reviews of Modern Physic
Quantum linear network coding as one-way quantum computation
Network coding is a technique to maximize communication rates within a
network, in communication protocols for simultaneous multi-party transmission
of information. Linear network codes are examples of such protocols in which
the local computations performed at the nodes in the network are limited to
linear transformations of their input data (represented as elements of a ring,
such as the integers modulo 2). The quantum linear network coding protocols of
Kobayashi et al [arXiv:0908.1457 and arXiv:1012.4583] coherently simulate
classical linear network codes, using supplemental classical communication. We
demonstrate that these protocols correspond in a natural way to
measurement-based quantum computations with graph states over over qudits
[arXiv:quant-ph/0301052, arXiv:quant-ph/0603226, and arXiv:0704.1263] having a
structure directly related to the network.Comment: 17 pages, 6 figures. Updated to correct an incorrect (albeit
hilarious) reference in the arXiv version of the abstrac
Quantum Capacities for Entanglement Networks
We discuss quantum capacities for two types of entanglement networks:
for the quantum repeater network with free classical
communication, and for the tensor network as the rank of the
linear operation represented by the tensor network. We find that
always equals in the regularized case for the samenetwork graph.
However, the relationships between the corresponding one-shot capacities
and are more complicated, and the min-cut upper
bound is in general not achievable. We show that the tensor network can be
viewed as a stochastic protocol with the quantum repeater network, such that
is a natural upper bound of . We analyze the
possible gap between and for certain networks,
and compare them with the one-shot classical capacity of the corresponding
classical network
Quantum network routing and local complementation
Quantum communication between distant parties is based on suitable instances of shared entanglement. For efficiency reasons, in an anticipated quantum network beyond point-to-point communication, it is preferable that many parties can communicate simultaneously over the underlying infrastructure; however, bottlenecks in the network may cause delays. Sharing of multi-partite entangled states between parties offers a solution, allowing for parallel quantum communication. Specifically for the two-pair problem, the butterfly network provides the first instance of such an advantage in a bottleneck scenario. In this paper, we propose a more general method for establishing EPR pairs in arbitrary networks. The main difference from standard repeater network approaches is that we use a graph state instead of maximally entangled pairs to achieve long-distance simultaneous communication. We demonstrate how graph-theoretic tools, and specifically local complementation, help decrease the number of required measurements compared to usual methods applied in repeater schemes. We examine other examples of network architectures, where deploying local complementation techniques provides an advantage. We finally consider the problem of extracting graph states for quantum communication via local Clifford operations and Pauli measurements, and discuss that while the general problem is known to be NP-complete, interestingly, for specific classes of structured resources, polynomial time algorithms can be identified
- …