English
Related papers

Related papers: Oblivious transfer and quantum channels

200 papers

We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…

Quantum Physics · Physics 2017-01-27 Holger Boche , Gisbert Janßen , Stephan Kaltenstadler

Quantum masking is a special type of secret sharing in which some information gets reversibly distributed into a multipartite system, leaving the original information inaccessible to each subsystem. This paper proposes a dynamical extension…

Quantum Physics · Physics 2026-05-07 Anna Honeycutt , Hailey Murray , Eric Chitambar

We present a both simple and comprehensive graphical calculus for quantum computing. In particular, we axiomatize the notion of an environment, which together with the earlier introduced axiomatic notion of classical structure enables us to…

Quantum Physics · Physics 2015-07-01 Bob Coecke , Simon Perdrix

We establish a universal complementarity relation between the capacity of classical information transmission by employing a multiparty quantum state as a multiport quantum channel, and the genuine multipartite entanglement of the quantum…

Quantum Physics · Physics 2013-10-30 R. Prabhu , Aditi Sen De , Ujjwal Sen

An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel.…

Quantum Physics · Physics 2007-05-23 I. Devetak , P. W. Shor

Quantum channels can describe all transformations allowed by quantum mechanics. We provide an explicit universal protocol to construct all possible quantum channels, using a single qubit ancilla with quantum non-demolition readout and…

Due to the impossibility results of Mayers and Lo/Chau it is generally thought that a quantum channel is cryptographically strictly weaker than oblivious transfer. In this paper we prove that in a three party scenario a quantum channel can…

Quantum Physics · Physics 2007-05-23 J. Mueller-Quade , H. Imai

Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…

Quantum Physics · Physics 2008-11-14 Shengjun Wu , Xuemei Chen

This paper considers the comparison of noisy channels from the viewpoint of statistical decision theory. Various orderings are discussed, all formalizing the idea that one channel is "better" than another for information transmission. The…

Information Theory · Computer Science 2018-03-09 Francesco Buscemi

Cryptographic protocols are the backbone of our information society. This includes two-party protocols which offer protection against distrustful players. Such protocols can be built from a basic primitive called oblivious transfer. We…

We discuss the problem of transfering a qubit from Alice to Bob using a noisy quantum channel and only finite resources. As the basic protocol for the transfer we apply quantum teleportation. It turns out that for a certain quality of the…

Quantum Physics · Physics 2009-11-06 Dietmar G. Fischer , Holger Mack , Matthias Freyberger

As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…

Quantum Physics · Physics 2015-06-12 Holger Boche , Janis Noetzel

The simplest building blocks for quantum computations are the qubit-qubit quantum channels. In this paper, we analyze the structure of these channels via their Choi representation. The restriction of a quantum channel to the space of…

Mathematical Physics · Physics 2023-07-24 Attila Lovas , Attila Andai

Teleportation is the most important and impactful tool in the arsenal of quantum communications with a particular projection on quantum internet. We propose a non-ambiguity alternative to the original teleportation protocol, which…

General Physics · Physics 2020-07-13 Mario Mastriani

Any two-party cryptographic primitive can be implemented using quantum communication under the assumption that it is difficult to store a large number of quantum states perfectly. However, achieving reliable quantum communication over long…

Quantum Physics · Physics 2010-08-03 Iordanis Kerenidis , Stephanie Wehner

We define the direct and reverse secret-key capacities of a memoryless quantum channel as the optimal rates that entanglement-based quantum key distribution protocols can reach by using a single forward classical communication (direct…

Quantum Physics · Physics 2009-02-09 Stefano Pirandola , Raul Garcia-Patron , Samuel L. Braunstein , Seth Lloyd

Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional…

Quantum Physics · Physics 2017-03-21 Li Yang

One of the classical results concerning quantum channels is the characterization of entanglement-breaking channels [M. Horodecki et al., Rev. Math. Phys 15, 629 (2003)]. We address the question whether there exists a similar…

Quantum Physics · Physics 2013-05-30 J. K. Korbicz , P. Horodecki , R. Horodecki

Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported…

Reciprocal pairs of quantum channels are defined as completely positive transformations which admit a rigid, distance-preserving, yet not completely-positive transformation that allows to reproduce the outcome of one from the corresponding…

Quantum Physics · Physics 2018-05-23 Matteo Rosati , Vittorio Giovannetti
‹ Prev 1 4 5 6 7 8 10 Next ›