Related papers: Boson-Sampling with non-interacting fermions
Progress in the reliable preparation, coherent propagation and efficient detection of many-body states has recently brought collective quantum phenomena of many identical particles into the spotlight. This tutorial introduces the physics of…
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…
Universal quantum computers promise a dramatic speed-up over classical computers but a full-size realization remains challenging. However, intermediate quantum computational models have been proposed that are not universal, but can solve…
It was suggested that two entangled fermions can behave like a single boson and that the bosonic quality is proportional to the degree of entanglement between the two particles. The relation between bosonic quality and entanglement is quite…
Analyzing the properties of complex quantum systems is crucial for further development of quantum devices, yet this task is typically challenging and demanding with respect to required amount of measurements. A special attention to this…
A boson sampler implements a restricted model of quantum computing. It is defined by the ability to sample from the distribution resulting from the interference of identical bosons propagating according to programmable, non-interacting…
A boson sampling device is a specialised quantum computer that solves a problem which is strongly believed to be computationally hard for classical computers. Recently a number of small-scale implementations have been reported, all based on…
In contrast to classical physics, quantum mechanics divides particles into two classes-bosons and fermions-whose exchange statistics dictate the dynamics of systems at a fundamental level. In two dimensions quasi-particles known as 'anyons'…
We study the necessary conditions for bosons composed of two distinguishable fermions to exhibit bosonic-like behaviour. We base our analysis on tools of quantum information theory such as entanglement and the majorization criterion for…
Boson-sampling has attracted much interest as a simplified approach to implementing a subset of optical quantum computing. Boson-sampling requires indistinguishable photons, but far fewer of them than universal optical quantum computing…
Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of…
Boson-Sampling is a classically computationally hard problem that can - in principle - be efficiently solved with quantum linear optical networks. Very recently, a rush of experimental activity has ignited with the aim of developing such…
An even number of fermions can behave in a bosonic way. The simplest scenario involves two fermions which can form a single boson. But four fermions can either behave as two bipartite bosons or further assemble into a single four-partite…
In the context of quantum information, highly nonlinear regimes, such as those supporting solitons, are marginally investigated. We miss general methods for quantum solitons, although they can act as entanglement generators or as…
A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the…
BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. In arXiv:1306.3995, Gogolin et al. claimed that even an ideal…
Photons naturally solve the BosonSampling problem: sample the outputs of a multi-photon experiment in a linear-optical interferometer. This is strongly believed to be hard to do on a classical computer, and motivates the development of…
It is found that identical bosons (fermions) show generalized bunching (antibunching) property in linear networks: The absolute maximum (minimum) of probability that all $N$ input particles are detected in a subset of $\mathcal{K}$ output…
It is well known that bosons and fermions exhibit opposite behaviors when experiencing interference, in the sense that bosons have a tendency to bunch whereas fermions have a tendency to antibunch. Recently, this complementarity was…
The boson sampler proposed by Aaronson and Arkhipov is a non-universal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of linear unitary optical…