Quantum optical classifier with superexponential speedup

• URL: http://arxiv.org/abs/2404.15266v1
• Date: Tue, 23 Apr 2024 17:55:49 GMT
• Title: Quantum optical classifier with superexponential speedup
• Authors: Simone Roncallo, Angela Rosy Morgillo, Chiara Macchiavello, Lorenzo Maccone, Seth Lloyd,
• Abstract summary: We present a quantum optical pattern recognition method for binary classification tasks. It classifies an object in terms of the rate of two-photon coincidences at the output of a Hong-Ou-Mandel interferometer.
• Score: 3.262230127283452
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a quantum optical pattern recognition method for binary classification tasks. Without direct image reconstruction, it classifies an object in terms of the rate of two-photon coincidences at the output of a Hong-Ou-Mandel interferometer, where both the input and the classifier parameters are encoded into single-photon states. Our method exhibits the same behaviour of a classical neuron of unit depth. Once trained, it shows a constant $\mathcal{O}(1)$ complexity in the number of computational operations and photons required by a single classification. This is a superexponential advantage over a classical neuron (that is at least linear in the image resolution). We provide simulations and analytical comparisons with analogous neural network architectures.

Related papers

• Non-binary artificial neuron with phase variation implemented on a quantum computer [0.0]
  We introduce an algorithm that generalizes the binary model manipulating the phase of complex numbers. We propose, test, and implement a neuron model that works with continuous values in a quantum computer.
  arXiv  Detail & Related papers  (2024-10-30T18:18:53Z)
• Sub-diffraction estimation, discrimination and learning of quantum states of light [0.0]
  spatial-mode demultiplexing (SPADE) has been proposed as a method to achieve sub-Rayleigh estimation. We introduce a hybrid quantum-classical image classifier that achieves sub-Rayleigh resolution.
  arXiv  Detail & Related papers  (2024-06-05T12:08:58Z)
• Towards Efficient Quantum Hybrid Diffusion Models [68.43405413443175]
  We propose a new methodology to design quantum hybrid diffusion models. We propose two possible hybridization schemes combining quantum computing's superior generalization with classical networks' modularity.
  arXiv  Detail & Related papers  (2024-02-25T16:57:51Z)
• Multilayer Multiset Neuronal Networks -- MMNNs [55.2480439325792]
  The present work describes multilayer multiset neuronal networks incorporating two or more layers of coincidence similarity neurons. The work also explores the utilization of counter-prototype points, which are assigned to the image regions to be avoided.
  arXiv  Detail & Related papers  (2023-08-28T12:55:13Z)
• Efficient qudit based scheme for photonic quantum computing [0.0]
  This work investigates qudits defined by the possible photon number states of a single photon in d > 2 optical modes. We demonstrate how to construct locally optimal non-deterministic many-qudit gates using linear optics and photon number resolving detectors. We find that the qudit cluster states require less optical modes and are encoded by a fewer number of entangled photons than the qubit cluster states with similar computational capabilities.
  arXiv  Detail & Related papers  (2023-02-14T21:41:45Z)
• Quantum Kernel Evaluation via Hong-Ou-Mandel Interference [11.270300525597227]
  We propose and simulate a protocol capable of evaluating quantum kernels using Hong-Ou-Mandel (HOM) interference. As a result, interfering two photons and using the detected coincidence counts, we can perform a direct measurement and binary classification. This physical platform confers an exponential quantum advantage also described theoretically in other works.
  arXiv  Detail & Related papers  (2022-12-22T23:55:23Z)
• Classical simulation of boson sampling based on graph structure [2.5496329090462626]
  We present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. We show that when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. We implement a likelihood test with a recent numerically Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.
  arXiv  Detail & Related papers  (2021-10-04T17:02:35Z)
• Connecting Weighted Automata, Tensor Networks and Recurrent Neural Networks through Spectral Learning [58.14930566993063]
  We present connections between three models used in different research fields: weighted finite automata(WFA) from formal languages and linguistics, recurrent neural networks used in machine learning, and tensor networks. We introduce the first provable learning algorithm for linear 2-RNN defined over sequences of continuous vectors input.
  arXiv  Detail & Related papers  (2020-10-19T15:28:00Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)
• Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approach [144.21892195917758]
  We study estimation in a class of generalized Structural equation models (SEMs) We formulate the linear operator equation as a min-max game, where both players are parameterized by neural networks (NNs), and learn the parameters of these neural networks using a gradient descent. For the first time we provide a tractable estimation procedure for SEMs based on NNs with provable convergence and without the need for sample splitting.
  arXiv  Detail & Related papers  (2020-07-02T17:55:47Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

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.