No graph state is preparable in quantum networks with bipartite sources and no classical communication

• URL: http://arxiv.org/abs/2208.12099v2
• Date: Mon, 4 Dec 2023 16:27:23 GMT
• Title: No graph state is preparable in quantum networks with bipartite sources and no classical communication
• Authors: Owidiusz Makuta, Laurens T. Ligthart, Remigiusz Augusiak
• Abstract summary: We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network. We then generalise our result to arbitrary quantum states that are sufficiently close to graph states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As the latency of a network is one of its most important characteristics, it is interesting to consider quantum networks in which parties cannot communicate classically and ask what limitations this assumption imposes on the possibility of preparing multipartite states in such networks. We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network in which parties are connected via sources of bipartite quantum states and the classical communication is replaced by some pre-shared classical correlations. We then generalise our result to arbitrary quantum states that are sufficiently close to graph states.

Related papers

• Operational Nonclassicality in Quantum Communication Networks [9.312605205492458]
  We apply an operational framework for witnessing quantum nonclassicality in communication networks. We demonstrate nonclassicality in many basic networks such as entanglement-assisted point-to-point and multi-point channels. Our approaches could be implemented on quantum networking hardware and used to automatically establish certain protocols.
  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)
• Percolation Theories for Quantum Networks [5.004146855779428]
  Review paper discusses a fundamental question: how can entanglement be effectively and indirectly distributed between distant nodes in an imperfect quantum network? We show that the classical percolation frameworks do not uniquely define the network's indirect connectivity. This realization leads to the emergence of an alternative theory called concurrence percolation,'' which uncovers a previously unrecognized quantum advantage that emerges at large scales.
  arXiv  Detail & Related papers  (2023-10-27T18:24:58Z)
• Hierarchical certification of nonclassical network correlations [50.32788626697182]
  We derive linear and nonlinear Bell-like inequalities for networks, whose violation certifies the absence of a minimum number of classical sources in them. We insert this assumption, which leads to results more amenable to certification in experiments.
  arXiv  Detail & Related papers  (2023-06-27T18:00:01Z)
• Quantum LOSR networks cannot generate graph states with high fidelity [6.720135092777862]
  We prove that all multi-qubit graph states arising from a connected graph cannot originate from any quantum network with bipartite sources. The fidelity of a multi-qubit graph state and any network state cannot exceed $9/10$.
  arXiv  Detail & Related papers  (2022-08-25T14:00:00Z)
• 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)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Aggregating Quantum Networks [0.0]
  Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows information to be transmitted in a fault tolerant way between different parts of the quantum network. It is a quantum phenomenon not available in conventional telecommunication networks either.
  arXiv  Detail & Related papers  (2020-08-10T01:53:10Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

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.