Related papers: Strong bounds on required resources for quantum ch…
We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…
We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool.…
Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications. An important goal is to obtain the best possible tradeoffs…
Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum information processing. According to theory, this is achieved via entanglement monotones, that is,…
A fundamental quantity of interest in Shannon theory, classical or quantum, is the error exponent of a given channel $W$ and rate $R$: the constant $E(W,R)$ which governs the exponential decay of decoding error when using ever larger…
Long-range entanglement is an important quantum resource, particularly for topological orders and quantum error correction. In reality, preparing long-range entangled states requires a deep unitary circuit, which poses significant…
We analyse the minimum quantum resources needed to realise strong non-locality, as exemplified e.g. by the classical GHZ construction. It was already known that no two-qubit system, with any finite number of local measurements, can realise…
We address the issue of reducing the resource required to compute information-theoretic quantum correlation measures like quantum discord and quantum work deficit in two qubits and higher dimensional systems. We show that determination of…
Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits,…
We construct new protocols for the tasks of converting noisy multipartite quantum correlations into noiseless classical and quantum ones using local operations and classical communications (LOCC). For the former, known as common randomness…
Shannon in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically secure way. Ambainis, Mosca, Tapp and de Wolf in quant-ph/0003101 considered…
Discrimination of quantum states under local operations and classical communication (LOCC) is an intriguing question in the context of local retrieval of classical information, encoded in the multipartite quantum systems. All the local…
We consider the fundamental problem of multiple stations competing to transmit on a multiple access channel (MAC). We are given $n$ stations out of which at most $d$ are active and intend to transmit a message to other stations using MAC.…
We propose the notion of process resource-breaking channels that break the resource for a quantum information processing task. We examine the same using quantum dense coding and teleportation protocols. We prove that the sets DBT (dense…
Optimization of quantum programs or circuits is a fundamental problem in quantum computing and remains a major challenge. State-of-the-art quantum circuit optimizers rely on heuristics and typically require superlinear, and even…
Random permutation circuits were recently introduced as minimal models for local many-body dynamics that can be interpreted both as classical and quantum. Standard dynamical complexity indicators such as damage spreading and…
Extension of point-to-point communication model to the realm of multi-node configurations finds a plethora of applications in internet and telecommunication networks. Here, we establish a novel advantage of quantum communication in a…
Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately modelled by classical physics. However, when quantum effects…
Open questions from Sarovar and Milburn (2006 J.Phys. A: Math. Gen. 39 8487) are answered. Sarovar and Milburn derived a convenient upper bound for the Fisher information of a one-parameter quantum channel. They showed that for…
Dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one, reverse Shannon theorems concern the use of noiseless channels to simulate noisy ones, and more generally the…