Noise-reduction of multimode Gaussian Boson Sampling circuits via Unitary Averaging

• URL: http://arxiv.org/abs/2506.05732v1
• Date: Fri, 06 Jun 2025 04:28:06 GMT
• Title: Noise-reduction of multimode Gaussian Boson Sampling circuits via Unitary Averaging
• Authors: S. Nibedita Swain, Ryan J. Marshman, Alexander S. Solntsev, Timothy C. Ralph,
• Abstract summary: We improve Gaussian Boson Sampling (GBS) circuits by integrating the unitary averaging protocol.<n>We mitigate arbitrary interferometric noise, including beam-splitter and phase-shifter imperfections.<n>We derive a power-law formula predicting performance gains in large-scale systems.
• Score: 41.94295877935867
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We improve Gaussian Boson Sampling (GBS) circuits by integrating the unitary averaging (UA) protocol, previously demonstrated to protect unknown Gaussian states from phase errors [Phys. Rev. A 110, 032622]. Our work extends the applicability of UA to mitigate arbitrary interferometric noise, including beam-splitter and phase-shifter imperfections. Through comprehensive numerical analysis, we demonstrate that UA consistently achieves higher fidelity and success probability compared to unprotected circuits, establishing its robustness in noisy conditions. Remarkably, enhancement is maintained across varying numbers of modes with respect to the noise. We further derive a power-law formula predicting performance gains in large-scale systems, including 100-mode and 216-mode configurations. A detailed step-by-step algorithm for implementing the UA protocol is also provided, offering a practical roadmap for advancing near-term quantum technologies.

Related papers

• Scalable Distributed Memory Implementation of the Quasi-Adiabatic Propagator Path Integral [0.0]
  We present a scalable distributed memory implementation of the Mask Assisted Coarse Graining of Influence Coefficients.<n>The method exploits the memory resources of multiple compute nodes and mitigates the memory bottleneck via a new pre-merging algorithm.<n>The efficiency of the new implementation is demonstrated in large-scale dissipative quantum dynamics simulations.
  arXiv  Detail & Related papers  (2025-06-03T17:56:18Z)
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation [0.0]
  We present a hybrid quantum algorithm for estimating gaps in many-body energy spectra.<n>We employ error mitigation strategies that optimize the utilization of quantum resources.<n>Results underscore the potential to enable accurate quantum simulations on near-term noisy quantum devices.
  arXiv  Detail & Related papers  (2024-05-16T17:57:15Z)
• High-fidelity, multi-qubit generalized measurements with dynamic circuits [1.6437645274005803]
  Generalized measurements, also called positive operator-valued measures (POVMs), can offer advantages over projective measurements in quantum information tasks. Here, we realize a generalized measurement of one and two superconducting qubits with high fidelity and in a single experimental setting. We showcase a highly effective use of approximate compiling to enhance POVM fidelity in noisy conditions.
  arXiv  Detail & Related papers  (2023-12-21T18:07:08Z)
• Efficient sampling of noisy shallow circuits via monitored unraveling [0.03922370499388702]
  We introduce a classical algorithm for sampling the output of noisy random circuits on two-dimensional qubit arrays. The algorithm builds on the recently-proposed "space-evolving block decimation" (SEBD) and extends it to the case of noisy circuits.
  arXiv  Detail & Related papers  (2023-06-28T18:00:02Z)
• Improve Noise Tolerance of Robust Loss via Noise-Awareness [60.34670515595074]
  We propose a meta-learning method which is capable of adaptively learning a hyper parameter prediction function, called Noise-Aware-Robust-Loss-Adjuster (NARL-Adjuster for brevity) Four SOTA robust loss functions are attempted to be integrated with our algorithm, and comprehensive experiments substantiate the general availability and effectiveness of the proposed method in both its noise tolerance and performance.
  arXiv  Detail & Related papers  (2023-01-18T04:54:58Z)
• Diffusion Posterior Sampling for General Noisy Inverse Problems [50.873313752797124]
  We extend diffusion solvers to handle noisy (non)linear inverse problems via approximation of the posterior sampling. Our method demonstrates that diffusion models can incorporate various measurement noise statistics.
  arXiv  Detail & Related papers  (2022-09-29T11:12:27Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [0.0]
  Noise mitigation can be performed up to some error for which we derive upper bounds. Experiments on 15 (23) qubits using IBM's devices to test both the noise model and the error-mitigation scheme. We show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
  arXiv  Detail & Related papers  (2021-01-07T02:19:58Z)
• 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)
• Noisy receivers for quantum illumination [0.0]
  Quantum illumination (QI) promises unprecedented performances in target detection. Signal and idler recombination forms a crucial barrier to the protocol's success. This could potentially be mitigated if performing a measurement on the idler mode could still yield a quantum advantage.
  arXiv  Detail & Related papers  (2020-06-08T17:42:19Z)
• Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping [69.9674326582747]
  We propose a new accelerated first-order method called clipped-SSTM for smooth convex optimization with heavy-tailed distributed noise in gradients. We prove new complexity that outperform state-of-the-art results in this case. We derive the first non-trivial high-probability complexity bounds for SGD with clipping without light-tails assumption on the noise.
  arXiv  Detail & Related papers  (2020-05-21T17:05:27Z)

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.