Gaussian Boson Sampling for binary optimization

• URL: http://arxiv.org/abs/2312.07235v1
• Date: Tue, 12 Dec 2023 13:00:55 GMT
• Title: Gaussian Boson Sampling for binary optimization
• Authors: Jean Cazalis (1), Yahui Chai (2), Karl Jansen (2 and 3), Stefan K\"uhn (2), Tirth Shah (1) ((1) Q.ANT GmbH, (2) CQTA, Deutsches Elektronen-Synchrotron DESY, (3) Cyprus Institute)
• Abstract summary: We employ a Variational Quantum Eigensolver approach using the Conditional Value-at-risk cost function. We provide proof of principle by carrying out numerical simulations on randomly generated instances.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this study, we consider a Gaussian Boson Sampler for solving a Flight Gate Assignment problem. We employ a Variational Quantum Eigensolver approach using the Conditional Value-at-risk cost function. We provide proof of principle by carrying out numerical simulations on randomly generated instances.

Related papers

• The Gaussian Latent Machine: Efficient Prior and Posterior Sampling for Inverse Problems [19.914084083626694]
  We show that a product-of-experts-type model can be easily lifted into a novel latent variable model.<n>This leads to a general sampling approach that unifies and generalizes many existing sampling algorithms.
  arXiv  Detail & Related papers  (2025-05-19T08:21:23Z)
• Using Gaussian Boson Samplers to Approximate Gaussian Expectation Problems [0.0]
  We show that two estimators using GBS samples can bring an exponential speedup over the plain Monte Carlo (MC) estimator. Precisely speaking, the exponential speedup is defined in terms of the guaranteed sample size for these estimators to reach the same level of accuracy.
  arXiv  Detail & Related papers  (2025-02-26T17:30:49Z)
• Gaussian boson sampling for binary optimization [0.0]
  We propose to use a parametrized Gaussian Boson Sampler (GBS) with threshold detectors to address binary optimization problems. Numerical experiments on 3-SAT and Graphing problems show significant performance gains over random guessing.
  arXiv  Detail & Related papers  (2024-12-19T12:12:22Z)
• Variational Tensor Network Simulation of Gaussian Boson Sampling and Beyond [0.0]
  We propose a classical simulation tool for general continuous variable sampling problems. We reformulate the sampling problem as that of finding the ground state of a simple few-body Hamiltonian. We validate our method by simulating Gaussian Boson Sampling, where we achieve results comparable to the state of the art.
  arXiv  Detail & Related papers  (2024-10-24T13:43:06Z)
• Classical modelling of a lossy Gaussian bosonic sampler [0.0]
  We propose an algorithm for approximate classical simulation of a lossy GBS instance. The complexity of the algorithm is squeezing the number of modes given the number of terms is fixed. In recent experiments that claim to have demonstrated quantum advantage, these conditions are satisfied.
  arXiv  Detail & Related papers  (2024-04-01T09:19:27Z)
• Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling [2.5496329090462626]
  We present a quantum-inspired classical algorithm that can be used for graph-theoretical problems. A given graph's adjacency matrix to be encoded in a Gaussian boson sampler is nonnegative, which does not necessitate quantum interference.
  arXiv  Detail & Related papers  (2023-02-01T16:02:31Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Certification of Gaussian Boson Sampling via graph theory [4.063872661554895]
  We exploit a connection between photon counting of a genuine Gaussian Boson Sampling device and the number of perfect matchings in a graph. Within this framework, two approaches that exploit the distributions of graph feature vectors and graph kernels are presented.
  arXiv  Detail & Related papers  (2022-02-15T20:22:28Z)
• Sensing Cox Processes via Posterior Sampling and Positive Bases [56.82162768921196]
  We study adaptive sensing of point processes, a widely used model from spatial statistics. We model the intensity function as a sample from a truncated Gaussian process, represented in a specially constructed positive basis. Our adaptive sensing algorithms use Langevin dynamics and are based on posterior sampling (textscCox-Thompson) and top-two posterior sampling (textscTop2) principles.
  arXiv  Detail & Related papers  (2021-10-21T14:47:06Z)
• Quantum Sub-Gaussian Mean Estimator [0.0]
  We present a new quantum algorithm for estimating the mean of a real-valued random variable. Our estimator achieves a nearly-optimal quadratic speedup over the number of classical i.i.d. samples.
  arXiv  Detail & Related papers  (2021-08-27T08:34:26Z)
• Pathwise Conditioning of Gaussian Processes [72.61885354624604]
  Conventional approaches for simulating Gaussian process posteriors view samples as draws from marginal distributions of process values at finite sets of input locations. This distribution-centric characterization leads to generative strategies that scale cubically in the size of the desired random vector. We show how this pathwise interpretation of conditioning gives rise to a general family of approximations that lend themselves to efficiently sampling Gaussian process posteriors.
  arXiv  Detail & Related papers  (2020-11-08T17:09:37Z)
• Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring [91.22679787578438]
  We present a novel Thompson-sampling-based algorithm for partial monitoring. We prove that the new algorithm achieves the logarithmic problem-dependent expected pseudo-regret $mathrmO(log T)$ for a linearized variant of the problem with local observability.
  arXiv  Detail & Related papers  (2020-06-17T05:48:33Z)
• Stochastic Saddle-Point Optimization for Wasserstein Barycenters [69.68068088508505]
  We consider the populationimation barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. We employ the structure of the problem and obtain a convex-concave saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose an optimization algorithm and estimate its complexity.
  arXiv  Detail & Related papers  (2020-06-11T19:40:38Z)

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.