A resource theory of asynchronous quantum information processing

• URL: http://arxiv.org/abs/2504.12945v1
• Date: Thu, 17 Apr 2025 13:46:02 GMT
• Title: A resource theory of asynchronous quantum information processing
• Authors: Chloe Kim, Eric Chitambar, Felix Leditzky,
• Abstract summary: In port-based teleportation, local quantum pre-processing can begin before the classical message is received.<n>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.
• Score: 8.780066198140247
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum inputs in the prepare-and-measure scenario and stochastic teleportation [0.0]
  We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity.<n>We formalise this framework, identify its basic properties and provide numerical tools for optimising quantum protocols for generic communication.
  arXiv  Detail & Related papers  (2025-03-31T19:17:32Z)
• Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback [14.314126139226314]
  In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths which grow with the number of entangled qubits.<n>In teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits.
  arXiv  Detail & Related papers  (2024-03-27T17:06:00Z)
• An Operational Framework for Nonclassicality in Quantum Communication Networks [9.312605205492458]
  entanglement and quantum communication offer significant advantages in distributed information processing.<n>We develop an operational framework for realizing these enhancements in resource-constrained quantum networks.<n>In all cases, we find that entanglement-assisted communication, both classical and quantum, leads to nonclassicality.
  arXiv  Detail & Related papers  (2024-03-05T14:07:37Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Port-based entanglement teleportation via noisy resource states [0.0]
  Port-based teleportation (PBT) represents a variation of the standard quantum teleportation. In this study, we focus on PBT protocol when the resource state is disrupted by local Pauli noises.
  arXiv  Detail & Related papers  (2023-09-04T12:02:48Z)
• Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages [60.889483085250355]
  We find an exponential gap in the communication complexities between the presence and absence of prior entanglement. We propose an efficient one-server one-round QPIR protocol with prior entanglement.
  arXiv  Detail & Related papers  (2023-04-11T10:34:53Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Quantum teleportation is a reversal of quantum measurement [0.0]
  We introduce a generalized concept of quantum teleportation in the framework of quantum measurement and reversing operation. Our framework makes it possible to find an optimal protocol for quantum teleportation enabling a faithful transfer of unknown quantum states.
  arXiv  Detail & Related papers  (2021-04-25T15:03:08Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.