Related papers: Sufficient conditions for quantum advantage in ran…
A two-layer quantum protocol for secure transmission of data using qubits is presented. The protocol is an improvement over the BB84 QKD protocol. BB84, in conjunction with the one-time pad algorithm, has been shown to be unconditionally…
We consider the problem of communicating over a classical-quantum (CQ) multiple access channel with random classical states non-causally available at the transmitter, referred to as a QMSTx. QMSTx is a classical-quantum multiple access…
We present a necessary and sufficient condition to determine the entanglement status of an arbitrary N-qubit quantum state (may be pure or mixed) represented by the density matrix, (Rho)N. We develop a new approach and a new criterion for…
We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their…
A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…
Quantum Key Agreement (QKA) signifies that two or more participants together generate a key and QKA has to satisfy the following conditions: 1 Every participant can change the key and the key is not decided by any participant individually.…
The transfer of an unknown quantum state, from a sender to a receiver, is one of the main requirements to perform quantum information processing tasks. In this respect, the state transfer of a single qubit by means of spin chains has been…
We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based…
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be…
We first consider quantum communication protocols between a sender Alice and a receiver Bob, which transfer Alice's quantum information to Bob by means of non-local resources, such as classical communication, quantum communication, and…
We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via Local Operations assisted by…
Quantum computational advantage is a critical milestone for near-term quantum technologies and an essential step towards building practical quantum computers. Recent successful demonstrations of quantum computational advantage owe much to…
By considering an unreliable oracle in a query-based model of quantum learning, we present a tradeoff relation between the oracle's reliability and the reusability of quantum state of the input data. The tradeoff relation manifests as the…
We describe a general quantum receiver protocol that maps laser-light-modulated classical communications signals into quantum processors for decoding with quantum logic. The quantum logic enables joint quantum measurements over a codeword…
Random access codes are an intriguing class of communication tasks that reveal an operational and quantitative difference between classical and quantum information processing. We formulate a natural generalization of random access codes and…
We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be…
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward,…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…
In this thesis we explore the benefits of relativistic constraints for cryptography. We first revisit non-communicating models and its applications in the context of interactive proofs and cryptography. We propose bit commitment protocols…
We propose a classical to quantum information encoding system using non--orthogonal states and apply it to the problem of searching an element in a quantum list. We show that the proposed encoding scheme leads to an exponential gain in…