Optimal Fidelity-Aware Entanglement Distribution in Linear Quantum Networks

• URL: http://arxiv.org/abs/2407.09171v1
• Date: Fri, 12 Jul 2024 11:09:30 GMT
• Title: Optimal Fidelity-Aware Entanglement Distribution in Linear Quantum Networks
• Abstract summary: We study the problem of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network. We propose two algorithms, the Purify-then-Swap (PtS) and Swap-then-Purify (StP) ones, where the decisions about purification and swapping are taken with different order.
• Score: 5.136852624384612
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of entanglement distribution in terms of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network with a source, a repeater, and a destination. The nodes have several quantum memories, and the problem is how to coordinate entanglement purification in each of the links, and entanglement swapping across links, so as to achieve the goal above. We show that entanglement swapping (i.e, deciding on the pair of qubits from each link to perform swapping on) is equivalent to finding a max-weight matching on a bipartite graph. Further, entanglement purification (i.e, deciding which pairs of qubits in a link will undergo purification) is equivalent to finding a max-weight matching on a non-bipartite graph. We propose two polynomial algorithms, the Purify-then-Swap (PtS) and the Swap-then-Purify (StP) ones, where the decisions about purification and swapping are taken with different order. Numerical results show that PtS performs better than StP, and also that the omission of purification in StP gives substantial benefits.

Related papers

• Full-Rank Noise Forbids Long-Range Entanglement Swapping [8.373057326694193]
  Quantum repeaters extend entanglement by swapping noisy elementary links.<n>We prove that full-rank noise forbids this at long range.<n>We construct link state families of rank three and rank two that admit postselected measurement outcome branches.
  arXiv  Detail & Related papers  (2026-09-10T02:58:05Z)
• To Purify or Not to Purify: Entanglement Purification under Input Fidelity Asymmetry in Quantum Networks [1.5114999589746663]
  Entanglement purification with two entangled resource pairs is widely employed in the literature on quantum repeater networks.<n>We show that when the fidelity requirement cannot be met with swapping alone and purification is necessary, to be effective, it must be conditioned on delta(F) between resource pairs.<n>We introduce DeltaPurify, a policy that conditions purification decisions on local fidelity information, and show it reduces time-to-serve relative to both naive purification and no-purification.
  arXiv  Detail & Related papers  (2026-05-09T07:58:03Z)
• Qubit-efficient embedding of parity-encoded Hamiltonians in quantum annealers [0.0]
  We propose a qubit-efficient embedding scheme for parity-encoded Hamiltonians on quantum annealers.<n>Our embedding maps each spin to a two-qubit chain using systematic chain-assignment rules.<n>The number of required qubits per spin in the parity Hamiltonian is three, which is fewer than that for a known embedding scheme for the Pegasus graph.
  arXiv  Detail & Related papers  (2026-03-30T16:51:32Z)
• Path Integral Quantum Control for Quantum Chemistry Applications [0.0]
  We adapt the PiQC algorithm to optimize parametrized quantum circuits.<n>We benchmark the gate-based and pulse-based versions of PiQC against the Variational Quantum Eigensolver (VQE)<n>Both PiQC algorithms exhibit greater robustness than SPSA to variations in the target Hamiltonian induced by changes in molecular bond distances.
  arXiv  Detail & Related papers  (2025-09-28T22:42:06Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Percolation thresholds and connectivity in quantum networks [0.0]
  We study entanglement percolation in qubit-based planar quantum network models.<n>We develop an algorithm designed to find a sequence of entanglement swapping and distillation operations.<n>We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies.
  arXiv  Detail & Related papers  (2025-02-24T14:26:09Z)
• Detecting Errors in a Quantum Network with Pauli Checks [2.692338496884547]
  We apply the quantum error detection scheme Pauli check sandwiching (PCS) to quantum networks by turning it into a distributed multiparty protocol. PCS is a distance 1 code and requires less resource than standard quantum error correction and detection methods.
  arXiv  Detail & Related papers  (2024-05-24T05:56:21Z)
• Realization of two-qubit gates and multi-body entanglement states in an asymmetric superconducting circuits [3.9488862168263412]
  We propose a tunable fluxonium-transmon-transmon (FTT) cou pling scheme. The asymmetric structure composed of fluxonium and transmon will optimize the frequency space and form a high fidelity two-qubit quantum gate. We study the performance of this scheme by simulating the general single-qubit Xpi/2 gate and two-qubit (iSWAP) gate.
  arXiv  Detail & Related papers  (2024-04-12T08:44:21Z)
• Entanglement buffering with two quantum memories [0.0]
  Quantum networks crucially rely on the availability of high-quality entangled pairs of qubits, known as entangled links. Maintaining the quality of these links is a challenging task due to the presence of time-dependent noise. Entanglement purification protocols offer a solution by converting multiple low-quality entangled states into a smaller number of higher-quality ones.
  arXiv  Detail & Related papers  (2023-11-16T17:46:00Z)
• Distribution-Flexible Subset Quantization for Post-Quantizing Super-Resolution Networks [68.83451203841624]
  This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks. DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ) It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
  arXiv  Detail & Related papers  (2023-05-10T04:19:11Z)
• Optimal State Manipulation for a Two-Qubit System Driven by Coherent and Incoherent Controls [77.34726150561087]
  State preparation is important for optimal control of two-qubit quantum systems. We exploit two physically different coherent control and optimize the Hilbert-Schmidt target density matrices.
  arXiv  Detail & Related papers  (2023-04-03T10:22:35Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Deterministic Entanglement Transmission on Series-Parallel Quantum Networks [2.86989372262348]
  This paper explores and amplifies a new and more effective mapping of QN, referred to as concurrence percolation theory (ConPT) We implement ConPT via a novel deterministic entanglement transmission scheme that is fully analogous to resistor network analysis. The DET is designed for general d-dimensional information carriers, scalable and adaptable for any series-parallel QN, and experimentally feasible as tested on IBM's quantum platform.
  arXiv  Detail & Related papers  (2021-10-11T03:29:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Distributing Multipartite Entanglement over Noisy Quantum Networks [0.0]
  A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. We present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories.
  arXiv  Detail & Related papers  (2021-03-26T22:48:05Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
  We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization. We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
  arXiv  Detail & Related papers  (2020-05-14T16:00:34Z)

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.