We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for noiseless qudit channels (where d is arbitrary), our main result is a simulation method that fails with probability less than 2⁻ᶿ⁽ⁿᵋ⁾ and uses a qudit channel n(1 + Θ(√ε)) times, of which ε fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the √ε term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the commu...
We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 ...
Random circuit simulation, the task of replicating the output of a randomly chosen noiseless quantum...
In theory, perfect quantum computers can solve certain problems that are con- sidered intractable wi...
We consider the problem of implementing two-party interactive quantum communication over noisy chann...
© 2018 Copyright held by the owner/author(s). We consider the problem of implementing two-party inte...
In this thesis, we investigate how protocols in quantum communication theory are influenced by noise...
AbstractIn the setting of communication complexity, two distributed parties want to compute a functi...
We study quantum communication protocols, in which the players\u27 storage starts out in a state whe...
In this correspondence, we study quantum communication in the presence of adversarial noise. In this...
Quantum computing resources have been known to provide speed-ups in computational complexity in many...
Let H be a finite dimensional Hilbert space and ρ, σ ∈ D(H) be quantum states in H such that S(ρ||σ...
Superdense coding and quantum teleportation are two phenomena which were not possible without prior ...
I show that a simple multi-party communication task can be performed more efficiently with quantum c...
In this thesis we present the concept of embezzlement of entanglement, its properties, efficiency, p...
We present a formalism that captures the process of proving quantum superiority to skeptics as an in...
We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 ...
Random circuit simulation, the task of replicating the output of a randomly chosen noiseless quantum...
In theory, perfect quantum computers can solve certain problems that are con- sidered intractable wi...
We consider the problem of implementing two-party interactive quantum communication over noisy chann...
© 2018 Copyright held by the owner/author(s). We consider the problem of implementing two-party inte...
In this thesis, we investigate how protocols in quantum communication theory are influenced by noise...
AbstractIn the setting of communication complexity, two distributed parties want to compute a functi...
We study quantum communication protocols, in which the players\u27 storage starts out in a state whe...
In this correspondence, we study quantum communication in the presence of adversarial noise. In this...
Quantum computing resources have been known to provide speed-ups in computational complexity in many...
Let H be a finite dimensional Hilbert space and ρ, σ ∈ D(H) be quantum states in H such that S(ρ||σ...
Superdense coding and quantum teleportation are two phenomena which were not possible without prior ...
I show that a simple multi-party communication task can be performed more efficiently with quantum c...
In this thesis we present the concept of embezzlement of entanglement, its properties, efficiency, p...
We present a formalism that captures the process of proving quantum superiority to skeptics as an in...
We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 ...
Random circuit simulation, the task of replicating the output of a randomly chosen noiseless quantum...
In theory, perfect quantum computers can solve certain problems that are con- sidered intractable wi...