Resources for bosonic quantum computational advantage

• URL: http://arxiv.org/abs/2207.11781v3
• Date: Tue, 4 Apr 2023 14:22:03 GMT
• Title: Resources for bosonic quantum computational advantage
• Authors: Ulysse Chabaud and Mattia Walschaers
• Abstract summary: We show that every bosonic quantum computation can be recast into a continuous-variable sampling computation. We derive a general classical algorithm for the strong simulation of bosonic computations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers promise to dramatically outperform their classical counterparts. However, the non-classical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle interplay of many that can be held responsible for these potential advantages. In this work, we show that every bosonic quantum computation can be recast into a continuous-variable sampling computation where all computational resources are contained in the input state. Using this reduction, we derive a general classical algorithm for the strong simulation of bosonic computations, whose complexity scales with the non-Gaussian stellar rank of both the input state and the measurement setup. We further study the conditions for an efficient classical simulation of the associated continuous-variable sampling computations and identify an operational notion of non-Gaussian entanglement based on the lack of passive separability, thus clarifying the interplay of bosonic quantum computational resources such as squeezing, non-Gaussianity and entanglement.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Phase-space negativity as a computational resource for quantum kernel methods [2.5499055723658097]
  Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning. We provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems. Our results underpin the role of the negativity in phase-space quasi-probability distributions as an essential resource in quantum machine learning.
  arXiv  Detail & Related papers  (2024-05-20T21:18:53Z)
• Towards Quantum Computational Mechanics [1.530480694206666]
  We show how quantum computing can be used to solve representative element volume (RVE) problems in computational homogenisation. Our quantum RVE solver attains exponential acceleration with respect to classical solvers.
  arXiv  Detail & Related papers  (2023-12-06T12:53:02Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Retrodictive Quantum Computing [0.6445605125467572]
  We show how to exploit retrodictive quantum computing at scale. We solve instances of the quantum Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's algorithms.
  arXiv  Detail & Related papers  (2022-05-12T20:12:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Resource-efficient encoding algorithm for variational bosonic quantum simulations [0.0]
  In the Noisy Intermediate Scale Quantum (NISQ) era of quantum computing, quantum resources are limited. We present a resource-efficient quantum algorithm for bosonic ground and excited state computations.
  arXiv  Detail & Related papers  (2021-02-23T19:00:05Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)
• Quantum reservoir computing with a single nonlinear oscillator [0.0]
  We propose continuous variable quantum reservoir computing in a single nonlinear oscillator. We demonstrate quantum-classical performance improvement, and identify its likely source: the nonlinearity of quantum measurement. We study how the performance of our quantum reservoir depends on Hilbert space dimension, how it is impacted by injected noise, and briefly comment on its experimental implementation.
  arXiv  Detail & Related papers  (2020-04-30T17:14:34Z)

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.