Validation of a noisy Gaussian boson sampler via graph theory

• URL: http://arxiv.org/abs/2306.12120v2
• Date: Sun, 12 Jan 2025 15:14:16 GMT
• Title: Validation of a noisy Gaussian boson sampler via graph theory
• Authors: Denis Stanev, Taira Giordani, Nicolò Spagnolo, Fabio Sciarrino,
• Abstract summary: photonic-based sampling machines solving the Gaussian Boson Sampling problem play a central role in the experimental demonstration of a quantum computational advantage.<n>In this work, we test the performances of the recently developed photonic machine Borealis as a sampling machine and its possible use cases in graph theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum photonic processors are emerging as promising platforms to prove preliminary evidence of quantum computational advantage towards the realization of universal quantum computers. In the context of non-universal noisy intermediate quantum devices, photonic-based sampling machines solving the Gaussian Boson Sampling problem currently play a central role in the experimental demonstration of a quantum computational advantage. In particular, the recently developed photonic machine Borealis, a large-scale instance of a programmable Gaussian Boson Sampling device encoded in the temporal modes of single photons, is available online for external users. In this work, we test the performances of Borealis as a sampling machine and its possible use cases in graph theory. We focused on the validation problem of the sampling process in the presence of experimental noise, such as photon losses, that could undermine the hardness of simulating the experiment. To this end, we used a recent protocol that exploits the connection between Guassian Boson Sampling and graphs perfect match counting. Such an approach to validation also provides connections with the open question on the effective advantage in using noisy Gaussian Boson Sampling devices for graphs similarity and isomorphism problems.

Related papers

• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Quantum machine learning with Adaptive Boson Sampling via post-selection [0.42110855444787276]
  We report the experimental implementation of quantum machine learning protocols by adding adaptivity via post-selection to a Boson Sampling platform. Our experimental results demonstrate that Adaptive Boson Sampling is a viable route towards dimension-enhanced quantum machine learning.
  arXiv  Detail & Related papers  (2025-02-27T17:32:05Z)
• Quantum computational advantage of noisy boson sampling with partially distinguishable photons [0.0]
  We identify the level of partial distinguishability noise that upholds the classical intractability of boson sampling. We find that boson sampling with on average $O(log N)$ number of distinguishable photons out of $N$ input photons maintains the equivalent complexity to the ideal boson sampling case.
  arXiv  Detail & Related papers  (2025-01-23T07:37:29Z)
• Simulating Gaussian boson sampling quantum computers [68.8204255655161]
  We briefly review recent theoretical methods to simulate experimental Gaussian boson sampling networks. We focus mostly on methods that use phase-space representations of quantum mechanics. A brief overview of the theory of GBS, recent experiments and other types of methods are also presented.
  arXiv  Detail & Related papers  (2023-08-02T02:03:31Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Simulating Gaussian Boson Sampling with Tensor Networks in the Heisenberg picture [0.9208007322096533]
  We introduce a novel method for computing the probability distribution of boson sampling based on the time evolution of tensor networks in the Heisenberg picture. Our results demonstrate the effectiveness of the method and its potential to advance quantum computing research.
  arXiv  Detail & Related papers  (2023-05-18T18:00:00Z)
• 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)
• 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)
• 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)
• Non-linear Boson Sampling [0.0]
  We introduce the adoption of non-linear photon-photon interactions in the Boson Sampling framework. By extending the computational expressivity of Boson Sampling, the introduction of non-linearities promises to disclose novel functionalities.
  arXiv  Detail & Related papers  (2021-10-26T15:41:51Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light [32.20791352792308]
  We report a new GBS experiment that produces up to 113 detection events out of a 144-mode photonic circuit. We develop a new high-brightness and scalable quantum light source, exploring the idea of stimulated squeezed photons. The photonic quantum computer, Jiuzhang 2.0, yields a Hilbert space dimension up to $1043$, and a sampling rate $1024$ faster than using brute-force simulation.
  arXiv  Detail & Related papers  (2021-06-29T16:11:29Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Boson Sampling with Gaussian input states: toward efficient scaling and certification [0.0]
  We present a practically achievable pathway to scale Boson Sampling experiments. We propose the combination of switchable dual-homodyne and single-photon detections, the temporal loop technique, and scattershot-based Boson Sampling.
  arXiv  Detail & Related papers  (2018-12-21T07:15:03Z)

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.