Related papers: Clean quantum and classical communication protocol…
Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional…
The scarcity of qubits is a major obstacle to the practical usage of quantum computers in the near future. To circumvent this problem, various circuit knitting techniques have been developed to partition large quantum circuits into…
We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes…
We investigate a general class of quantum key distribution (QKD) protocols using one-way classical communication. We show that full security can be proven by considering only collective attacks. We derive computable lower and upper bounds…
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show that if the quantum k-party communication complexity of a…
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes…
Quantum networks will allow to implement communication tasks beyond the reach of their classical counterparts. A pressing and necessary issue for the design of quantum network protocols is the quantification of the rates at which these…
Entanglement has been shown to be necessary for pure state quantum computation to have an advantage over classical computation. However, it remains open whether entanglement is necessary for quantum computers that use mixed states to also…
Generalized probabilistic theories (GPT) provide a framework in which one can formulate physical theories that includes classical and quantum theories, but also many other alternative theories. In order to compare different GPTs, we…
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…
We demonstrate how to universally simulate ensemble statistics of projective local measurements on any $n$-qubit state shared among $n$ observers with classical communication and shared randomness. Our technique originates from protocols…
Interactive verification protocols for quantum computations allow to build trust between a client and a service provider, ensuring the former that the instructed computation was carried out faithfully. They come in two variants, one without…
Near-term quantum communication protocols suffer inevitably from channel noises, whose alleviation has been mostly attempted with resources such as multiparty entanglement or sophisticated experimental techniques. Generation of multiparty…
For two non-communicating parties, quantum theory can give rise to probability distributions of outcomes that no local classical model can reproduce without communication. However, in the case of two-dimensional systems ($d=2$), it is known…
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished.…
We establish a theoretical understanding of the entanglement properties of a physical system that mediates a quantum information splitting protocol. We quantify the different ways in which an arbitrary $n$ qubit state can be split among a…
We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with…
A one way partial quantum bit commitment protocol is developed, using states with built-in classical correlation, completely independent of entanglement. It involves concealing information in a set of mutually non-orthogonal states and…
Entanglement concentration requires no classical communication, but the best prior art result for diluting to N copies of a partially entangled state requires an amount of communication on the order of sqrt(N) bits. Our main result is to…