Efficient percolation simulations for lossy photonic fusion networks

• URL: http://arxiv.org/abs/2312.04639v2
• Date: Fri, 5 Jul 2024 19:53:10 GMT
• Title: Efficient percolation simulations for lossy photonic fusion networks
• Authors: Matthias C. Löbl, Stefano Paesani, Anders S. Sørensen,
• Abstract summary: Non-standard percolation models appear in the context of measurement-based photonic quantum computing. We develop modifications of the Newman-Ziff algorithm to perform the corresponding percolation simulation efficiently. We demonstrate our algorithms by using them to characterize exemplary fusion networks and graph states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The study of percolation phenomena has various applications ranging from social networks or materials science to quantum information. The most common percolation models are bond- or site-percolation for which the Newman-Ziff algorithm enables an efficient simulation. Here, we consider several non-standard percolation models that appear in the context of measurement-based photonic quantum computing with so-called graph states and fusion networks. The associated percolation thresholds determine the tolerance to photon loss in such systems and we develop modifications of the Newman-Ziff algorithm to perform the corresponding percolation simulation efficiently. We demonstrate our algorithms by using them to characterize exemplary fusion networks and graph states. The used source code is provided as an open-source repository.

Related papers

• A dataflow programming framework for linear optical distributed quantum computing [1.368117423972661]
  Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures.<n>We introduce a graphical framework for distributed quantum computing that brings together linear optics, the ZX-calculus, and dataflow programming.
  arXiv  Detail & Related papers  (2026-01-13T09:57:25Z)
• Graph Signal Generative Diffusion Models [74.75869068073577]
  We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
  arXiv  Detail & Related papers  (2025-09-21T21:57:27Z)
• Quantum Convolutional Neural Network with Flexible Stride [7.362858964229726]
  We propose a novel quantum convolutional neural network algorithm. It can flexibly adjust the stride to accommodate different tasks. It can achieve exponential acceleration of data scale in less memory compared with its classical counterpart.
  arXiv  Detail & Related papers  (2024-12-01T02:37:06Z)
• Fusion and flow: formal protocols to reliably build photonic graph states [0.0]
  Recently proposed fusion-based architectures aim to achieve universality and fault-tolerance. This paper develops a framework for photonic quantum computing by bringing together linear optics, ZX calculus, and dataflow programming.
  arXiv  Detail & Related papers  (2024-09-20T14:33:54Z)
• Quantum Sparse Coding and Decoding Based on Quantum Network [1.0683439960798695]
  We propose a symmetric quantum neural network for realizing sparse coding and decoding algorithms. Our networks consist of multi-layer, two-level unitary transformations that are naturally suited for optical circuits. We achieve sparse coding and decoding of binary and grayscale images in classical problems, as well as that of complex quantum states in quantum problems separately.
  arXiv  Detail & Related papers  (2024-06-10T04:21:27Z)
• Heralded photonic 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)
• 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)
• Faster Adaptive Federated Learning [84.38913517122619]
  Federated learning has attracted increasing attention with the emergence of distributed data. In this paper, we propose an efficient adaptive algorithm (i.e., FAFED) based on momentum-based variance reduced technique in cross-silo FL.
  arXiv  Detail & Related papers  (2022-12-02T05:07:50Z)
• Convolutional Learning on Multigraphs [153.20329791008095]
  We develop convolutional information processing on multigraphs and introduce convolutional multigraph neural networks (MGNNs) To capture the complex dynamics of information diffusion within and across each of the multigraph's classes of edges, we formalize a convolutional signal processing model. We develop a multigraph learning architecture, including a sampling procedure to reduce computational complexity. The introduced architecture is applied towards optimal wireless resource allocation and a hate speech localization task, offering improved performance over traditional graph neural networks.
  arXiv  Detail & Related papers  (2022-09-23T00:33:04Z)
• Quantum Compressive Sensing: Mathematical Machinery, Quantum Algorithms, and Quantum Circuitry [10.286119086329762]
  Compressive sensing is a protocol that facilitates reconstruction of large signals from relatively few measurements. Recent efforts in the literature consider instead a data-driven approach, training tensor networks to learn the structure of signals of interest. We present an alternative "quantum" protocol, in which the state of the tensor network is a quantum state over a set of entangled qubits.
  arXiv  Detail & Related papers  (2022-04-27T16:20:28Z)
• Learning Discriminative Shrinkage Deep Networks for Image Deconvolution [122.79108159874426]
  We propose an effective non-blind deconvolution approach by learning discriminative shrinkage functions to implicitly model these terms. Experimental results show that the proposed method performs favorably against the state-of-the-art ones in terms of efficiency and accuracy.
  arXiv  Detail & Related papers  (2021-11-27T12:12:57Z)
• Shared Prior Learning of Energy-Based Models for Image Reconstruction [69.72364451042922]
  We propose a novel learning-based framework for image reconstruction particularly designed for training without ground truth data. In the absence of ground truth data, we change the loss functional to a patch-based Wasserstein functional. In shared prior learning, both aforementioned optimal control problems are optimized simultaneously with shared learned parameters of the regularizer.
  arXiv  Detail & Related papers  (2020-11-12T17:56:05Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)

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.