Optical cluster-state generation with unitary averaging

• URL: http://arxiv.org/abs/2209.15282v1
• Date: Fri, 30 Sep 2022 07:43:18 GMT
• Title: Optical cluster-state generation with unitary averaging
• Authors: Deepesh Singh, Austin P. Lund, and Peter P. Rohde
• Abstract summary: Cluster states are the essential resource used in the implementation of Fusion-based quantum computation (FBQC) We introduce a method to generate high-fidelity optical cluster states by utilising the concept of unitary averaging. This error averaging technique is entirely passive and can be readily incorporated into the proposed PsiQuantum's FBQC architecture.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cluster states are the essential resource used in the implementation of Fusion-based quantum computation (FBQC). We introduce a method to generate high-fidelity optical cluster states by utilising the concept of unitary averaging. This error averaging technique is entirely passive and can be readily incorporated into the proposed PsiQuantum's FBQC architecture. Using postselection and the redundant encoding of Fusion gates, we observe an enhancement in the average fidelity of the output cluster state. We also show an improvement in the linear optical Bell-state measurement (BSM) success probability when the BSM is imperfect.

Related papers

• Analysis of optical loss thresholds in the fusion-based quantum computing architecture [41.94295877935867]
  We show that fault-tolerant quantum computing is possible with currently achievable levels of optical losses in an integrated photonic implementation. Our results show that fault-tolerant quantum computing in the FBQC model is possible with currently achievable levels of optical losses in an integrated photonic implementation.
  arXiv  Detail & Related papers  (2024-03-21T19:54:25Z)
• Rethinking Clustered Federated Learning in NOMA Enhanced Wireless Networks [60.09912912343705]
  This study explores the benefits of integrating the novel clustered federated learning (CFL) approach with non-independent and identically distributed (non-IID) datasets. A detailed theoretical analysis of the generalization gap that measures the degree of non-IID in the data distribution is presented. Solutions to address the challenges posed by non-IID conditions are proposed with the analysis of the properties.
  arXiv  Detail & Related papers  (2024-03-05T17:49:09Z)
• Matrix-product-state-based band-Lanczos solver for quantum cluster approaches [0.0]
  We present a matrix-product state (MPS) based band-Lanczos method as solver for quantum cluster methods. We show that our approach makes it possible to treat cluster geometries well beyond the reach of exact diagonalization methods.
  arXiv  Detail & Related papers  (2023-10-16T19:59:21Z)
• Testing of Hybrid Quantum-Classical K-Means for Nonlinear Noise Mitigation [9.502161131265531]
  Quantum k-means clustering promises a speed-up over the classical k-means algorithm. It has been shown to currently not provide this speed-up due to the embedding of classical data. This work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere.
  arXiv  Detail & Related papers  (2023-08-07T12:38:37Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Coherent-cluster-state generation in networks of degenerate optical parametric oscillators [4.015029887580199]
  We show that coherent cluster states can be generated in DOPO networks with the help of beam splitters and classical pumps. We map the generated states to an effective spin space using modular variables, which allows us to apply entanglement criteria tailored for spin-based cluster states.
  arXiv  Detail & Related papers  (2023-01-31T14:34:53Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• ClusterQ: Semantic Feature Distribution Alignment for Data-Free Quantization [111.12063632743013]
  We propose a new and effective data-free quantization method termed ClusterQ. To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics. We also incorporate the intra-class variance to solve class-wise mode collapse.
  arXiv  Detail & Related papers  (2022-04-30T06:58:56Z)
• Hidden qubit cluster states [0.0]
  Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state. We find that each of these contains a "hidden" qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing.
  arXiv  Detail & Related papers  (2021-03-22T03:13:54Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)

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.