Related papers: Approximate virtual quantum broadcasting
We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbours and the channel has a…
Importance sampling based on quasi-probability decomposition is the backbone of many widely used techniques, such as error mitigation, circuit knitting, and, more generally, virtual quantum resource distillation, as it allows one to…
A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be…
We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of $n$…
We extend the research program initiated in [Phys. Rev. A 92, 012338 (2015)], where we restricted our attention to noisy deterministic teleportation protocols, to noisy probabilistic (conditional) protocols. Our main goal now is to study…
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed…
Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement…
We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or…
This work discusses the source broadcasting problem, i.e. transmitting a source to many receivers via a broadcast channel. The optimal rate-distortion region for this problem is unknown. The separation approach divides the problem into two…
While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case…
A programmable quantum processor is a fundamental model of quantum computation. In this model, any quantum channel can be approximated by applying a fixed universal quantum operation onto an input state and a quantum `program' state, whose…
The no-cloning theorem is a cornerstone of quantum cryptography. Here we generalize and rederive in a unified framework various upper bounds on the maximum achievable fidelity of probabilistic and deterministic cloning machines. Building on…
Quantum information, though not precisely defined, is a fundamental concept of quantum information theory which predicts many fascinating phenomena and provides new physical resources. A basic problem is to recognize the features of quantum…
Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire…
Quantum teleportation allows to transfer unknown quantum states between distant parties. It is not only a primitive of quantum communications but also an essential task in realization of the quantum networks for promising applications such…
Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…
We study the complexity of two closely related learning problems, one quantum and one classical. In the quantum setting, we consider agnostic tomography for the natural class of product mixed states. Given $N$ copies of an $n$-qubit state…
Preparing the ground state of a local Hamiltonian is a crucial problem in understanding quantum many-body systems, with applications in a variety of physics fields and connections to combinatorial optimization. While various quantum…
We consider the hypothetical quantum network case where Alice wishes to transmit one qubit of information (specifically a pure quantum state) to $M$ parties, where $M$ is some large number. The remote receivers locally perform single qubit…
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the…