Performance analysis of quantum repeaters enabled by deterministically generated photonic graph states

• URL: http://arxiv.org/abs/2209.11430v1
• Date: Fri, 23 Sep 2022 06:13:55 GMT
• Title: Performance analysis of quantum repeaters enabled by deterministically generated photonic graph states
• Authors: Yuan Zhan, Paul Hilaire, Edwin Barnes, Sophia E. Economou, and Shuo Sun
• Abstract summary: quantum repeaters enable fast entanglement distribution rates approaching classical communication. New schemes have been proposed that employ quantum emitters to deterministically generate photonic graph states. We quantitatively analyze the performance of quantum repeaters based on two different graph states.
• Score: 6.06945682395675
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph states requires a formidable resource overhead using traditional approaches based on linear optics. Overcoming this challenge, a number of new schemes have been proposed that employ quantum emitters to deterministically generate photonic graph states. Although these schemes have the potential to significantly reduce the resource cost, a systematic comparison of the repeater performance among different encodings and different generation schemes is lacking. Here, we quantitatively analyze the performance of quantum repeaters based on two different graph states, i.e. the tree graph states and the repeater graph states. For both states, we compare the performance between two generation schemes, one based on a single quantum emitter coupled to ancillary matter qubits, and one based on a single quantum emitter coupled to a delayed feedback. We identify the optimal scheme at different system parameters. Our analysis provides a clear guideline on the selection of the optimal generation scheme for graph-state-based quantum repeaters, and lays out the parameter requirements for future experimental realizations of different schemes.

Related papers

• Heralded arbitrary graph states with inefficient quantum emitters [2.612403257963011]
  Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology. We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art emitters.
  arXiv  Detail & Related papers  (2024-05-22T00:24:01Z)
• Towards Efficient Quantum Hybrid Diffusion Models [68.43405413443175]
  We propose a new methodology to design quantum hybrid diffusion models. We propose two possible hybridization schemes combining quantum computing's superior generalization with classical networks' modularity.
  arXiv  Detail & Related papers  (2024-02-25T16:57:51Z)
• Resource-efficient and loss-aware photonic graph state preparation using an array of quantum emitters, and application to all-photonic quantum repeaters [0.8409980020848168]
  We propose an algorithm that can trade the number of emitters with the graph-state depth, while minimizing the number of emitter CNOTs. We find that our scheme achieves a far superior rate-vs.-distance performance than using the least number of emitters needed to generate the repeater graph state.
  arXiv  Detail & Related papers  (2024-02-01T16:29:07Z)
• Optimization of deterministic photonic graph state generation via local operations [3.2106353278518105]
  We introduce an optimization method for such protocols based on the local Clifford equivalency of states and the graph theoretical correlations of the generation cost parameters. We achieve a 50% reduction in use of the 2-qubit gates for generation of the arbitrary large repeater graph states and similar significant reductions in the total gate count for generation of random dense graphs.
  arXiv  Detail & Related papers  (2024-01-01T02:11:49Z)
• Discrete Graph Auto-Encoder [52.50288418639075]
  We introduce a new framework named Discrete Graph Auto-Encoder (DGAE) We first use a permutation-equivariant auto-encoder to convert graphs into sets of discrete latent node representations. In the second step, we sort the sets of discrete latent representations and learn their distribution with a specifically designed auto-regressive model.
  arXiv  Detail & Related papers  (2023-06-13T12:40:39Z)
• Vertical Layering of Quantized Neural Networks for Heterogeneous Inference [57.42762335081385]
  We study a new vertical-layered representation of neural network weights for encapsulating all quantized models into a single one. We can theoretically achieve any precision network for on-demand service while only needing to train and maintain one model.
  arXiv  Detail & Related papers  (2022-12-10T15:57:38Z)
• Deterministic generation of qudit photonic graph states from quantum emitters [0.0]
  We show that our approach can be applied to generate any qudit graph state. We construct protocols to generate one- and two-dimensional qudit cluster states, absolutely maximally entangled states, and logical states of quantum error correcting codes.
  arXiv  Detail & Related papers  (2022-11-23T19:00:01Z)
• Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics [0.0]
  We introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities. Our results should pave the way towards the practical implementation of resource-efficient quantum information processing.
  arXiv  Detail & Related papers  (2022-05-19T17:59:59Z)
• Post-Training Quantization for Vision Transformer [85.57953732941101]
  We present an effective post-training quantization algorithm for reducing the memory storage and computational costs of vision transformers. We can obtain an 81.29% top-1 accuracy using DeiT-B model on ImageNet dataset with about 8-bit quantization.
  arXiv  Detail & Related papers  (2021-06-27T06:27:22Z)
• Generation of High-Resolution Handwritten Digits with an Ion-Trap Quantum Computer [55.41644538483948]
  We implement a quantum-circuit based generative model to learn and sample the prior distribution of a Generative Adversarial Network. We train this hybrid algorithm on an ion-trap device based on $171$Yb$+$ ion qubits to generate high-quality images.
  arXiv  Detail & Related papers  (2020-12-07T18:51:28Z)
• Optimal Gradient Quantization Condition for Communication-Efficient Distributed Training [99.42912552638168]
  Communication of gradients is costly for training deep neural networks with multiple devices in computer vision applications. In this work, we deduce the optimal condition of both the binary and multi-level gradient quantization for textbfANY gradient distribution. Based on the optimal condition, we develop two novel quantization schemes: biased BinGrad and unbiased ORQ for binary and multi-level gradient quantization respectively.
  arXiv  Detail & Related papers  (2020-02-25T18:28:39Z)

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.