東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

From Compression to Communication: P...

Atif, Touheed Anwar,

Linked to FindBook

Google Book

Amazon

博客來

From Compression to Communication: Performance Limits for Quantum Networks /

Record Type:	Electronic resources : Monograph/item
Title/Author:	From Compression to Communication: Performance Limits for Quantum Networks // Touheed Anwar Atif.
Author:	Atif, Touheed Anwar,
Description:	1 electronic resource (294 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
Contained By:	Dissertations Abstracts International84-12B.
Subject:	Quantum physics. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30547476
ISBN:	9798379564612

From Compression to Communication: Performance Limits for Quantum Networks /
Atif, Touheed Anwar,

From Compression to Communication: Performance Limits for Quantum Networks /Touheed Anwar Atif. - 1 electronic resource (294 pages)

Source: Dissertations Abstracts International, Volume: 84-12, Section: B.

Quantum algorithms require quantum computers performing logical operations on a sufficiently large number of entangled qubits. Unfortunately, state-of-the-art quantum computers can only operate on tens of qubits. A solution to this scalability challenge is to employ the distributed paradigm, where a network of small-scale quantum computers are used in a distributed manner. It is the aim of my work to study the fundamental limits of distributed quantum problems and to further enhance their performance by exploiting the structure inherent to these problems employing asymptotically good Algebraic codes. This thesis consists of two parts.The first part studies the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and {Charlie}, to simulate a repeated action of a distributed quantum measurement using a pair of non-product approximating measurements by Alice and Bob, followed by a stochastic mapping at {Charlie}. The objective of the protocol is to utilize minimum resources, in terms of classical bits needed by Alice and Bob to communicate their measurement outcomes to {Charlie}, and the common randomness shared among the three parties, while faithfully simulating independent repeated instances of the original measurement. We characterize a set of sufficient communication and common randomness rates required for asymptotic simulatability in terms of single-letter quantum information quantities. We further improve the results obtained in the above by exploiting the structure present in the Charlie's stochastic bivariate mapping using random structured POVMs based on asymptotically good algebraic codes. The algebraic structure of these codes is matched to that of the bivariate function that models the action of Charlie. This leads to the computation being performed on the fly, thus obviating the need to reconstruct individual measurement outcomes at Charlie. We provide examples to illustrate the information-theoretic gains attained by endowing POVMs with algebraic structure. As an application of the distributed measurement compression problem, we also demonstrate a multi-party purity distillation protocol.Concluding this part, we consider the lossy quantum source coding problem where the objective is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the lossy quantum source coding problem. We require that the reconstruction of the compressed quantum source fulfill a global error constraint and employ the notion of a ``posterior reference map'' to measure the reconstruction error. Using these, we characterize the asymptotic performance limit of this problem in terms of single-letter coherent information of the given posterior reference map.In the second part of this thesis, we study the advantage algebraic structured codes can provide, to the class of the classical-quantum network problems. In particular, we investigate two problems. Firstly, we consider the problem of communicating a general bivariate function of two classical sources observed at the encoders of a classical-quantum multiple access channel. We propose and analyze a coding scheme based on algebraic structured coset codes that enables the decoder to recover the desired function without recovering the sources themselves. We derive a new set of sufficient conditions that are weaker than the current known for identified examples. In addition, we analyze the performance of these algebraic codes toward studying the capacity of a special class of 3-user classical-quantum interference channel.

English

ISBN: 9798379564612Subjects--Topical Terms:

726746
Quantum physics.
Subjects--Index Terms:

Distributed quantum measurements

From Compression to Communication: Performance Limits for Quantum Networks /
LDR:05339nmm a22004453i 4500 001 2430306
005 20250519115938.5
006 m o d
007 cr|nu||||||||
008 261011s2023 miu||||||m |||||||eng d
020 $a 9798379564612
035 $a (MiAaPQD)AAI30547476
035 $a (MiAaPQD)umichrackham004912
035 $a AAI30547476
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Atif, Touheed Anwar, $e author. $3 3818559
245 1 0 $a From Compression to Communication: Performance Limits for Quantum Networks / $c Touheed Anwar Atif.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2023
300 $a 1 electronic resource (294 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
500 $a Advisors: Pradhan, S. Sandeep Committee members: Zhang, Jun; Cheraghchi, Mahdi; Mahdavifar, Hessam; Winter, Andreas.
502 $b Ph.D. $c University of Michigan $d 2023.
520 $a Quantum algorithms require quantum computers performing logical operations on a sufficiently large number of entangled qubits. Unfortunately, state-of-the-art quantum computers can only operate on tens of qubits. A solution to this scalability challenge is to employ the distributed paradigm, where a network of small-scale quantum computers are used in a distributed manner. It is the aim of my work to study the fundamental limits of distributed quantum problems and to further enhance their performance by exploiting the structure inherent to these problems employing asymptotically good Algebraic codes. This thesis consists of two parts.The first part studies the task of faithfully simulating a distributed quantum measurement, wherein we provide a protocol for the three parties, Alice, Bob and {Charlie}, to simulate a repeated action of a distributed quantum measurement using a pair of non-product approximating measurements by Alice and Bob, followed by a stochastic mapping at {Charlie}. The objective of the protocol is to utilize minimum resources, in terms of classical bits needed by Alice and Bob to communicate their measurement outcomes to {Charlie}, and the common randomness shared among the three parties, while faithfully simulating independent repeated instances of the original measurement. We characterize a set of sufficient communication and common randomness rates required for asymptotic simulatability in terms of single-letter quantum information quantities. We further improve the results obtained in the above by exploiting the structure present in the Charlie's stochastic bivariate mapping using random structured POVMs based on asymptotically good algebraic codes. The algebraic structure of these codes is matched to that of the bivariate function that models the action of Charlie. This leads to the computation being performed on the fly, thus obviating the need to reconstruct individual measurement outcomes at Charlie. We provide examples to illustrate the information-theoretic gains attained by endowing POVMs with algebraic structure. As an application of the distributed measurement compression problem, we also demonstrate a multi-party purity distillation protocol.Concluding this part, we consider the lossy quantum source coding problem where the objective is to compress a given quantum source below its von Neumann entropy. Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the lossy quantum source coding problem. We require that the reconstruction of the compressed quantum source fulfill a global error constraint and employ the notion of a ``posterior reference map'' to measure the reconstruction error. Using these, we characterize the asymptotic performance limit of this problem in terms of single-letter coherent information of the given posterior reference map.In the second part of this thesis, we study the advantage algebraic structured codes can provide, to the class of the classical-quantum network problems. In particular, we investigate two problems. Firstly, we consider the problem of communicating a general bivariate function of two classical sources observed at the encoders of a classical-quantum multiple access channel. We propose and analyze a coding scheme based on algebraic structured coset codes that enables the decoder to recover the desired function without recovering the sources themselves. We derive a new set of sufficient conditions that are weaker than the current known for identified examples. In addition, we analyze the performance of these algebraic codes toward studying the capacity of a special class of 3-user classical-quantum interference channel.
546 $a English
590 $a School code: 0127
650 4 $a Quantum physics. $3 726746
650 4 $a Computer science. $3 523869
650 4 $a Electrical engineering. $3 649834
653 $a Distributed quantum measurements
653 $a Lossy quantum source coding
653 $a Algebraic structured codes
653 $a Multiple access channel
653 $a Classical-quantum interference channel
690 $a 0544
690 $a 0599
690 $a 0984
710 2 $a University of Michigan. $b Electrical and Computer Engineering. $e degree granting institution. $3 3818560
720 1 $a Pradhan, S. Sandeep $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 84-12B.
790 $a 0127
791 $a Ph.D.
792 $a 2023
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30547476