Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"quantum communication complexity"”.
-
PROBLEMS IN QUANTUM TAMPER RESILIENT CRYPTOGRAPHY AND QUANTUM COMMUNICATION COMPLEXITY
… security of these combinatorial objects against quantum side information on the imperfect sources of randomness. In the second part of this thesis, we study a problem related to quantum communication complexity. In particular, we disprove the quantum log-approximate-rank conjecture of Lee and …
-
DIRECT PRODUCT, FUNCTION COMPOSITION AND DEVICE-INDEPENDENT CRYPTOGRAPHY
… direct product and composition theorems in query complexity, communication complexity and non-local games, and show applications of these results in device-independent cryptography. The first part of the thesis deals with direct product and composition theorems. Our first result in this part is a …
-
Efficient quantum communication protocols and asynchronism in the toric code
This thesis studies quantum communication complexity and quantum error correction, two fundamental areas in the theory of quantum computation, and is divided into two parts. The first part focuses on generalising three central problems in quantum communication complexity, often by the introduction …
-
ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS
… coding in the one-shot entanglement-assisted quantum setting. The main contribution of the first part of the thesis is to systematically develop one-shot protocols for various quantum tasks, using two unified tools of `convex-split' and `position-based decoding'. Convex-split is used for the …
-
Quantum Rejection Sampling
… dimensional Hilbert space and ρ, σ ∈ D(H) be quantum states in H such that S(ρ||σ) is finite. In this thesis, we consider the following communication task involving two parties Alice and Bob. Suppose that Alice is given a classical description of the states ρ and σ. Given an unlimited number …
-
Lower Bounds on Average-Case and Non-Local Quantum Computation
… limitations in both classical and quantum models of computation. It is organized into two parts, each addressing a different aspect of computational hardness. Despite their differences, both parts share a common goal: understanding how structural and physical constraints shape what …
-
Noisy Interactive Quantum Communication
… 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 …
-
Experimental Quantum Communication based on Sagnac Interferometers
Quantum communication uses quantum states to transmit information. The core of quantum communication rests on distinctive quantum properties, such as quantum superposition and entanglement, allowing communication tasks to be achieved more efficiently or securely than classical communication. Over …