Related papers: Boson Sampling for Generalized Bosons
Gaussian boson sampling (GBS), a computational problem conjectured to be hard to simulate on a classical machine, has been at the forefront of recent years' experimental and theoretical efforts to demonstrate quantum advantage. The…
We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide…
Boson Sampling is a computational paradigm representing one of the most viable and pursued approaches to demonstrate the regime of quantum advantage. Recent results have demonstrated significant technological leaps in single-photon…
Bayesian Poisson probability distributions for the average n can be analytically converted into equivalent chi-squared distributions. These can then be combined with other Gaussian or Bayesian Poisson distributions to make a total…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
It is known that, by accounting for the multiboson interferences up to a finite order, the output distribution of noisy Boson Sampling, with distinguishability of bosons serving as noise, can be approximately sampled from in a time…
When the problem of boson sampling was first proposed, it was assumed that little or no photon collisions occur. However, modern experimental realizations rely on setups where collisions are quite common, i.e. the number of photons $M$…
The determination of the computational complexity of the boson sampling problem with single boson sources has opened a novel research direction in the quantum computing field. Some research effort has also been devoted towards the use of…
Since the basic theoretical framework of generalized Hamilton system is not perfect and complete, there are often some practical problems that can not be expressed by generalized Hamilton system. The generalized gradient operator is defined…
We show that a theory of complex scattering between many-body (Fock) states can be constructed such that its classical limit is a canonical transformation thus encoding quantum interference in the semiclassical form of the associated…
Boson sampling can simulate physical problems for which classical simulations are inefficient. However, not all problems simulated by boson sampling are classically intractable. We consider a situation in which it is known that the outcome…
A generalized sampling theorem for frequency localized signals is presented. The generalization in the proposed model of sampling is twofold: (1) It applies to various prefilters effecting a "soft" bandlimitation, (2) an approximate…
We use a noncommutative generalization of Fourier analysis to define a broad class of pseudo-probability representations, which includes the known bosonic and discrete Wigner functions. We characterize the groups of quantum unitary…
Quantum computation, aiming at tackling hard problems beyond classical approaches, has been flourishing with each passing day. Unfortunately, a fully scalable and fault-tolerant universal quantum computer remains challenging based on the…
We address the problem of the bosonization of finite fermionic systems with two different approaches. First we work in the path integral formalism, showing how a truly bosonic effective action can be derived from a generic fermionic one…
Factorial moments and cumulants are usually defined with respect to the unconditioned Poisson process. Conditioning a sample by selecting events of a given overall multiplicity $N$ necessarily introduces correlations. By means of Edgeworth…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
We describe a general conjecture on how one may derive from the generic bosonic case all structural properties of multivariate diagonal coinvariant modules in $k$ sets of $n$ commuting variables (bosons), and $j$ sets of $n$ anticommuting…
The aim of this paper is to clarify the conceptual difference which exists between the interactions of composite bosons and the interactions of elementary bosons. A special focus is made on the physical processes which are missed when…
Boson is one of the most basic types of particles and preserves the commutation relation. An efficient way to measure a bosonic system is important not only for simulating complex physics phenomena of bosons (such as nuclei) on a qubit…