Related papers: Does there exist a quantum fingerprinting protocol…
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…
Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel…
Full quantum capability devices can provide secure communications, but they are challenging to make portable given the current technology. Besides, classical portable devices are unable to construct communication channels resistant to…
We present a new protocol for practical quantum cryptography, tailored for an implementation with weak coherent pulses. The key is obtained by a very simple time-of-arrival measurement on the data line; an interferometer is built on an…
Reliable execution of large-scale quantum algorithms requires robust underlying operations and this challenge is addressed by quantum error correction (QEC). Most modern QEC protocols rely on measurements and feed-forward operations, which…
We show two results about the relationship between quantum and classical messages. Our first contribution is to show how to replace a quantum message in a one-way communication protocol by a deterministic message, establishing that for all…
Transmitting information about quantum states over classical noisy channels is an important problem with applications to science, computing, and sensing. This task, however, poses fundamental challenges due to the exponential scaling of…
In quantum repeater protocols, measurements are performed in multiple relay points. Classical communications are used to convey the measurement results. It is important to improve the way of conveying the measurement results so that EPR…
Authentication is a well-studied area of classical cryptography: a sender S and a receiver R sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified by any third party…
Code-switching is a powerful technique in quantum error correction that allows one to leverage the complementary strengths of different codes to achieve fault-tolerant universal quantum computation. However, existing code-switching…
We study quantum communication protocols, in which the players' storage starts out in a state where one qubit is in a pure state, and all other qubits are totally mixed (i.e. in a random state), and no other storage is available (for…
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising…
The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for…
We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide…
We propose to analyse quantum protocols by applying formal verification techniques developed in classical computing for the analysis of communicating concurrent systems. One area of successful application of these techniques is that of…
Extensive quantum error correction is necessary in order to perform a useful computation on a noisy quantum computer. Moreover, quantum error correction must be implemented based on imperfect parity check measurements that may return…
We develop a new lower bound method for analysing the complexity of the Equality function (EQ) in the Simultaneous Message Passing (SMP) model of communication complexity. The new technique gives tight lower bounds of $\Omega(\sqrt n)$ for…
We introduce a new type of cryptographic primitive that we call hiding fingerprinting. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\ll n$, such that given any string $y$ and a…