Improved bounds on quantum uncommon information

• URL: http://arxiv.org/abs/2406.14879v2
• Date: Wed, 24 Jul 2024 09:09:10 GMT
• Title: Improved bounds on quantum uncommon information
• Authors: Yonghae Lee, Joonwoo Bae, Hayata Yamasaki, Soojoon Lee,
• Abstract summary: In quantum information theory, quantum uncommon information is the minimal amount of entanglement required for the quantum communication task of quantum state exchange. We develop a subspace exchange strategy that leverages a common subspace of two parties to identify the unnecessary qubits for exchange. Our bounds provide more precise estimations for the quantum uncommon information.
• Score: 2.812395851874055
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages required to be exchanged to completely share all information in common. However, this equivalence does not extend to quantum information theory. Specifically, quantum uncommon information is operationally defined as the minimal amount of entanglement required for the quantum communication task of quantum state exchange, where two parties exchange quantum states to share all quantum messages in common. Currently, an analytical closed-form expression for the quantum uncommon information remains undetermined. In this work, by investigating underlying characterization of the quantum uncommon information, we derive improved bounds on it. To obtain these bounds, we develop a subspace exchange strategy that leverages a common subspace of two parties to identify the unnecessary qubits for exchange. We also consider a referee-assisted exchange, wherein a referee aids two parties in efficiently performing the quantum state exchange. Our bounds provide more precise estimations for the quantum uncommon information. Furthermore, we demonstrate that the subspace technique is a versatile tool for characterizing uncommon information not only in the bipartite scenario but also in various multi-partite ones.

Related papers

• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [91.3755431537592]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• Entanglement Distribution and Quantum Teleportation in Higher Dimension over the Superposition of Causal Orders of Quantum Channels [13.359442837017202]
  We develop and formulate the theoretical framework for transmission of classical information through entanglement distribution of qudits over two quantum channels. Results show that entanglement distribution of a qudit provides a considerable gain in fidelity even with increase in noise.
  arXiv  Detail & Related papers  (2023-03-19T15:06:24Z)
• State Transfer and Entanglement between Two- and Four-Level Atoms in A Cavity [0.4724825031148412]
  We propose a scheme to transfer quantum information from multiple atomic qubits to a single qudit and vice versa in an optical cavity. With the qubit-qudit interaction, our scheme can transfer quantum states efficiently and measurement-independently.
  arXiv  Detail & Related papers  (2023-02-22T03:16:54Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Multi-partite subspaces containing no locally inaccessible information [0.0]
  We show that measurements on encoded qubits in two-dimensional subspaces may be performed locally. This requires only local measurement and feed-forward of classical information. Results may have practical applications to the measurement of encoded qubits in e.g. quantum secret sharing.
  arXiv  Detail & Related papers  (2022-07-26T18:31:57Z)
• 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)
• Tracing Information Flow from Open Quantum Systems [52.77024349608834]
  We use photons in a waveguide array to implement a quantum simulation of the coupling of a qubit with a low-dimensional discrete environment. Using the trace distance between quantum states as a measure of information, we analyze different types of information transfer.
  arXiv  Detail & Related papers  (2021-03-22T16:38:31Z)
• Universal quantum computation and quantum error correction with ultracold atomic mixtures [47.187609203210705]
  We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates. One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information. We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
  arXiv  Detail & Related papers  (2020-10-29T20:17:14Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Bounding generalized relative entropies: Nonasymptotic quantum speed limits [0.0]
  Information theory has become an increasingly important research field to better understand quantum mechanics. Relative entropy quantifies how difficult is to tell apart two probability distributions, or even two quantum states. We show how this quantity changes under a quantum process.
  arXiv  Detail & Related papers  (2020-08-27T15:37:04Z)

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.