Deterministic generation of multi-qubit entangled states among distant parties using indefinite causal order

• URL: http://arxiv.org/abs/2503.03411v1
• Date: Wed, 05 Mar 2025 11:40:19 GMT
• Title: Deterministic generation of multi-qubit entangled states among distant parties using indefinite causal order
• Authors: Wen-Qiang Liu, Hai-Rui Wei,
• Abstract summary: We present protocols for generating $N$-qubit entangled states across multiple network nodes.<n>The results indicate that our protocols significantly improve the efficiency of long-distance entanglement generation.
• Score: 1.556591713973462
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By utilizing a pre-shared maximally entangled state and single-qubit operations within an indefinite causal order framework, the multi-qubit entangled state between distant parties can be generated deterministically. The complex entangled state measurements and multiple pre-shared entangled states, are essential in conventional entanglement swapping technique, but are not required in our approach. This greatly reduces the complexity of the quantum circuit and makes it more experimentally feasible. Furthermore, we develop optical architectures to implement these protocols by encoding qubits in polarization degree of freedom. The results indicate that our protocols significantly improve the efficiency of long-distance entanglement generation and provide a practical framework for establishing large-scale quantum networks.

Related papers

• General Concurrence Percolation on Quantum Networks [1.03590082373586]
  A quantum network is a network of entangled states and can be used to transmit quantum information.<n>We introduce a new protocol based on bond percolation to create a network of maximally entangled states.
  arXiv  Detail & Related papers  (2025-01-19T10:29:42Z)
• Deterministic multipartite entanglement via fractional state transfer across quantum networks [0.0]
  We propose a fractional quantum state transfer, in which the excitation of an emitter is partially transmitted through the quantum communication channel. We show that genuine multipartite entangled states can be faithfully prepared within current experimental platforms.
  arXiv  Detail & Related papers  (2024-08-02T10:59:16Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Mimicking states with limited resources: passing quantum quiz via global control [0.0]
  We propose, analyze, and optimize a protocol which allows fast simulation of properties of unknown quantum states. Our protocol, having common features with quantum identification and shortcuts to adiabaticity, permits avoiding adiabaticity catastrophe.
  arXiv  Detail & Related papers  (2022-08-17T23:18:02Z)
• Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
  In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
  arXiv  Detail & Related papers  (2022-07-11T15:17:58Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices [68.8204255655161]
  Purifying entanglement resources after their imperfect generation is an indispensable step towards using them in quantum architectures. Here we depart from the typical purification paradigm for multipartite states explored in the last twenty years. We find that smaller sacrificial' states, like Bell pairs, can be more useful in the purification of multipartite states than additional copies of these same states.
  arXiv  Detail & Related papers  (2020-11-23T19:00:00Z)
• Entanglement-assisted entanglement purification [62.997667081978825]
  We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise.
  arXiv  Detail & Related papers  (2020-11-13T19:00:05Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

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.