IEEE International Symposium on Information Theory (ISIT)

Coherent Distributed Source Simulation as Multipartite Quantum State Splitting

Ian M. George, Hao–Chung Cheng

Published Jul 7, 2024• 5 citations

Abstract

Recently, Cheng et al generalized quantum state splitting (QSS) to the multipartite setting for applications in quantum network information theory. Furthermore, Cheng and Gao recently noted that unipartite convex splitting reduces to soft covering for classical-quantum states. Soft covering is a common primitive in (classical, network) information theory that does not seem to need an extension to the multipartite setting, e.g. when establishing rates for many party distributed source simulation (DSS). This suggests a gap in our understanding of how these tasks are related. In this work we clarify this relation. We first identify “incoherent” QSS without entanglement assistance with DSS in the bipartite setting. Motivated by this, we identify “coherent” DSS as a special case of multipartite QSS. We then establish a one-shot rate region for multipartite QSS in terms of smooth multipartite mutual information quantities, which in turn implies a one-shot rate region for coherent DSS. Lastly, we establish a strong asymptotic equipartition property for mutual information quantities to establish a strong converse rate region for multipartite QSS and coherent DSS.

DOI: 10.1109/isit57864.2024.10619569

Related papers

One-Shot Distributed Source Simulation: As Quantum as It Can Get

Ian George, Min-Hsiu Hsieh, Eric Chitambar

Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some target correlation. Wyner’s seminal result showed that asymptotically the rate of uniform shared randomness needed for this task is given by a mutual information induced measure, now referred to as Wyner’s common information. This asymptotic result was extended by Hayashi in the quantum setting to separable states, the largest class of states for which this task can be performed to vanishing error. In this work we characterize this task in a near-tight manner in the one-shot setting using the smooth entropy framework. We do this by introducing one-shot operational quantities and correlation measures that characterize them. We establish asymptotic equipartition properties for our correlation measures thereby recovering the previous vanishing-error asymptotic results. In doing so, we consider technical points in one-shot network information theory and provide methods for cardinality bounds in the smooth entropy calculus. We also introduce entangled state versions of the distributed source simulation task and determine bounds in this setting via quantum embezzling. This provides a strong characterization of this network task in the one-shot, quantum regime.

arXiv:2301.04301IEEE Transactions on Information TheoryOct 23, 20257 citations

Processing correlated quantum systems in the one-shot setting

Ian George

The novel ways in which correlations may be encoded non-locally in quantum mechanics have led to the promise of new technologies. This, in turn, has led to the first attempts at the development of quantum networks. Nonetheless, our understanding of quantum correlations and the limits of how we may process them over a quantum network remains nascent. This thesis studies the limits of processing quantum correlations between spatially separated parties in various settings and the mathematical tools necessary to determine such limits. To do so, this thesis studies three general problems in quantum network theory. The first problem is the minimum resources to prepare a quantum correlation between non-communicative receivers, which may be viewed as a star network. This study is separated into three pieces. The first piece is a near-tight one-shot quantum generalization of a problem introduced by Wyner, distributed source simulation. Establishing our one-shot bounds builds on recent work on soft-covering without smoothing and relies on establishing a variety of properties for one-shot entropic quantities, as well as improving our understanding of the smooth entropy framework in quantum network information theory. As distributed source simulation cannot be achieved to arbitrary error for sufficiently entangled states, the second piece characterizes the minimal error of converting one entangled state to another using zero communication. This relies on establishing new properties of the fidelity measure. The third piece establishes an entanglement-assisted version of the distributed source simulation task that can be achieved to arbitrary error for arbitrary quantum systems. This result builds on recent work on multipartite state splitting and establishing new properties of one-shot multipartite max mutual information quantities. The second problem is the extraction of perfect classical correlation from a multipartite quantum source where the receivers do not communicate. This may be seen as the reverse process of distributed source simulation. We establish that this is asymptotically possible in quantum mechanics for the first time and establish the asymptotic rate for classical-quantum states. The technical barrier in establishing the asymptotic rate is establishing a limit on how much noiseless correlation can be extracted without communication. Our major technical contribution is establishing such a limit by generalizing a technical lemma of Gács and Körner to classical-quantum states. The final problem is distributed state discrimination of quantum product states. This is motivated by its relevance to both understanding non-locality in quantum mechanics and developing quantum cryptographic schemes. Our study again breaks into three key pieces. First, we study the framework of local operations and simultaneous classical or quantum communication (LOSCC and LOSQC respectively) for product states, which is relevant to quantum cryptography. We establish the first separation between quantum and classical communication in the simultaneous communication model using only product state inputs. We also establish a new uncertainty relation that implies error bounds for discriminating product states using LOSQC. Second, we study state discrimination under local operations and classical communication (LOCC). We develop a new framework for zero-error state discrimination under LOCC. Our framework provides a simple proof of orthogonal product states that cannot be distinguished using LOCC--- a property introduced by Bennett et al. Finally, we study the thermodynamics of zero-error distributed state discrimination in the framework of Faist et al. This allows us to resolve an open problem from the aforementioned paper of Bennett et al.

Oct 2, 20240 citations

Fully smooth one shot multipartite soft covering of quantum states without pairwise independence

Sen, Pranab

We provide a powerful machinery to prove fully smooth one shot multipartite covering, aka convex split, type results for quantum states. In the important case of smooth multipartite convex split for classical quantum states, aka smooth multipartite soft covering, our machinery works even when certain marginals of these states do not satisfy pairwise independence. The recent paper (arXiv:2410.17893) gave the first proof of fully smooth multipartite convex split by simplifying and extending a technique called telescoping, developed originally for convex split by (arXiv:2304.12056). However, that work as well as all earlier works on convex split assumed pairwise or even more independence amongst suitable marginals of the quantum states. We develop our machinery by leveraging known results from (arXiv:1806.07278) involving tilting and augmentation smoothing of quantum states, combined with a novel observation that a natural quantum operation `flattening' quantum states actually preserves the fidelity. This machinery is powerful enough to lead to non pairwise independent results as mentioned above. As an application of our soft covering lemma without pairwise independence, we prove the `natural' one shot inner bounds for sending private classical information over a quantum wiretap interference channel, even when the classical encoders at the input lose pairwise independence in their encoding strategies to a certain extent. This result was unknown earlier even in the classical setting.

arXiv:2410.17908Oct 23, 20241 citation

Fully smooth one shot multipartite covering and decoupling of quantum states via telescoping

Sen, Pranab

We prove fully smooth one shot multipartite covering, aka convex split, results as well as fully smooth multipartite decoupling results for quantum states. Fully smooth one shot results for these problems were not known earlier, though the works of Cheng, Gao and Berta (arXiv:2304.12056) for convex split, and Colomer and Winter (arXiv:2304.12114) for decoupling, had made substantial progress by introducing a technique called telescoping cum mean zero decomposition of quantum states. We show that the telescoping cum mean zero decomposition technique can in fact be simplified and further extended in order to prove fully smooth decoupling and convex split results. Our techniques allow us to prove the first fully smooth one shot inner bounds for various fundamental network quantum information theory problems like e.g. the generalised Slepian Wolf problem of Anshu, Jain and Warsi (arXiv:1703.09961). We can also prove for the first time the natural polyhedral inner bound for sending quantum information over a quantum multiple access channel with limited entanglement assistance, first conjectured in Chakraborty, Nema and Sen (arXiv::2102.02187).

arXiv:2410.17893Oct 23, 20241 citation

One-Shot Bounds on State Generation using Correlated Resources and Local Encoders

Ian M. George, Min-Hsiu Hsieh, Eric Chitambar

IEEE International Symposium on Information Theory (ISIT)Jun 25, 20235 citations

Quantum Broadcast Channel Simulation via Multipartite Convex Splitting

Mario Berta, Hao–Chung Cheng, Li Gao

We show that the communication cost of quantum broadcast channel simulation under free entanglement assistance between the sender and the receivers is asymptotically characterized by an efficiently computable single-letter formula in terms of the channel's multipartite mutual information. Our core contribution is a new one-shot achievability result for multipartite quantum state splitting via multipartite convex splitting. As part of this, we face a general instance of the quantum joint typicality problem with arbitrarily overlapping marginals. The crucial technical ingredient to sidestep this difficulty is a conceptually novel multipartite mean-zero decomposition lemma, together with employing recently introduced complex interpolation techniques for sandwiched Rényi divergences. Moreover, we establish an exponential convergence of the simulation error when the communication costs are within the interior of the capacity region. As the costs approach the boundary of the capacity region moderately quickly, we show that the error still vanishes asymptotically.

Communications in Mathematical PhysicsJan 16, 20257 citations