Related papers: Classical simulation of non-Gaussian bosonic circu…
Boson sampling is a fundamentally and practically important task that can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In this work, we present classical sampling algorithms for single-photon and…
Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a two-dimensional temporal continuous-variable cluster state. We first…
Gaussian boson sampling (GBS) is considered a candidate problem for demonstrating quantum advantage. We propose an algorithm for approximate classical simulation of a lossy GBS instance. The algorithm relies on the Taylor series expansion,…
To understand quantum optics experiments, we must perform calculations that consider the principal sources of noise, such as losses, spectral impurity and partial distinguishability. In both discrete and continuous variable systems, these…
Bayesian Optimization using Gaussian Processes is a popular approach to deal with the optimization of expensive black-box functions. However, because of the a priori on the stationarity of the covariance matrix of classic Gaussian…
As a promising candidate for exhibiting quantum computational supremacy, Gaussian Boson Sampling (GBS) is designed to exploit the ease of experimental preparation of Gaussian states. However, sufficiently large and inevitable experimental…
The development of emerging technologies in quantum optics demands accurate models that faithfully capture genuine quantum effects. Mature semiclassical approaches reach their limits when confronted with quantized electromagnetic fields,…
We present conditions for the efficient simulation of a broad class of optical quantum circuits on a classical machine: this class includes unitary transformations, amplification, noise, and measurements. Various proposed schemes for…
We introduce an exact classical algorithm for simulating Gaussian Boson Sampling (GBS). The complexity of the algorithm is exponential in the number of photons detected, which is itself a random variable. For a fixed number of modes, the…
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the…
The effective description of a bosonic quantum system identifies the minimum finite dimension required to capture its essential dynamics. This effective dimension plays an important role in the complexity of classical and quantum algorithms…
We present a method to systematically identify and classify quantum optical non-classical states as classical/non-classical based on the resources they create on a bosonic quantum computer. This is achieved by converting arbitrary bosonic…
Bosonic Gaussian unitaries are fundamental building blocks of central continuous-variable quantum technologies such as quantum-optic interferometry and bosonic error-correction schemes. In this work, we present the first time-efficient…
This work explores displaced fermionic Gaussian operators with nonzero linear terms. We first demonstrate equivalence between several characterizations of displaced Gaussian states. We also provide an efficient classical simulation protocol…
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and active Bogoliubov transformations as effected by…
The Feynman path integral formalism has inspired the development of memory-efficient and parallelizable classical algorithms for simulating quantum computers. We adapt this approach for the calculation of probability amplitudes of…
Bosonic Gaussian states are ubiquitous in quantum optics and condensed matter physics. While they are efficiently handled within the Gaussian formalism, sampling requires calculating amplitudes in the boson occupation basis. This step,…
Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be…
We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the…