var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"title\":\"Building Multiple Access Channels with a Single Particle\",\"type\":\"article\",\"year\":\"2022\",\"volume\":\"6\",\"publisher\":\"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften\",\"id\":\"40387c84-bbac-3385-b75c-027eb3b896a8\",\"created\":\"2025-04-12T17:33:24.424Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2025-04-12T18:11:07.691Z\",\"read\":\"true\",\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an Nport interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the Nparty classical MACs that can be built from a single particle, and we show that every quantum particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1 < K ≤ N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a \\\"generalized fingerprinting inequality\\\" as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K = N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.\",\"bibtype\":\"article\",\"author\":\"Zhang, Yujie and Chen, Xinan and Chitambar, Eric\",\"doi\":\"10.22331/Q-2022-02-16-653\",\"journal\":\"Quantum\",\"bibtex\":\"@article{\\n title = {Building Multiple Access Channels with a Single Particle},\\n type = {article},\\n year = {2022},\\n volume = {6},\\n publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},\\n id = {40387c84-bbac-3385-b75c-027eb3b896a8},\\n created = {2025-04-12T17:33:24.424Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2025-04-12T18:11:07.691Z},\\n read = {true},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an Nport interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the Nparty classical MACs that can be built from a single particle, and we show that every quantum particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1 < K ≤ N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a \\\"generalized fingerprinting inequality\\\" as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K = N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.},\\n bibtype = {article},\\n author = {Zhang, Yujie and Chen, Xinan and Chitambar, Eric},\\n doi = {10.22331/Q-2022-02-16-653},\\n journal = {Quantum}\\n}\",\"author_short\":[\"Zhang,  Y.\",\"Chen,  X.\",\"Chitambar,  E.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/08210d90-275e-4e81-4674-ddc7ae3cd20a/Chitambar_2022_Building_Multiple_Access_Channels_with_a_Sing.pdf.pdf\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"},{\"title\":\"The Communication Value of a Quantum Channel\",\"type\":\"article\",\"year\":\"2023\",\"keywords\":\"Quantum information science,quantum channels,quantum entanglement\",\"pages\":\"1660-1679\",\"volume\":\"69\",\"month\":\"3\",\"publisher\":\"Institute of Electrical and Electronics Engineers Inc.\",\"day\":\"1\",\"id\":\"310e8db6-d5a9-3322-bbc0-9be25cbeac25\",\"created\":\"2025-04-12T17:33:34.791Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2025-04-12T17:37:10.316Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"There are various ways to quantify the communication capabilities of a quantum channel. In this work we introduce the communication value (cv) of quantum channel, which describes the optimal probability of guessing the channel input from its output. By connecting to prior work on zero-error channel simulation, we show that the cv and its entanglement-assisted variant also offer dual interpretations as the classical communication cost for perfectly simulating different aspects of a channel using non-signaling resources. Our study involves characterizing the communication value as a generalized conditional min-entropy over the cone of separable operators. Using this characterization, we evaluate the cv for all qubit channels and higher-dimensional channels with certain symmetries. We find that the any entanglement-breaking channel has multiplicative cv when used in parallel with any other channel; the same is shown to hold for Pauli channels and partially depolarizing channels. In contrast, the cv is found to be non-multiplicative for a subset of the well-known Werner-Holevo channels. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).\",\"bibtype\":\"article\",\"author\":\"Chitambar, Eric and George, Ian and Doolittle, Brian and Junge, Marius\",\"doi\":\"10.1109/TIT.2022.3218540\",\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"3\",\"bibtex\":\"@article{\\n title = {The Communication Value of a Quantum Channel},\\n type = {article},\\n year = {2023},\\n keywords = {Quantum information science,quantum channels,quantum entanglement},\\n pages = {1660-1679},\\n volume = {69},\\n month = {3},\\n publisher = {Institute of Electrical and Electronics Engineers Inc.},\\n day = {1},\\n id = {310e8db6-d5a9-3322-bbc0-9be25cbeac25},\\n created = {2025-04-12T17:33:34.791Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2025-04-12T17:37:10.316Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {There are various ways to quantify the communication capabilities of a quantum channel. In this work we introduce the communication value (cv) of quantum channel, which describes the optimal probability of guessing the channel input from its output. By connecting to prior work on zero-error channel simulation, we show that the cv and its entanglement-assisted variant also offer dual interpretations as the classical communication cost for perfectly simulating different aspects of a channel using non-signaling resources. Our study involves characterizing the communication value as a generalized conditional min-entropy over the cone of separable operators. Using this characterization, we evaluate the cv for all qubit channels and higher-dimensional channels with certain symmetries. We find that the any entanglement-breaking channel has multiplicative cv when used in parallel with any other channel; the same is shown to hold for Pauli channels and partially depolarizing channels. In contrast, the cv is found to be non-multiplicative for a subset of the well-known Werner-Holevo channels. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).},\\n bibtype = {article},\\n author = {Chitambar, Eric and George, Ian and Doolittle, Brian and Junge, Marius},\\n doi = {10.1109/TIT.2022.3218540},\\n journal = {IEEE Transactions on Information Theory},\\n number = {3}\\n}\",\"author_short\":[\"Chitambar,  E.\",\"George,  I.\",\"Doolittle,  B.\",\"Junge,  M.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/4ee75966-1617-78b7-6159-b4aa9d8cd7e6/Chitambar_2023_The_Communication_Value_of_a_Quantum_Channel.pdf.pdf\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023\",\"role\":\"author\",\"keyword\":[\"Quantum information science\",\"quantum channels\",\"quantum entanglement\"],\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"},{\"title\":\"On the Duality of Teleportation and Dense Coding\",\"type\":\"article\",\"year\":\"2024\",\"pages\":\"3529-3537\",\"volume\":\"70\",\"websites\":\"https://ieeexplore.ieee.org/document/10315956/\",\"month\":\"5\",\"publisher\":\"Institute of Electrical and Electronics Engineers Inc.\",\"id\":\"57c8a593-4166-303d-b1e9-cda19b598ac7\",\"created\":\"2025-04-12T17:34:36.430Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2025-04-12T17:39:09.759Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.\",\"bibtype\":\"article\",\"author\":\"Chitambar, Eric and Leditzky, Felix\",\"doi\":\"10.1109/TIT.2023.3331821\",\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"5\",\"bibtex\":\"@article{\\n title = {On the Duality of Teleportation and Dense Coding},\\n type = {article},\\n year = {2024},\\n pages = {3529-3537},\\n volume = {70},\\n websites = {https://ieeexplore.ieee.org/document/10315956/},\\n month = {5},\\n publisher = {Institute of Electrical and Electronics Engineers Inc.},\\n id = {57c8a593-4166-303d-b1e9-cda19b598ac7},\\n created = {2025-04-12T17:34:36.430Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2025-04-12T17:39:09.759Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.},\\n bibtype = {article},\\n author = {Chitambar, Eric and Leditzky, Felix},\\n doi = {10.1109/TIT.2023.3331821},\\n journal = {IEEE Transactions on Information Theory},\\n number = {5}\\n}\",\"author_short\":[\"Chitambar,  E.\",\"Leditzky,  F.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03dd6130-0f22-7da7-4cb9-0d94b4fd059a/Chitambar_2024_On_the_Duality_of_Teleportation_and_Dense_C_1.pdf.pdf\",\"Website\":\"https://ieeexplore.ieee.org/document/10315956/\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"chitambar-leditzky-onthedualityofteleportationanddensecoding-2024\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"},{\"title\":\"Certifying the classical simulation cost of a quantum channel\",\"type\":\"article\",\"year\":\"2021\",\"volume\":\"3\",\"month\":\"12\",\"publisher\":\"American Physical Society\",\"day\":\"1\",\"id\":\"32ded485-02b4-3d62-9f3c-a531f368e844\",\"created\":\"2025-04-12T18:12:58.114Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2025-04-12T18:12:59.324Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in d dimensions. The bounds are found to be tight for the special case of the erasure channel.\",\"bibtype\":\"article\",\"author\":\"Doolittle, Brian and Chitambar, Eric\",\"doi\":\"10.1103/PhysRevResearch.3.043073\",\"journal\":\"Physical Review Research\",\"number\":\"4\",\"bibtex\":\"@article{\\n title = {Certifying the classical simulation cost of a quantum channel},\\n type = {article},\\n year = {2021},\\n volume = {3},\\n month = {12},\\n publisher = {American Physical Society},\\n day = {1},\\n id = {32ded485-02b4-3d62-9f3c-a531f368e844},\\n created = {2025-04-12T18:12:58.114Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2025-04-12T18:12:59.324Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in d dimensions. The bounds are found to be tight for the special case of the erasure channel.},\\n bibtype = {article},\\n author = {Doolittle, Brian and Chitambar, Eric},\\n doi = {10.1103/PhysRevResearch.3.043073},\\n journal = {Physical Review Research},\\n number = {4}\\n}\",\"author_short\":[\"Doolittle,  B.\",\"Chitambar,  E.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/7c69caa1-840f-c0a7-4c90-64b671db8296/Doolittle_2021_Certifying_the_classical_simulation_cost_of_a.pdf.pdf\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"},{\"title\":\"Information carried by a single particle in quantum multiple-access channels\",\"type\":\"article\",\"year\":\"2024\",\"volume\":\"109\",\"month\":\"6\",\"publisher\":\"American Physical Society\",\"day\":\"1\",\"id\":\"1e57e60a-3245-3b4a-b633-2716de8ef5f5\",\"created\":\"2025-04-12T18:16:49.740Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2025-04-12T18:16:50.862Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"Nonclassical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how well multiparty information can be transmitted to a single receiver using just one classical or quantum particle. Our approach is based on a multiple-access communication model in which messages can be encoded into a single particle that is coherently distributed across multiple spatial modes. Theoretically, we derive lower bounds on the accessible information in the quantum setting that strictly separate it from the classical scenario. This separation is found whenever there is more than one sender, and also when there is just a single sender who has a shared phase reference with the receiver. When there is only one sender, the separation is impossible without a shared phase reference due to the famous Holevo's bound. Experimentally, we present a proof-of-principle demonstration of such quantum advantage in single-particle communication by implementing a multiport interferometer with messages being encoded along the different trajectories. Specifically, we consider a two-sender communication protocol built by a three-port optical interferometer. In this scenario, the rate sum achievable with a classical particle is upper bounded by one bit, while we experimentally observe a rate sum of 1.0152±0.0034 bits in the quantum setup.\",\"bibtype\":\"article\",\"author\":\"Chen, Xinan and Zhang, Yujie and Winter, Andreas and Lorenz, Virginia O. and Chitambar, Eric\",\"doi\":\"10.1103/PhysRevA.109.062420\",\"journal\":\"Physical Review A\",\"number\":\"6\",\"bibtex\":\"@article{\\n title = {Information carried by a single particle in quantum multiple-access channels},\\n type = {article},\\n year = {2024},\\n volume = {109},\\n month = {6},\\n publisher = {American Physical Society},\\n day = {1},\\n id = {1e57e60a-3245-3b4a-b633-2716de8ef5f5},\\n created = {2025-04-12T18:16:49.740Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2025-04-12T18:16:50.862Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {Nonclassical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how well multiparty information can be transmitted to a single receiver using just one classical or quantum particle. Our approach is based on a multiple-access communication model in which messages can be encoded into a single particle that is coherently distributed across multiple spatial modes. Theoretically, we derive lower bounds on the accessible information in the quantum setting that strictly separate it from the classical scenario. This separation is found whenever there is more than one sender, and also when there is just a single sender who has a shared phase reference with the receiver. When there is only one sender, the separation is impossible without a shared phase reference due to the famous Holevo's bound. Experimentally, we present a proof-of-principle demonstration of such quantum advantage in single-particle communication by implementing a multiport interferometer with messages being encoded along the different trajectories. Specifically, we consider a two-sender communication protocol built by a three-port optical interferometer. In this scenario, the rate sum achievable with a classical particle is upper bounded by one bit, while we experimentally observe a rate sum of 1.0152±0.0034 bits in the quantum setup.},\\n bibtype = {article},\\n author = {Chen, Xinan and Zhang, Yujie and Winter, Andreas and Lorenz, Virginia O. and Chitambar, Eric},\\n doi = {10.1103/PhysRevA.109.062420},\\n journal = {Physical Review A},\\n number = {6}\\n}\",\"author_short\":[\"Chen,  X.\",\"Zhang,  Y.\",\"Winter,  A.\",\"Lorenz,  V., O.\",\"Chitambar,  E.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/723b9bc9-2565-2039-29c7-48f94d4bfb4a/Chitambar_2024_Information_carried_by_a_single_particle_in_q.pdf.pdf\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"},{\"title\":\"Bounds on Instantaneous Nonlocal Quantum Computation\",\"type\":\"article\",\"year\":\"2020\",\"keywords\":\"Quantum entanglement,quantum computing,teleportation\",\"volume\":\"66\",\"id\":\"4b98f2fe-0dd1-3232-b018-f4fb720aa631\",\"created\":\"2025-04-13T16:50:14.501Z\",\"file_attached\":false,\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2025-04-13T16:50:14.501Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"© 1963-2012 IEEE. Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with $\\\\epsilon $ -error using $O(\\\\log (1/\\\\epsilon))$ entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as $O(1/\\\\epsilon)$. We also consider the family of binary controlled gates on dimensions $d_A\\\\otimes d_B$. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of $\\\\log d_B$ ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when $d_A=2$. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.\",\"bibtype\":\"article\",\"author\":\"Gonzales, A. and Chitambar, E.\",\"doi\":\"10.1109/TIT.2019.2950190\",\"journal\":\"IEEE Transactions on Information Theory\",\"number\":\"5\",\"bibtex\":\"@article{\\n title = {Bounds on Instantaneous Nonlocal Quantum Computation},\\n type = {article},\\n year = {2020},\\n keywords = {Quantum entanglement,quantum computing,teleportation},\\n volume = {66},\\n id = {4b98f2fe-0dd1-3232-b018-f4fb720aa631},\\n created = {2025-04-13T16:50:14.501Z},\\n file_attached = {false},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2025-04-13T16:50:14.501Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {© 1963-2012 IEEE. Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with $\\\\epsilon $ -error using $O(\\\\log (1/\\\\epsilon))$ entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as $O(1/\\\\epsilon)$. We also consider the family of binary controlled gates on dimensions $d_A\\\\otimes d_B$. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of $\\\\log d_B$ ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when $d_A=2$. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.},\\n bibtype = {article},\\n author = {Gonzales, A. and Chitambar, E.},\\n doi = {10.1109/TIT.2019.2950190},\\n journal = {IEEE Transactions on Information Theory},\\n number = {5}\\n}\",\"author_short\":[\"Gonzales,  A.\",\"Chitambar,  E.\"],\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"gonzales-chitambar-boundsoninstantaneousnonlocalquantumcomputation-2020\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Quantum entanglement\",\"quantum computing\",\"teleportation\"],\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":10,\"html\":\"\"},{\"title\":\"Asynchronous quantum computation through port-based teleportation\",\"type\":\"article\",\"year\":\"2026\",\"pages\":\"034512\",\"volume\":\"28\",\"websites\":\"https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7\",\"month\":\"3\",\"day\":\"1\",\"id\":\"7cbc77b6-79d3-388c-8c89-084a5e313975\",\"created\":\"2026-05-06T15:36:51.716Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2026-05-06T15:36:52.413Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"<p>In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.</p>\",\"bibtype\":\"article\",\"author\":\"Kim, Chloe and Chitambar, Eric and Leditzky, Felix\",\"doi\":\"10.1088/1367-2630/ae49b7\",\"journal\":\"New Journal of Physics\",\"number\":\"3\",\"bibtex\":\"@article{\\n title = {Asynchronous quantum computation through port-based teleportation},\\n type = {article},\\n year = {2026},\\n pages = {034512},\\n volume = {28},\\n websites = {https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7},\\n month = {3},\\n day = {1},\\n id = {7cbc77b6-79d3-388c-8c89-084a5e313975},\\n created = {2026-05-06T15:36:51.716Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2026-05-06T15:36:52.413Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {<p>In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.</p>},\\n bibtype = {article},\\n author = {Kim, Chloe and Chitambar, Eric and Leditzky, Felix},\\n doi = {10.1088/1367-2630/ae49b7},\\n journal = {New Journal of Physics},\\n number = {3}\\n}\",\"author_short\":[\"Kim,  C.\",\"Chitambar,  E.\",\"Leditzky,  F.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/70458275-18f3-594b-5eac-908369aa4c42/Kim_2026_Asynchronous_quantum_computation_through_port_based.pdf.pdf\",\"Website\":\"https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"},{\"title\":\"Random Distillation Protocols in Long Baseline Telescopy\",\"type\":\"article\",\"year\":\"2025\",\"volume\":\"134\",\"month\":\"5\",\"publisher\":\"American Physical Society\",\"day\":\"2\",\"id\":\"60c2459c-8766-30d3-af14-28f129e4fc30\",\"created\":\"2026-05-06T15:37:07.381Z\",\"file_attached\":\"true\",\"profile_id\":\"889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"group_id\":\"deeee398-84e9-3f66-b6a1-20d512cc898d\",\"last_modified\":\"2026-05-06T15:37:09.055Z\",\"read\":false,\"starred\":false,\"authored\":false,\"confirmed\":false,\"hidden\":false,\"private_publication\":false,\"abstract\":\"In quantum-enhanced astronomical imaging, multiple distant apertures work together by utilizing quantum resources distributed from a central server. Our findings suggest that preprocessing the stellar light received by all telescopes can improve imaging performance without increasing resource consumption. The preprocessing leverages weak quantum measurements and modifies random-party entanglement distillation protocols from quantum information science. Intuitively, this approach allows us to collapse the stellar light that is originally coherent between all telescopes to one pair of telescopes with probability arbitrarily close to one. The central server can then distribute entanglement solely to the pair of telescopes receiving a photon, thereby enhancing the efficiency of resource utilization. We discuss two types of resources that benefit from this preprocessing: shared entanglement and a shared reference frame.\",\"bibtype\":\"article\",\"author\":\"Wang, Yunkai and Chitambar, Eric\",\"doi\":\"10.1103/PhysRevLett.134.170801\",\"journal\":\"Physical Review Letters\",\"number\":\"17\",\"bibtex\":\"@article{\\n title = {Random Distillation Protocols in Long Baseline Telescopy},\\n type = {article},\\n year = {2025},\\n volume = {134},\\n month = {5},\\n publisher = {American Physical Society},\\n day = {2},\\n id = {60c2459c-8766-30d3-af14-28f129e4fc30},\\n created = {2026-05-06T15:37:07.381Z},\\n file_attached = {true},\\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\\n last_modified = {2026-05-06T15:37:09.055Z},\\n read = {false},\\n starred = {false},\\n authored = {false},\\n confirmed = {false},\\n hidden = {false},\\n private_publication = {false},\\n abstract = {In quantum-enhanced astronomical imaging, multiple distant apertures work together by utilizing quantum resources distributed from a central server. Our findings suggest that preprocessing the stellar light received by all telescopes can improve imaging performance without increasing resource consumption. The preprocessing leverages weak quantum measurements and modifies random-party entanglement distillation protocols from quantum information science. Intuitively, this approach allows us to collapse the stellar light that is originally coherent between all telescopes to one pair of telescopes with probability arbitrarily close to one. The central server can then distribute entanglement solely to the pair of telescopes receiving a photon, thereby enhancing the efficiency of resource utilization. We discuss two types of resources that benefit from this preprocessing: shared entanglement and a shared reference frame.},\\n bibtype = {article},\\n author = {Wang, Yunkai and Chitambar, Eric},\\n doi = {10.1103/PhysRevLett.134.170801},\\n journal = {Physical Review Letters},\\n number = {17}\\n}\",\"author_short\":[\"Wang,  Y.\",\"Chitambar,  E.\"],\"urls\":{\"Paper\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03b6b4b0-2c7d-c0f7-50ec-211f794a6aba/Wang_2025_Random_Distillation_Protocols_in_Long_Baseline_T_1.pdf.pdf\"},\"biburl\":\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0\",\"bibbaseid\":\"wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025\",\"role\":\"author\",\"metadata\":{\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\"downloads\":0,\"html\":\"\"}],\n      metadata: {\"owner\":\"chitambar,  e\",\"authorlinks\":{\"chitambar,  e\":\"https://quantum-entangled.ece.illinois.edu/research/\"}},\n      ownerID: \"fpzX7Ay9mHjqqMSw8\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         aria-label=\"group-by menu toggle\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         aria-label=\"other options menu toggle\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"all.bib\" href=\"data:text/bibtex;base64,@article{
 title = {Building Multiple Access Channels with a Single Particle},
 type = {article},
 year = {2022},
 volume = {6},
 publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
 id = {40387c84-bbac-3385-b75c-027eb3b896a8},
 created = {2025-04-12T17:33:24.424Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2025-04-12T18:11:07.691Z},
 read = {true},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an Nport interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the Nparty classical MACs that can be built from a single particle, and we show that every quantum particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1 < K ≤ N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a "generalized fingerprinting inequality" as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K = N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.},
 bibtype = {article},
 author = {Zhang, Yujie and Chen, Xinan and Chitambar, Eric},
 doi = {10.22331/Q-2022-02-16-653},
 journal = {Quantum}
}

@article{
 title = {The Communication Value of a Quantum Channel},
 type = {article},
 year = {2023},
 keywords = {Quantum information science,quantum channels,quantum entanglement},
 pages = {1660-1679},
 volume = {69},
 month = {3},
 publisher = {Institute of Electrical and Electronics Engineers Inc.},
 day = {1},
 id = {310e8db6-d5a9-3322-bbc0-9be25cbeac25},
 created = {2025-04-12T17:33:34.791Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2025-04-12T17:37:10.316Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {There are various ways to quantify the communication capabilities of a quantum channel. In this work we introduce the communication value (cv) of quantum channel, which describes the optimal probability of guessing the channel input from its output. By connecting to prior work on zero-error channel simulation, we show that the cv and its entanglement-assisted variant also offer dual interpretations as the classical communication cost for perfectly simulating different aspects of a channel using non-signaling resources. Our study involves characterizing the communication value as a generalized conditional min-entropy over the cone of separable operators. Using this characterization, we evaluate the cv for all qubit channels and higher-dimensional channels with certain symmetries. We find that the any entanglement-breaking channel has multiplicative cv when used in parallel with any other channel; the same is shown to hold for Pauli channels and partially depolarizing channels. In contrast, the cv is found to be non-multiplicative for a subset of the well-known Werner-Holevo channels. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).},
 bibtype = {article},
 author = {Chitambar, Eric and George, Ian and Doolittle, Brian and Junge, Marius},
 doi = {10.1109/TIT.2022.3218540},
 journal = {IEEE Transactions on Information Theory},
 number = {3}
}

@article{
 title = {On the Duality of Teleportation and Dense Coding},
 type = {article},
 year = {2024},
 pages = {3529-3537},
 volume = {70},
 websites = {https://ieeexplore.ieee.org/document/10315956/},
 month = {5},
 publisher = {Institute of Electrical and Electronics Engineers Inc.},
 id = {57c8a593-4166-303d-b1e9-cda19b598ac7},
 created = {2025-04-12T17:34:36.430Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2025-04-12T17:39:09.759Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.},
 bibtype = {article},
 author = {Chitambar, Eric and Leditzky, Felix},
 doi = {10.1109/TIT.2023.3331821},
 journal = {IEEE Transactions on Information Theory},
 number = {5}
}

@article{
 title = {Certifying the classical simulation cost of a quantum channel},
 type = {article},
 year = {2021},
 volume = {3},
 month = {12},
 publisher = {American Physical Society},
 day = {1},
 id = {32ded485-02b4-3d62-9f3c-a531f368e844},
 created = {2025-04-12T18:12:58.114Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2025-04-12T18:12:59.324Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in d dimensions. The bounds are found to be tight for the special case of the erasure channel.},
 bibtype = {article},
 author = {Doolittle, Brian and Chitambar, Eric},
 doi = {10.1103/PhysRevResearch.3.043073},
 journal = {Physical Review Research},
 number = {4}
}

@article{
 title = {Information carried by a single particle in quantum multiple-access channels},
 type = {article},
 year = {2024},
 volume = {109},
 month = {6},
 publisher = {American Physical Society},
 day = {1},
 id = {1e57e60a-3245-3b4a-b633-2716de8ef5f5},
 created = {2025-04-12T18:16:49.740Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2025-04-12T18:16:50.862Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {Nonclassical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how well multiparty information can be transmitted to a single receiver using just one classical or quantum particle. Our approach is based on a multiple-access communication model in which messages can be encoded into a single particle that is coherently distributed across multiple spatial modes. Theoretically, we derive lower bounds on the accessible information in the quantum setting that strictly separate it from the classical scenario. This separation is found whenever there is more than one sender, and also when there is just a single sender who has a shared phase reference with the receiver. When there is only one sender, the separation is impossible without a shared phase reference due to the famous Holevo's bound. Experimentally, we present a proof-of-principle demonstration of such quantum advantage in single-particle communication by implementing a multiport interferometer with messages being encoded along the different trajectories. Specifically, we consider a two-sender communication protocol built by a three-port optical interferometer. In this scenario, the rate sum achievable with a classical particle is upper bounded by one bit, while we experimentally observe a rate sum of 1.0152±0.0034 bits in the quantum setup.},
 bibtype = {article},
 author = {Chen, Xinan and Zhang, Yujie and Winter, Andreas and Lorenz, Virginia O. and Chitambar, Eric},
 doi = {10.1103/PhysRevA.109.062420},
 journal = {Physical Review A},
 number = {6}
}

@article{
 title = {Bounds on Instantaneous Nonlocal Quantum Computation},
 type = {article},
 year = {2020},
 keywords = {Quantum entanglement,quantum computing,teleportation},
 volume = {66},
 id = {4b98f2fe-0dd1-3232-b018-f4fb720aa631},
 created = {2025-04-13T16:50:14.501Z},
 file_attached = {false},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2025-04-13T16:50:14.501Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {© 1963-2012 IEEE. Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with $\epsilon $ -error using $O(\log (1/\epsilon))$ entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as $O(1/\epsilon)$. We also consider the family of binary controlled gates on dimensions $d_A\otimes d_B$. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of $\log d_B$ ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when $d_A=2$. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.},
 bibtype = {article},
 author = {Gonzales, A. and Chitambar, E.},
 doi = {10.1109/TIT.2019.2950190},
 journal = {IEEE Transactions on Information Theory},
 number = {5}
}

@article{
 title = {Asynchronous quantum computation through port-based teleportation},
 type = {article},
 year = {2026},
 pages = {034512},
 volume = {28},
 websites = {https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7},
 month = {3},
 day = {1},
 id = {7cbc77b6-79d3-388c-8c89-084a5e313975},
 created = {2026-05-06T15:36:51.716Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2026-05-06T15:36:52.413Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {<p>In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.</p>},
 bibtype = {article},
 author = {Kim, Chloe and Chitambar, Eric and Leditzky, Felix},
 doi = {10.1088/1367-2630/ae49b7},
 journal = {New Journal of Physics},
 number = {3}
}

@article{
 title = {Random Distillation Protocols in Long Baseline Telescopy},
 type = {article},
 year = {2025},
 volume = {134},
 month = {5},
 publisher = {American Physical Society},
 day = {2},
 id = {60c2459c-8766-30d3-af14-28f129e4fc30},
 created = {2026-05-06T15:37:07.381Z},
 file_attached = {true},
 profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},
 group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},
 last_modified = {2026-05-06T15:37:09.055Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {In quantum-enhanced astronomical imaging, multiple distant apertures work together by utilizing quantum resources distributed from a central server. Our findings suggest that preprocessing the stellar light received by all telescopes can improve imaging performance without increasing resource consumption. The preprocessing leverages weak quantum measurements and modifies random-party entanglement distillation protocols from quantum information science. Intuitively, this approach allows us to collapse the stellar light that is originally coherent between all telescopes to one pair of telescopes with probability arbitrarily close to one. The central server can then distribute entanglement solely to the pair of telescopes receiving a photon, thereby enhancing the efficiency of resource utilization. We discuss two types of resources that benefit from this preprocessing: shared entanglement and a shared reference frame.},
 bibtype = {article},
 author = {Wang, Yunkai and Chitambar, Eric},
 doi = {10.1103/PhysRevLett.134.170801},
 journal = {Physical Review Letters},
 number = {17}
}\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/group/deeee398-84e9-3f66-b6a1-20d512cc898d?jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/group/deeee398-84e9-3f66-b6a1-20d512cc898d?jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/group/deeee398-84e9-3f66-b6a1-20d512cc898d?jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2026\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2026')\"\n      onkeypress=\"toggleGroup('group_2026')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2026</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/70458275-18f3-594b-5eac-908369aa4c42/Kim_2026_Asynchronous_quantum_computation_through_port_based.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/70458275-18f3-594b-5eac-908369aa4c42/Kim_2026_Asynchronous_quantum_computation_through_port_based.pdf.pdf', event);\">\n    Asynchronous quantum computation through port-based teleportation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kim,  C.; <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>;  and Leditzky,  F.\n</span>\n\n  \n\n</span>\n\n  <i>New Journal of Physics</i>, 28(3): 034512. 3 2026.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/70458275-18f3-594b-5eac-908369aa4c42/Kim_2026_Asynchronous_quantum_computation_through_port_based.pdf.pdf\"\n     onclick=\"log_download('kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/70458275-18f3-594b-5eac-908369aa4c42/Kim_2026_Asynchronous_quantum_computation_through_port_based.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Asynchronous quantum computation through port-based teleportation [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7\"\n     onclick=\"log_download('kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026', 'https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asynchronous quantum computation through port-based teleportation [link]\"\n       title=\"Website\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1088/1367-2630/ae49b7\"\n     onclick=\"log_download('kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026', 'http://doi.org/10.1088/1367-2630/ae49b7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kim-chitambar-leditzky-asynchronousquantumcomputationthroughportbasedteleportation-2026')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Asynchronous quantum computation through port-based teleportation},\n type = {article},\n year = {2026},\n pages = {034512},\n volume = {28},\n websites = {https://iopscience.iop.org/article/10.1088/1367-2630/ae49b7},\n month = {3},\n day = {1},\n id = {7cbc77b6-79d3-388c-8c89-084a5e313975},\n created = {2026-05-06T15:36:51.716Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2026-05-06T15:36:52.413Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {&lt;p&gt;In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.&lt;/p&gt;},\n bibtype = {article},\n author = {Kim, Chloe and Chitambar, Eric and Leditzky, Felix},\n doi = {10.1088/1367-2630/ae49b7},\n journal = {New Journal of Physics},\n number = {3}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  <p>In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.</p>\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2025\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2025')\"\n      onkeypress=\"toggleGroup('group_2025')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2025</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03b6b4b0-2c7d-c0f7-50ec-211f794a6aba/Wang_2025_Random_Distillation_Protocols_in_Long_Baseline_T_1.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03b6b4b0-2c7d-c0f7-50ec-211f794a6aba/Wang_2025_Random_Distillation_Protocols_in_Long_Baseline_T_1.pdf.pdf', event);\">\n    Random Distillation Protocols in Long Baseline Telescopy.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Wang,  Y.;  and <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Physical Review Letters</i>, 134(17). 5 2025.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03b6b4b0-2c7d-c0f7-50ec-211f794a6aba/Wang_2025_Random_Distillation_Protocols_in_Long_Baseline_T_1.pdf.pdf\"\n     onclick=\"log_download('wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03b6b4b0-2c7d-c0f7-50ec-211f794a6aba/Wang_2025_Random_Distillation_Protocols_in_Long_Baseline_T_1.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Random Distillation Protocols in Long Baseline Telescopy [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1103/PhysRevLett.134.170801\"\n     onclick=\"log_download('wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025', 'http://doi.org/10.1103/PhysRevLett.134.170801', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wang-chitambar-randomdistillationprotocolsinlongbaselinetelescopy-2025')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Random Distillation Protocols in Long Baseline Telescopy},\n type = {article},\n year = {2025},\n volume = {134},\n month = {5},\n publisher = {American Physical Society},\n day = {2},\n id = {60c2459c-8766-30d3-af14-28f129e4fc30},\n created = {2026-05-06T15:37:07.381Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2026-05-06T15:37:09.055Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {In quantum-enhanced astronomical imaging, multiple distant apertures work together by utilizing quantum resources distributed from a central server. Our findings suggest that preprocessing the stellar light received by all telescopes can improve imaging performance without increasing resource consumption. The preprocessing leverages weak quantum measurements and modifies random-party entanglement distillation protocols from quantum information science. Intuitively, this approach allows us to collapse the stellar light that is originally coherent between all telescopes to one pair of telescopes with probability arbitrarily close to one. The central server can then distribute entanglement solely to the pair of telescopes receiving a photon, thereby enhancing the efficiency of resource utilization. We discuss two types of resources that benefit from this preprocessing: shared entanglement and a shared reference frame.},\n bibtype = {article},\n author = {Wang, Yunkai and Chitambar, Eric},\n doi = {10.1103/PhysRevLett.134.170801},\n journal = {Physical Review Letters},\n number = {17}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In quantum-enhanced astronomical imaging, multiple distant apertures work together by utilizing quantum resources distributed from a central server. Our findings suggest that preprocessing the stellar light received by all telescopes can improve imaging performance without increasing resource consumption. The preprocessing leverages weak quantum measurements and modifies random-party entanglement distillation protocols from quantum information science. Intuitively, this approach allows us to collapse the stellar light that is originally coherent between all telescopes to one pair of telescopes with probability arbitrarily close to one. The central server can then distribute entanglement solely to the pair of telescopes receiving a photon, thereby enhancing the efficiency of resource utilization. We discuss two types of resources that benefit from this preprocessing: shared entanglement and a shared reference frame.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"chitambar-leditzky-onthedualityofteleportationanddensecoding-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03dd6130-0f22-7da7-4cb9-0d94b4fd059a/Chitambar_2024_On_the_Duality_of_Teleportation_and_Dense_C_1.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chitambar-leditzky-onthedualityofteleportationanddensecoding-2024', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03dd6130-0f22-7da7-4cb9-0d94b4fd059a/Chitambar_2024_On_the_Duality_of_Teleportation_and_Dense_C_1.pdf.pdf', event);\">\n    On the Duality of Teleportation and Dense Coding.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>;  and Leditzky,  F.\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 70(5): 3529-3537. 5 2024.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03dd6130-0f22-7da7-4cb9-0d94b4fd059a/Chitambar_2024_On_the_Duality_of_Teleportation_and_Dense_C_1.pdf.pdf\"\n     onclick=\"log_download('chitambar-leditzky-onthedualityofteleportationanddensecoding-2024', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/03dd6130-0f22-7da7-4cb9-0d94b4fd059a/Chitambar_2024_On_the_Duality_of_Teleportation_and_Dense_C_1.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"On the Duality of Teleportation and Dense Coding [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://ieeexplore.ieee.org/document/10315956/\"\n     onclick=\"log_download('chitambar-leditzky-onthedualityofteleportationanddensecoding-2024', 'https://ieeexplore.ieee.org/document/10315956/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"On the Duality of Teleportation and Dense Coding [link]\"\n       title=\"Website\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Website</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2023.3331821\"\n     onclick=\"log_download('chitambar-leditzky-onthedualityofteleportationanddensecoding-2024', 'http://doi.org/10.1109/TIT.2023.3331821', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chitambar-leditzky-onthedualityofteleportationanddensecoding-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chitambar-leditzky-onthedualityofteleportationanddensecoding-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {On the Duality of Teleportation and Dense Coding},\n type = {article},\n year = {2024},\n pages = {3529-3537},\n volume = {70},\n websites = {https://ieeexplore.ieee.org/document/10315956/},\n month = {5},\n publisher = {Institute of Electrical and Electronics Engineers Inc.},\n id = {57c8a593-4166-303d-b1e9-cda19b598ac7},\n created = {2025-04-12T17:34:36.430Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2025-04-12T17:39:09.759Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.},\n bibtype = {article},\n author = {Chitambar, Eric and Leditzky, Felix},\n doi = {10.1109/TIT.2023.3331821},\n journal = {IEEE Transactions on Information Theory},\n number = {5}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/723b9bc9-2565-2039-29c7-48f94d4bfb4a/Chitambar_2024_Information_carried_by_a_single_particle_in_q.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/723b9bc9-2565-2039-29c7-48f94d4bfb4a/Chitambar_2024_Information_carried_by_a_single_particle_in_q.pdf.pdf', event);\">\n    Information carried by a single particle in quantum multiple-access channels.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chen,  X.; Zhang,  Y.; Winter,  A.; Lorenz,  V., O.;  and <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Physical Review A</i>, 109(6). 6 2024.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/723b9bc9-2565-2039-29c7-48f94d4bfb4a/Chitambar_2024_Information_carried_by_a_single_particle_in_q.pdf.pdf\"\n     onclick=\"log_download('chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/723b9bc9-2565-2039-29c7-48f94d4bfb4a/Chitambar_2024_Information_carried_by_a_single_particle_in_q.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Information carried by a single particle in quantum multiple-access channels [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1103/PhysRevA.109.062420\"\n     onclick=\"log_download('chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024', 'http://doi.org/10.1103/PhysRevA.109.062420', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chen-zhang-winter-lorenz-chitambar-informationcarriedbyasingleparticleinquantummultipleaccesschannels-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Information carried by a single particle in quantum multiple-access channels},\n type = {article},\n year = {2024},\n volume = {109},\n month = {6},\n publisher = {American Physical Society},\n day = {1},\n id = {1e57e60a-3245-3b4a-b633-2716de8ef5f5},\n created = {2025-04-12T18:16:49.740Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2025-04-12T18:16:50.862Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {Nonclassical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how well multiparty information can be transmitted to a single receiver using just one classical or quantum particle. Our approach is based on a multiple-access communication model in which messages can be encoded into a single particle that is coherently distributed across multiple spatial modes. Theoretically, we derive lower bounds on the accessible information in the quantum setting that strictly separate it from the classical scenario. This separation is found whenever there is more than one sender, and also when there is just a single sender who has a shared phase reference with the receiver. When there is only one sender, the separation is impossible without a shared phase reference due to the famous Holevo&#x27;s bound. Experimentally, we present a proof-of-principle demonstration of such quantum advantage in single-particle communication by implementing a multiport interferometer with messages being encoded along the different trajectories. Specifically, we consider a two-sender communication protocol built by a three-port optical interferometer. In this scenario, the rate sum achievable with a classical particle is upper bounded by one bit, while we experimentally observe a rate sum of 1.0152±0.0034 bits in the quantum setup.},\n bibtype = {article},\n author = {Chen, Xinan and Zhang, Yujie and Winter, Andreas and Lorenz, Virginia O. and Chitambar, Eric},\n doi = {10.1103/PhysRevA.109.062420},\n journal = {Physical Review A},\n number = {6}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Nonclassical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how well multiparty information can be transmitted to a single receiver using just one classical or quantum particle. Our approach is based on a multiple-access communication model in which messages can be encoded into a single particle that is coherently distributed across multiple spatial modes. Theoretically, we derive lower bounds on the accessible information in the quantum setting that strictly separate it from the classical scenario. This separation is found whenever there is more than one sender, and also when there is just a single sender who has a shared phase reference with the receiver. When there is only one sender, the separation is impossible without a shared phase reference due to the famous Holevo's bound. Experimentally, we present a proof-of-principle demonstration of such quantum advantage in single-particle communication by implementing a multiport interferometer with messages being encoded along the different trajectories. Specifically, we consider a two-sender communication protocol built by a three-port optical interferometer. In this scenario, the rate sum achievable with a classical particle is upper bounded by one bit, while we experimentally observe a rate sum of 1.0152±0.0034 bits in the quantum setup.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/4ee75966-1617-78b7-6159-b4aa9d8cd7e6/Chitambar_2023_The_Communication_Value_of_a_Quantum_Channel.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/4ee75966-1617-78b7-6159-b4aa9d8cd7e6/Chitambar_2023_The_Communication_Value_of_a_Quantum_Channel.pdf.pdf', event);\">\n    The Communication Value of a Quantum Channel.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>; George,  I.; Doolittle,  B.;  and Junge,  M.\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 69(3): 1660-1679. 3 2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/4ee75966-1617-78b7-6159-b4aa9d8cd7e6/Chitambar_2023_The_Communication_Value_of_a_Quantum_Channel.pdf.pdf\"\n     onclick=\"log_download('chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/4ee75966-1617-78b7-6159-b4aa9d8cd7e6/Chitambar_2023_The_Communication_Value_of_a_Quantum_Channel.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Communication Value of a Quantum Channel [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2022.3218540\"\n     onclick=\"log_download('chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023', 'http://doi.org/10.1109/TIT.2022.3218540', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chitambar-george-doolittle-junge-thecommunicationvalueofaquantumchannel-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {The Communication Value of a Quantum Channel},\n type = {article},\n year = {2023},\n keywords = {Quantum information science,quantum channels,quantum entanglement},\n pages = {1660-1679},\n volume = {69},\n month = {3},\n publisher = {Institute of Electrical and Electronics Engineers Inc.},\n day = {1},\n id = {310e8db6-d5a9-3322-bbc0-9be25cbeac25},\n created = {2025-04-12T17:33:34.791Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2025-04-12T17:37:10.316Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {There are various ways to quantify the communication capabilities of a quantum channel. In this work we introduce the communication value (cv) of quantum channel, which describes the optimal probability of guessing the channel input from its output. By connecting to prior work on zero-error channel simulation, we show that the cv and its entanglement-assisted variant also offer dual interpretations as the classical communication cost for perfectly simulating different aspects of a channel using non-signaling resources. Our study involves characterizing the communication value as a generalized conditional min-entropy over the cone of separable operators. Using this characterization, we evaluate the cv for all qubit channels and higher-dimensional channels with certain symmetries. We find that the any entanglement-breaking channel has multiplicative cv when used in parallel with any other channel; the same is shown to hold for Pauli channels and partially depolarizing channels. In contrast, the cv is found to be non-multiplicative for a subset of the well-known Werner-Holevo channels. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).},\n bibtype = {article},\n author = {Chitambar, Eric and George, Ian and Doolittle, Brian and Junge, Marius},\n doi = {10.1109/TIT.2022.3218540},\n journal = {IEEE Transactions on Information Theory},\n number = {3}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  There are various ways to quantify the communication capabilities of a quantum channel. In this work we introduce the communication value (cv) of quantum channel, which describes the optimal probability of guessing the channel input from its output. By connecting to prior work on zero-error channel simulation, we show that the cv and its entanglement-assisted variant also offer dual interpretations as the classical communication cost for perfectly simulating different aspects of a channel using non-signaling resources. Our study involves characterizing the communication value as a generalized conditional min-entropy over the cone of separable operators. Using this characterization, we evaluate the cv for all qubit channels and higher-dimensional channels with certain symmetries. We find that the any entanglement-breaking channel has multiplicative cv when used in parallel with any other channel; the same is shown to hold for Pauli channels and partially depolarizing channels. In contrast, the cv is found to be non-multiplicative for a subset of the well-known Werner-Holevo channels. A final component of this work investigates relaxations of the channel cv to other cones such as the set of operators having a positive partial transpose (PPT).\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/08210d90-275e-4e81-4674-ddc7ae3cd20a/Chitambar_2022_Building_Multiple_Access_Channels_with_a_Sing.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/08210d90-275e-4e81-4674-ddc7ae3cd20a/Chitambar_2022_Building_Multiple_Access_Channels_with_a_Sing.pdf.pdf', event);\">\n    Building Multiple Access Channels with a Single Particle.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Zhang,  Y.; Chen,  X.;  and <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Quantum</i>, 6.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/08210d90-275e-4e81-4674-ddc7ae3cd20a/Chitambar_2022_Building_Multiple_Access_Channels_with_a_Sing.pdf.pdf\"\n     onclick=\"log_download('zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/08210d90-275e-4e81-4674-ddc7ae3cd20a/Chitambar_2022_Building_Multiple_Access_Channels_with_a_Sing.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Building Multiple Access Channels with a Single Particle [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.22331/Q-2022-02-16-653\"\n     onclick=\"log_download('zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022', 'http://doi.org/10.22331/Q-2022-02-16-653', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('zhang-chen-chitambar-buildingmultipleaccesschannelswithasingleparticle-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Building Multiple Access Channels with a Single Particle},\n type = {article},\n year = {2022},\n volume = {6},\n publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},\n id = {40387c84-bbac-3385-b75c-027eb3b896a8},\n created = {2025-04-12T17:33:24.424Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2025-04-12T18:11:07.691Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an Nport interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the Nparty classical MACs that can be built from a single particle, and we show that every quantum particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1 &lt; K ≤ N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a &quot;generalized fingerprinting inequality&quot; as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K = N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.},\n bibtype = {article},\n author = {Zhang, Yujie and Chen, Xinan and Chitambar, Eric},\n doi = {10.22331/Q-2022-02-16-653},\n journal = {Quantum}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an Nport interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the Nparty classical MACs that can be built from a single particle, and we show that every quantum particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1 < K ≤ N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a \"generalized fingerprinting inequality\" as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K = N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/7c69caa1-840f-c0a7-4c90-64b671db8296/Doolittle_2021_Certifying_the_classical_simulation_cost_of_a.pdf.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/7c69caa1-840f-c0a7-4c90-64b671db8296/Doolittle_2021_Certifying_the_classical_simulation_cost_of_a.pdf.pdf', event);\">\n    Certifying the classical simulation cost of a quantum channel.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Doolittle,  B.;  and <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Physical Review Research</i>, 3(4). 12 2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/7c69caa1-840f-c0a7-4c90-64b671db8296/Doolittle_2021_Certifying_the_classical_simulation_cost_of_a.pdf.pdf\"\n     onclick=\"log_download('doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021', 'https://bibbase.org/service/mendeley/889ca0d7-cd8b-3818-bafe-550deb56f3f0/file/7c69caa1-840f-c0a7-4c90-64b671db8296/Doolittle_2021_Certifying_the_classical_simulation_cost_of_a.pdf.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Certifying the classical simulation cost of a quantum channel [pdf]\"\n       title=\"Paper\"\n       style=\"max-height: 1em;\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1103/PhysRevResearch.3.043073\"\n     onclick=\"log_download('doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021', 'http://doi.org/10.1103/PhysRevResearch.3.043073', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('doolittle-chitambar-certifyingtheclassicalsimulationcostofaquantumchannel-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Certifying the classical simulation cost of a quantum channel},\n type = {article},\n year = {2021},\n volume = {3},\n month = {12},\n publisher = {American Physical Society},\n day = {1},\n id = {32ded485-02b4-3d62-9f3c-a531f368e844},\n created = {2025-04-12T18:12:58.114Z},\n file_attached = {true},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2025-04-12T18:12:59.324Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel&#x27;s input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in d dimensions. The bounds are found to be tight for the special case of the erasure channel.},\n bibtype = {article},\n author = {Doolittle, Brian and Chitambar, Eric},\n doi = {10.1103/PhysRevResearch.3.043073},\n journal = {Physical Review Research},\n number = {4}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to determine when a noisy classical channel can be simulated using an amount of communication strictly less than either its input or its output alphabet size. In addition, a family of eight signaling dimension witnesses is presented that completely characterize when any four-outcome measurement channel, such as a Bell measurement, can be simulated using one communication bit and shared randomness. Finally, we bound the signaling dimension for all partial replacer channels in d dimensions. The bounds are found to be tight for the special case of the erasure channel.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gonzales-chitambar-boundsoninstantaneousnonlocalquantumcomputation-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Bounds on Instantaneous Nonlocal Quantum Computation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gonzales,  A.;  and <a class=\"bibbase author link\" href=\"https://quantum-entangled.ece.illinois.edu/research/\">Chitambar,  E.</a>\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 66(5).  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TIT.2019.2950190\"\n     onclick=\"log_download('gonzales-chitambar-boundsoninstantaneousnonlocalquantumcomputation-2020', 'http://doi.org/10.1109/TIT.2019.2950190', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gonzales-chitambar-boundsoninstantaneousnonlocalquantumcomputation-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gonzales-chitambar-boundsoninstantaneousnonlocalquantumcomputation-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{\n title = {Bounds on Instantaneous Nonlocal Quantum Computation},\n type = {article},\n year = {2020},\n keywords = {Quantum entanglement,quantum computing,teleportation},\n volume = {66},\n id = {4b98f2fe-0dd1-3232-b018-f4fb720aa631},\n created = {2025-04-13T16:50:14.501Z},\n file_attached = {false},\n profile_id = {889ca0d7-cd8b-3818-bafe-550deb56f3f0},\n group_id = {deeee398-84e9-3f66-b6a1-20d512cc898d},\n last_modified = {2025-04-13T16:50:14.501Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {© 1963-2012 IEEE. Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with $\\epsilon $ -error using $O(\\log (1/\\epsilon))$ entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as $O(1/\\epsilon)$. We also consider the family of binary controlled gates on dimensions $d_A\\otimes d_B$. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of $\\log d_B$ ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when $d_A=2$. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.},\n bibtype = {article},\n author = {Gonzales, A. and Chitambar, E.},\n doi = {10.1109/TIT.2019.2950190},\n journal = {IEEE Transactions on Information Theory},\n number = {5}\n}</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  © 1963-2012 IEEE. Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with $\\epsilon $ -error using $O(\\log (1/\\epsilon))$ entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as $O(1/\\epsilon)$. We also consider the family of binary controlled gates on dimensions $d_A\\otimes d_B$. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of $\\log d_B$ ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when $d_A=2$. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);