Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection

• URL: http://arxiv.org/abs/2510.12774v2
• Date: Fri, 07 Nov 2025 00:54:12 GMT
• Title: Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
• Authors: Yu-Zhen Janice Chen, Laurent Massoulié, Don Towsley,
• Abstract summary: We investigate whether Gaussian Boson Sampling (GBS) can provide a computational advantage for solving the planted biclique problem.<n>This is a graph problem widely believed to be classically hard when the planted structure is small.<n>We show that when the planted biclique size falls within the conjectured hard regime, the natural fluctuations in node weights dominate the bias signal.
• Score: 16.336658164004657
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We investigate whether Gaussian Boson Sampling (GBS) can provide a computational advantage for solving the planted biclique problem, which is a graph problem widely believed to be classically hard when the planted structure is small. Although GBS has been heuristically and experimentally observed to favor sampling dense subgraphs, its theoretical performance on this classically hard problem remains largely unexplored. We focus on a natural statistic derived from GBS output: the frequency with which a node appears in GBS samples, referred to as the node weight. We rigorously analyze whether this signal is strong enough to distinguish planted biclique nodes from background nodes. Our analysis characterizes the distribution of node weights under GBS and quantifies the bias introduced by the planted structure. The results reveal a sharp limitation: when the planted biclique size falls within the conjectured hard regime, the natural fluctuations in node weights dominate the bias signal, making detection unreliable using simple ranking strategies. These findings provide the first rigorous evidence that planted biclique detection may remain computationally hard even under GBS-based quantum computing, and they motivate further investigation into more advanced GBS-based algorithms or other quantum approaches for this problem.

Related papers

• Sufficient conditions for hardness of lossy Gaussian boson sampling [0.49764328892172127]
  Gaussian boson sampling (GBS) is a prominent candidate for the experimental demonstration of quantum advantage.<n>We establish the complexity-theoretic foundations for the classical intractability of noisy GBS under photon loss.<n>This work presents the first rigorous characterization of classically intractable regimes of lossy GBS.
  arXiv  Detail & Related papers  (2025-11-11T05:37:55Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs [31.937752933240674]
  We propose Markov chain Monte Carlo-based algorithms to sample from GBS distributions on undirected, unweighted graphs.<n>Our main contribution is a double-loop variant of Glauber dynamics, whose stationary distribution matches the GBS distribution.<n>Our approach offers both theoretical guarantees and practical advantages for efficient classical sampling from GBS distributions on unweighted graphs.
  arXiv  Detail & Related papers  (2025-05-05T08:13:57Z)
• Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphs [61.226857589092]
  OOD detection on nodes in graph learning remains underexplored.<n>GNNSafe adapted energy-based detection to the graph domain with state-of-the-art performance.<n>We introduce DeGEM, which decomposes the learning process into two parts: a graph encoder that leverages topology information for node representations and an energy head that operates in latent space.
  arXiv  Detail & Related papers  (2025-02-25T07:20:00Z)
• Linear cross-entropy certification of quantum computational advantage in Gaussian Boson Sampling [0.0]
  We argue that one can avoid this issue by validating GBS implementations using their corresponding ideal distributions directly. We explain how to use a modified version of the linear cross-entropy, a measure that we call the LXE score, to find reference values that help us assess how close a given GBS implementation is to its corresponding ideal model.
  arXiv  Detail & Related papers  (2024-03-22T16:49:17Z)
• Gaussian boson sampling validation via detector binning [0.0]
  We propose binned-detector probability distributions as a suitable quantity to statistically validate GBS experiments. We show how to compute such distributions by leveraging their connection with their respective characteristic function. We also illustrate how binned-detector probability distributions behave when Haar-averaged over all possible interferometric networks.
  arXiv  Detail & Related papers  (2023-10-27T12:55:52Z)
• DynGFN: Towards Bayesian Inference of Gene Regulatory Networks with GFlowNets [81.75973217676986]
  Gene regulatory networks (GRN) describe interactions between genes and their products that control gene expression and cellular function. Existing methods either focus on challenge (1), identifying cyclic structure from dynamics, or on challenge (2) learning complex Bayesian posteriors over DAGs, but not both. In this paper we leverage the fact that it is possible to estimate the "velocity" of gene expression with RNA velocity techniques to develop an approach that addresses both challenges.
  arXiv  Detail & Related papers  (2023-02-08T16:36:40Z)
• Solving Graph Problems Using Gaussian Boson Sampling [22.516585968074146]
  We use a noisy intermediate-scale quantum computer to solve graph problems. We experimentally observe the presence of GBS enhancement with large photon-click number and an enhancement under certain noise. Our work is a step toward testing real-world problems using the existing intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-02-02T08:25:47Z)
• Gaussian-boson-sampling-enhanced dense subgraph finding shows limited advantage over efficient classical algorithms [0.0]
  We investigate the effects of sources of error including loss and spectral impurity on GBS applied to dense subgraph finding algorithms. We find that the effectiveness of these algorithms is remarkably robust to errors, to such an extent that there exist efficient classical algorithms that can simulate the underlying GBS.
  arXiv  Detail & Related papers  (2023-01-30T19:00:03Z)
• Unveiling the Sampling Density in Non-Uniform Geometric Graphs [69.93864101024639]
  We consider graphs as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius. In a social network communities can be modeled as densely sampled areas, and hubs as nodes with larger neighborhood radius. We develop methods to estimate the unknown sampling density in a self-supervised fashion.
  arXiv  Detail & Related papers  (2022-10-15T08:01:08Z)
• Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
  This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM) We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
  arXiv  Detail & Related papers  (2021-05-11T03:39:08Z)
• Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding [101.35070661471124]
  We show that unobserved confounding leaves a characteristic footprint in the observed data distribution that allows for disentangling spurious and causal effects. We propose an adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems.
  arXiv  Detail & Related papers  (2021-03-28T11:07:59Z)

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.