scholarly journals On the near-optimality of one-shot classical communication over quantum channels

2019 ◽  
Vol 60 (1) ◽  
pp. 012204 ◽  
Author(s):  
Anurag Anshu ◽  
Rahul Jain ◽  
Naqueeb Ahmad Warsi
2014 ◽  
Vol 12 (03) ◽  
pp. 1450011 ◽  
Author(s):  
Pengfei Xing ◽  
Yimin Liu ◽  
Chuanmei Xie ◽  
Xiansong Liu ◽  
Zhanjun Zhang

Two three-party schemes are put forward for sharing quantum operations on a remote qutrit with local operation and classical communication as well as shared entanglements. The first scheme uses a two-qutrit and three-qutrit non-maximally entangled states as quantum channels, while the second replaces the three-qutrit non-maximally entangled state with a two-qutrit. Both schemes are treated and compared from the four aspects of quantum and classical resource consumption, necessary-operation complexity, success probability and efficiency. It is found that the latter is overall more optimal than the former as far as a restricted set of operations is concerned. In addition, comparisons of both schemes with other four relevant ones are also made to show their two features, including degree generalization and channel-state generalization. Furthermore, some concrete discussions on both schemes are made to expose their important features of security, symmetry and experimental feasibility. Particularly, it is revealed that the success probabilities and intrinsic efficiencies in both schemes are completely determined by the shared entanglement.


2005 ◽  
Vol 16 (08) ◽  
pp. 1293-1301 ◽  
Author(s):  
TING GAO ◽  
FENGLI YAN ◽  
ZHIXI WANG

Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission of Charlie (i.e., Charlie is trustworthy and cooperative, which means the "conditional" in the two schemes), Alice and Bob begin their private communication under the control of Charlie. In the first scheme, Alice transmits secret message to Bob in a deterministic manner with the help of Charlie by means of Alice's local unitary transformations, both Alice and Bob's local measurements, and both of Alice and Charlie's public classical communication. In the second scheme, the secure communication between Alice and Bob can be achieved via public classical communication of Charlie and Alice, and the local measurements of both Alice and Bob. The common feature of these protocols is that the communications between two communication parties Alice and Bob depend on the agreement of the third side Charlie. Moreover, transmitting one bit secret message, the sender Alice only needs to apply a local operation on her one qubit and send one bit classical information. We also show that the two schemes are completely secure if quantum channels are perfect.


2010 ◽  
Vol 20 (03) ◽  
pp. 227-237 ◽  
Author(s):  
MARIUS NAGY ◽  
SELIM G. AKL

We develop an entanglement verification method not based on Bell inequalities, that achieves a higher reliability per number of qubits tested than existing procedures of this kind. Used in a quantum cryptographic context, the method gives rise to a new protocol for distributing classical keys through insecure quantum channels. The cost of quantum and classical communication is significantly reduced in the new protocol, while its security is increased with respect to other entanglement-based protocols exchanging the same number of qubits. To achieve this performance, our scheme relies on a simple quantum circuit and the ability to store qubits.


2011 ◽  
Vol 09 (01) ◽  
pp. 539-546 ◽  
Author(s):  
LIAN-FANG HAN ◽  
HAO YUAN

We propose two protocols for remotely preparing a two-qubit entangled state, where the quantum channels take the form of one-dimensional four-qubit cluster and cluster-class states, respectively. The total success probability and classical communication cost are also calculated.


2008 ◽  
Vol 06 (05) ◽  
pp. 1101-1113 ◽  
Author(s):  
GUI-XIA PAN ◽  
YI-MIN LIU ◽  
XUE-QIN ZUO ◽  
WEN ZHANG ◽  
ZHAN-JUN ZHANG

We present a quantum information splitting scheme of a two-qubit state by using two Greenberger–Horne–Zeilinger (GHZ) states as quantum channels. In this scheme, since the sender Alice knows the quantum information in priori, she only needs to perform a two-qubit measurement and publish two classical bits for her two agents Bob and Charlie to reconstruct the quantum information via their mutual assistance. We calculate the success probability and classical communication cost within the scheme. In the general case, Alice can successfully split the state with probability 25% (probabilistic) and the classical communication cost is 4 classical bits. However, in some special cases, the secret states are chosen from a special ensemble, the success probability of our scheme can be increased to 50% or even to 100% (deterministic) after consuming some extra classical bits.


Sign in / Sign up

Export Citation Format

Share Document