Related papers: Beyond Boson Sampling: Higher Spin Sampling as a P…
We introduce a quantum algorithm for efficient biased sampling of the rare events generated by classical memoryful stochastic processes. We show that this quantum algorithm gives an extreme advantage over known classical biased sampling…
Boson sampling is a sub-universal model used to show quantum speed-up. However, the methods of validation to prove quantum speedup are not robust and accurate. All verification methods involve additional or little studied assumptions. Here,…
The boson sampling problem has brought a lot of attention in the quantum information field because it is not efficiently solvable with a classical computer; nonetheless it can be implemented with linear optical interferometers with…
We consider an ensemble of trapped atoms interacting with a continuous wave laser field. For sufficiently polarized atoms and for a polarized light field, we may approximate the non-classical components of the collective spin angular…
Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps for proving classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide''…
We have recently seen the first plausible claims for quantum advantage using sampling problems such as random circuit sampling and Gaussian boson sampling. The obvious next step is to channel the potential quantum advantage to solving…
We investigate the notion of "macroscopicity" in the case of large quantum spin systems and provide two main results. First, we motivate the Fisher information as a measure for the macroscopicity of quantum states. Second, we compare the…
Sampling the stationary points of a complicated potential energy landscape is a challenging problem. Here we introduce a sampling method based on relaxation from stationary points of the highest index of the Hessian matrix. We illustrate…
The boson sampling problem has triggered a lot of interest in the scientific community because of its potential of demonstrating the computational power of quantum interference without the need of non-linear processes. However, the…
Sampling all ground states of a Hamiltonian with equal probability is a desired feature of a sampling algorithm, but recent studies indicate that common variants of transverse field quantum annealing sample the ground state subspace…
Boson sampling is a specialised algorithm native to the quantum photonic platform developed for near-term demonstrations of quantum advantage over classical computers. While clear useful applications for such near-term pre-fault-tolerance…
The study of non-equilibrium dynamics is one of the most important challenges of modern quantum many-body physics, in relationship with fundamental questions in quantum statistical mechanics, as well as with the fields of quantum simulation…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a non-programmable linear interferometer and threshold detectors on up to 144 output modes (see Refs.~\onlinecite{zhong_quantum_2020,zhong2021phase}). Here we…
The number of parameters describing a quantum state is well known to grow exponentially with the number of particles. This scaling clearly limits our ability to do tomography to systems with no more than a few qubits and has been used to…
Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In the present work, we examine…
We describe an efficient, scalable Gaussian boson sampler based on a classical description of squeezed quantum light and a deterministic model of single-photon detectors that click when the incident amplitude falls above a given threshold.…
Investigations of spin squeezing in ensembles of quantum particles have been limited primarily to a subspace of spin fluctuations and a single spatial mode in high-spin and spatially extended ensembles. Here, we show that a wider range of…
We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We…
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…