Optimal Switching Networks for Paired-Egress Bell State Analyzer Pools

• URL: http://arxiv.org/abs/2405.09860v1
• Date: Thu, 16 May 2024 07:38:34 GMT
• Title: Optimal Switching Networks for Paired-Egress Bell State Analyzer Pools
• Authors: Marii Koyama, Claire Yun, Amin Taherkhani, Naphan Benchasattabuse, Bernard Ousmane Sane, Michal Hajdušek, Shota Nagayama, Rodney Van Meter,
• Abstract summary: nodes emit photons entangled with stationary memories, with the photons routed through a switched interconnect to a shared pool of Bell state analyzers (BSAs) We present optimal designs for switched interconnects constrained to planar layouts, appropriate for silicon waveguides and Mach-Zehnder interferometer (MZI) $2 times 2$ switch points. For pairing $N$ inputs, $N(N - 2)/4$ switches are required, which is less than half of number of switches required for full permutation switching networks.
• Score: 0.3613661942047476
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To scale quantum computers to useful levels, we must build networks of quantum computational nodes that can share entanglement for use in distributed forms of quantum algorithms. In one proposed architecture, node-to-node entanglement is created when nodes emit photons entangled with stationary memories, with the photons routed through a switched interconnect to a shared pool of Bell state analyzers (BSAs). Designs that optimize switching circuits will reduce loss and crosstalk, raising entanglement rates and fidelity. We present optimal designs for switched interconnects constrained to planar layouts, appropriate for silicon waveguides and Mach-Zehnder interferometer (MZI) $2 \times 2$ switch points. The architectures for the optimal designs are scalable and algorithmically structured to pair any arbitrary inputs in a rearrangeable, non-blocking way. For pairing $N$ inputs, $N(N - 2)/4$ switches are required, which is less than half of number of switches required for full permutation switching networks. An efficient routing algorithm is also presented for each architecture. These designs can also be employed in reverse for entanglement generation using a shared pool of entangled paired photon sources.

Related papers

• Joint Transmit and Pinching Beamforming for PASS: Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed. It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs) The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• An Optical Interconnect for Modular Quantum Computers [0.44624755182670844]
  scaling up quantum computers requires an optical interconnect. We propose a multi-group structure where the group switch routes photons emitted by computational end nodes. We implement a prototype three-node switched interconnect and create two-hop entanglement with fidelities of at least 0.6.
  arXiv  Detail & Related papers  (2024-12-12T14:16:50Z)
• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• Quantum Circuit Mapping for Universal and Scalable Computing in MZI-based Integrated Photonics [0.0]
  We propose an approach to move toward a universal and scalable LOQC on the integrated photonic platform. We introduce a swap photonic network that maps the regularly-labeled structure of the new path-encoded qubits to the structure needed for the post-selected CZ. In this way, we can deterministically exchange the locations of the qubits and execute controlled quantum gates between any path-encoded qubits.
  arXiv  Detail & Related papers  (2024-01-30T10:29:13Z)
• A Control Architecture for Entanglement Generation Switches in Quantum Networks [1.0282274843007797]
  Entanglement between quantum network nodes is often produced using intermediary devices - such as heralding stations - as a resource. Here, we propose a cost-effective architecture to connect many quantum network nodes via a central quantum network hub called an Entanglement Generation Switch (EGS) The EGS allows multiple quantum nodes to be connected at a fixed resource cost, by sharing the resources needed to make entanglement.
  arXiv  Detail & Related papers  (2023-09-05T10:06:48Z)
• High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
  Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing. A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture. Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
  arXiv  Detail & Related papers  (2022-03-30T13:44:52Z)
• Switch networks for photonic fusion-based quantum computing [0.0]
  Fusion-based quantum computing (FBQC) offers a powerful approach to building a fault-tolerant universal quantum computer. FBQC uses single-photon sources, linear-optical circuits, single-photon detectors, and optical switching with feedforward control. New techniques and schemes enable major improvements in terms of muxing efficiency and reductions in hardware requirements.
  arXiv  Detail & Related papers  (2021-09-28T14:31:30Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• 2D Qubit Placement of Quantum Circuits using LONGPATH [1.6631602844999722]
  Two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit. Our approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
  arXiv  Detail & Related papers  (2020-07-14T04:09:52Z)

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.