English
Related papers

Related papers: Reducing the communication complexity with quantum…

200 papers

We obtain a four-photon polarization-entangled state with a visibility as high as (95.35\pm 0.45)% directly from a single down-conversion source. A success probability of (81.54\pm 1.38)% is observed by applying this entangled state to…

Quantum Physics · Physics 2009-11-13 Jin-Shi Xu , Chuan-Feng Li , Guang-Can Guo

We present a protocol to simulate the quantum correlation implied by non maximally entangled two qubit states, in the worst case scenario. This protocol makes a single use of PR-box and a single use of Millionaire box (M-box). To the best…

Quantum Physics · Physics 2011-04-14 Ali Ahanj , Pramod S. Joag

Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more…

We present two protocols for the single-photon entanglement concentration. With the help of the 50:50 beam splitter, variable beam splitter and an auxiliary photon, we can concentrate a less-entangled single-photon state into a maximally…

Quantum Physics · Physics 2012-10-01 Lan Zhou

Entanglement has the ability to enhance the transmission of classical information over a quantum channel. However, fully harvesting this advantage typically requires complex entangling measurements, which are challenging to implement and…

We present a protocol to simulate the correlations implied by nonmaximally entangled two qubit states. We extend this protocol to simulate the non-local part of these correlations. These protocols use single cbit communication and a single…

Quantum Physics · Physics 2008-07-15 Ali Ahanj , Pramod S. Joag

This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…

Quantum Physics · Physics 2013-01-11 Subhash Kak

Entanglement appears in two different ways in quantum mechanics, namely as a property of states and as a property of measurement outcomes in joint measurements. By combining these two aspects of entanglement, it is possible to generate…

Quantum Physics · Physics 2012-09-26 Nicolas Brunner , Cyril Branciard , Nicolas Gisin , Denis Rosset

We consider a quantum and classical version multi-party function computation problem with $n$ players, where players $2, \dots, n$ need to communicate appropriate information to player 1, so that a "generalized" inner product function with…

Quantum Physics · Physics 2024-02-06 Ruoyu Meng , Aditya Ramamoorthy

A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.

Computational Complexity · Computer Science 2022-04-05 Dmytro Gavinsky

We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel. Specifically, it is shown that, given a single use of this…

Quantum Physics · Physics 2011-04-01 R. Prevedel , Y. Lu , W. Matthews , R. Kaltenbaek , K. J. Resch

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…

Quantum Physics · Physics 2013-12-24 A. Montina , M. Pfaffhauser , S. Wolf

The frame of classical probability theory can be generalized by enlarging the usual family of random variables in order to encompass nondeterministic ones: this leads to a frame in which two kinds of correlations emerge: the classical…

Quantum Physics · Physics 2007-05-23 E. G. Beltrametti , S. Bugajski

We propose a protocol for deterministic communication that does not make use of entanglement. It exploits nonorthogonal states in a two-way quantum channel attaining significant improvement of security and efficiency over already known…

Quantum Physics · Physics 2009-11-10 M. Lucamarini , S. Mancini

We present two realistic entanglement concentration protocols (ECPs) for pure partially entangled photons. A partially entangled photon pair can be concentrated to a maximally entangled pair with only an ancillary single photon in a certain…

Quantum Physics · Physics 2015-06-04 Yu-Bo Sheng , Lan Zhou , Sheng-Mei Zhao , Bao-Yu Zheng

We show that all multi-partite pure states can, under local operations, be transformed into bi-partite pairwise entangled states in a "lossless fashion": An arbitrary distinguished party will keep pairwise entanglement with all other…

Quantum Physics · Physics 2015-05-13 Dong Yang , Jens Eisert

We construct the protocols to achieve probabilistic and deterministic entanglement transformations for bipartite pure states by means of local operations and classical communication. A new condition on pure contraction transformations is…

Quantum Physics · Physics 2007-05-23 G. M. D'Ariano , M. F. Sacchi

A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…

Quantum Physics · Physics 2026-03-19 Carles Roch I Carceller , Armin Tavakoli

We introduce a new multipartite communication scheme, with the aim to enable the senders to remotely and obliviously provide the receivers with an arbitrary amount of multipartite entanglement. The scheme is similar to Remote State…

Quantum Physics · Physics 2013-08-23 C. Spee , J. I. de Vicente , B. Kraus

With the goal of gaining a deeper understanding of quantum non-locality, we decompose quantum correlations into more elementary non-local correlations. We show that the correlations of all pure entangled states of two qubits can be…

Quantum Physics · Physics 2009-11-13 Nicolas Brunner , Nicolas Gisin , Sandu Popescu , Valerio Scarani