Lossy quantum source coding with a global error criterion based on a posterior reference map
We consider the lossy quantum source coding problem, where the task is to compress a
given quantum source below its von Neumann entropy. Inspired by the duality connections …
given quantum source below its von Neumann entropy. Inspired by the duality connections …
A new formulation of lossy quantum-classical and classical source coding based on a posterior channel
In this work, we address the lossy quantum-classical (QC) source coding problem, where the
task is to compress the classical information about a quantum source, obtained after …
task is to compress the classical information about a quantum source, obtained after …
Distributed quantum faithful simulation and function computation using algebraic structured measurements
TA Atif, SS Pradhan - 2021 IEEE International Symposium on …, 2021 - ieeexplore.ieee.org
We consider the task of faithfully simulating a distributed quantum measurement and
function computation, and demonstrate a new achievable rate-region. For this, we develop …
function computation, and demonstrate a new achievable rate-region. For this, we develop …
Faithful simulation of distributed quantum measurements with applications in distributed rate-distortion theory
We consider 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 …
we provide a protocol for the three parties, Alice, Bob and Charlie, to simulate a repeated …
Multiple access channel simulation
GR Kurri, V Ramachandran, SRB Pillai… - IEEE Transactions …, 2022 - ieeexplore.ieee.org
We study the problem of simulating a two-user multiple-access channel (MAC) over a
multiple access network of noiseless links. Two encoders observe independent and …
multiple access network of noiseless links. Two encoders observe independent and …
From Compression to Communication: Performance Limits for Quantum Networks
TA Atif - 2023 - deepblue.lib.umich.edu
Quantum algorithms require quantum computers performing logical operations on a
sufficiently large number of entangled qubits. Unfortunately, state-of-the-art quantum …
sufficiently large number of entangled qubits. Unfortunately, state-of-the-art quantum …
Synthesizing correlated randomness using algebraic structured codes
TA Atif, A Padakandla… - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
In this problem, Alice and Bob, are provided X_1^n and X_2^n that are IID px_1x_2. Alice
and Bob can communicate to Charles over (noiseless) links of rate R_1 and R_2 …
and Bob can communicate to Charles over (noiseless) links of rate R_1 and R_2 …