Asymmetric node placement in fiber-based quantum networks

• URL: http://arxiv.org/abs/2305.09635v3
• Date: Mon, 17 Jun 2024 21:20:47 GMT
• Title: Asymmetric node placement in fiber-based quantum networks
• Authors: Guus Avis, Robert Knegjens, Anders S. Sørensen, Stephanie Wehner,
• Abstract summary: Restrictions imposed by existing infrastructure can make it hard to ensure an even spacing between the nodes of future quantum networks. We consider separately the placement of midpoint stations required for heralded entanglement generation, as well as of processing-node quantum repeaters in a chain. We find that while the time required to perform one entangling attempt may increase linearly with the midpoint's asymmetry, the success probability and fidelity of heralded entanglement generation and the distribution time and error rate for repeater chains all have vanishing first derivatives with respect to the amount of asymmetry.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Restrictions imposed by existing infrastructure can make it hard to ensure an even spacing between the nodes of future fiber-based quantum networks. We here investigate the negative effects of asymmetric node placement by considering separately the placement of midpoint stations required for heralded entanglement generation, as well as of processing-node quantum repeaters in a chain. For midpoint stations, we describe the effect asymmetry has on the time required to perform one entangling attempt, the success probability of such attempts, and the fidelity of the entangled states created. This includes accounting for the effects of chromatic dispersion on photon indistinguishability. For quantum-repeater chains we numerically investigate how uneven spacing between repeater nodes leads to bottlenecks, thereby increasing both the waiting time and the time states are stored in noisy quantum memory. We find that while the time required to perform one entangling attempt may increase linearly with the midpoint's asymmetry, the success probability and fidelity of heralded entanglement generation and the distribution time and error rate for repeater chains all have vanishing first derivatives with respect to the amount of asymmetry. This suggests resilience of quantum-network performance against small amounts of asymmetry.

Related papers

• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks. We show that while entanglement is needed for this quantum advantage, genuine multipartite entanglement is generally unnecessary.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
  Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another. We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST. The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
  arXiv  Detail & Related papers  (2024-05-10T23:46:35Z)
• Success probabilities in time-reversal based hybrid quantum state transfer [0.0]
  We consider two memory nodes of a quantum network connected by flying qubits. We show how and why the probability of interfacing successfully is determined by the overlap of the spectral shape of the actual flying qubit and the ideal shape.
  arXiv  Detail & Related papers  (2024-01-16T04:38:10Z)
• Edge modes and symmetry-protected topological states in open quantum systems [0.0]
  Topological order offers possibilities for processing quantum information which can be immune to imperfections. We show robustness of certain aspects of $ZZtimes Z$ symmetry-protected trajectory (SPT) order against a wide class of dissipation channels. Our work thus proposes a novel framework to study the dynamics of dissipative SPT phases.
  arXiv  Detail & Related papers  (2023-10-13T21:09:52Z)
• Quantum Trajectory Approach to Error Mitigation [0.0]
  Quantum Error Mitigation (EM) is a collection of strategies to reduce errors on noisy quantum devices. We show that the inverse of noise maps can be realised by performing classical post-processing. We demonstrate our result on a model relevant for current NISQ devices.
  arXiv  Detail & Related papers  (2023-05-31T14:10:35Z)
• Quantum Transport in Open Spin Chains using Neural-Network Quantum States [11.137438870686026]
  We study the treatment of asymmetric open quantum systems with neural networks based on the restricted Boltzmann machine. In particular, we are interested in the non-equilibrium steady state current in the boundary-driven (anisotropic) Heisenberg spin chain.
  arXiv  Detail & Related papers  (2022-12-27T11:30:47Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Pretty good quantum state transfer on isotropic and anisotropic Heisenberg spin chains with tailored site dependent exchange couplings [68.8204255655161]
  We consider chains with isotropic and anisotropic Heisenberg Hamiltonian with up to 100 spins. We consider short transferred times, in particular shorter than those achievable with known time-dependent control schemes.
  arXiv  Detail & Related papers  (2021-01-08T19:32:10Z)
• Efficient optimization of cut-offs in quantum repeater chains [0.0]
  We develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols. We use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain.
  arXiv  Detail & Related papers  (2020-05-11T09:17:21Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.