Heralded photonic graph states with inefficient quantum emitters

• URL: http://arxiv.org/abs/2405.13263v2
• Date: Fri, 27 Sep 2024 18:25:27 GMT
• Title: Heralded photonic graph states with inefficient quantum emitters
• Authors: Maxwell Gold, Jianlong Lin, Eric Chitambar, Elizabeth A. Goldschmidt,
• Abstract summary: 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.
• Score: 2.612403257963011
• License:
• Abstract: Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology for realizing distributed quantum computation and communication protocols on near-term hardware. We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art coherent quantum emitters. We demonstrate that the construction time for large graph states can be polynomial in the photon collection efficiency, as compared to the exponential scaling of current emitter-based schemes, which assume deterministic photon collection. The additional overhead to achieve this advantage consists of an extra spin system plus one additional spin-spin entangling gate per photon added to the graph. While the proposed scheme enables the generation of graph states for arbitrary applications, we show how it can be further simplified for the specific task of measurement-based computation, leading to significantly higher rates and removing the need for photonic memory in certain computations. As an example use-case of our scheme, we construct a protocol for secure two-party computation that can be implemented efficiently on current hardware. Estimates of the fidelity to produce graph states used in the computation are given, based on current trapped ion experimental benchmarks.

Related papers

• A complete scheme for atom-mediated deterministic photonic graph state generation [0.0]
  Highly-entangled multi-photon graph states are a crucial resource in photonic quantum computation and communication. We show how harnessing single-atom-based photonic operations can enable deterministic generation of photonic graph states.
  arXiv  Detail & Related papers  (2024-06-02T20:33:40Z)
• 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)
• Generating scalable graph states in an atom-nanophotonic interface [0.0]
  scalable graph states are essential for measurement-based quantum computation and many entanglement-assisted applications in quantum technologies. Here we propose to prepare high-fidelity and scalable graph states in one and two dimensions, which can be tailored in an atom-nanophotonic cavity. An analysis of state fidelity is also presented, and the state preparation probability can be optimized via multiqubit state carvings and sequential single-photon probes.
  arXiv  Detail & Related papers  (2023-10-06T03:33:32Z)
• Simulation of Entanglement Generation between Absorptive Quantum Memories [56.24769206561207]
  We use the open-source Simulator of QUantum Network Communication (SeQUeNCe), developed by our team, to simulate entanglement generation between two atomic frequency comb (AFC) absorptive quantum memories. We realize the representation of photonic quantum states within truncated Fock spaces in SeQUeNCe. We observe varying fidelity with SPDC source mean photon number, and varying entanglement generation rate with both mean photon number and memory mode number.
  arXiv  Detail & Related papers  (2022-12-17T05:51:17Z)
• 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)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• 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)
• All-optical graph representation learning using integrated diffractive photonic computing units [51.15389025760809]
  Photonic neural networks perform brain-inspired computations using photons instead of electrons. We propose an all-optical graph representation learning architecture, termed diffractive graph neural network (DGNN) We demonstrate the use of DGNN extracted features for node and graph-level classification tasks with benchmark databases and achieve superior performance.
  arXiv  Detail & Related papers  (2022-04-23T02:29:48Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Generation of Photonic Matrix Product States with Rydberg Atomic Arrays [63.62764375279861]
  We show how one can deterministically generate photonic matrix product states with high bond and physical dimensions with an atomic array. We develop a quantum gate and an optimal control approach to universally control the system and analyze the photon retrieval efficiency of atomic arrays.
  arXiv  Detail & Related papers  (2020-11-08T07:59:55Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.