We explore the conditions under which identical particles in unitary linear networks behave as the other species, i.e. bosons as fermions and fermions as bosons. It is found that the Boson-Sampling computer of Aaronson & Arkhipov can be implemented in an interference experiment with non-interacting fermions in an appropriately entangled state. Moreover, a scheme is proposed which simulates the scattershot version of the Boson-Sampling computer by preparing, on the fly, the required entangled state of fermions from an unentangled one.We explore the conditions under which identical particles in unitary linear networks behave as the other species, i.e. bosons as fermions and fermions as bosons. It is found that the Boson-Sampling computer of Aaronson & Arkhipov can be implemented in an interference experiment with non-interacting fermions in an appropriately entangled state. Moreover, a scheme is proposed which simulates the scattershot version of the Boson-Sampling computer by preparing, on the fly, the required entangled state of fermions from an unentangled one.

Nov 30, 20140 citations

Interference of identical particles from entanglement to boson-sampling

Malte C. Tichy

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 many-boson and many-fermion interference required for the description of current experiments and for the understanding of novel approaches to quantum computing. The field is motivated via the two-particle case, for which the uncorrelated, classical dynamics of distinguishable particles is compared to the quantum behaviour of identical bosons and fermions. Bunching of bosons is opposed to anti-bunching of fermions, while both species constitute equivalent sources of bipartite two-level entanglement. The realms of indistinguishable and distinguishable particles are connected by a monotonic transition, on a scale defined by the coherence length of the interfering particles. As we move to larger systems, any attempt to understand many particles via the two-particle paradigm fails: In contrast to two-particle bunching and anti-bunching, the very same signatures can be exhibited by bosons and fermions, and coherent effects dominate over statistical behaviour. The simulation of many-boson interference, termed Boson-Sampling, entails a qualitatively superior computational complexity when compared to fermions. The hierarchy between bosons and fermions also characterises multipartite entanglement generation, for which bosons again clearly outmatch fermions. Finally, the quantum-to-classical transition between many indistinguishable and many distinguishable particles features non-monotonic structures. While the same physical principles govern small and large systems, the deployment of the intrinsic complexity of collective many-body interference makes more particles behave differently.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 many-boson and many-fermion interference required for the description of current experiments and for the understanding of novel approaches to quantum computing. The field is motivated via the two-particle case, for which the uncorrelated, classical dynamics of distinguishable particles is compared to the quantum behaviour of identical bosons and fermions. Bunching of bosons is opposed to anti-bunching of fermions, while both species constitute equivalent sources of bipartite two-level entanglement. The realms of indistinguishable and distinguishable particles are connected by a monotonic transition, on a scale defined by the coherence length of the interfering particles. As we move to larger systems, any attempt to understand many particles via the two-particle paradigm fails: In contrast to two-particle bunching and anti-bunching, the very same signatures can be exhibited by bosons and fermions, and coherent effects dominate over statistical behaviour. The simulation of many-boson interference, termed Boson-Sampling, entails a qualitatively superior computational complexity when compared to fermions. The hierarchy between bosons and fermions also characterises multipartite entanglement generation, for which bosons again clearly outmatch fermions. Finally, the quantum-to-classical transition between many indistinguishable and many distinguishable particles features non-monotonic structures. While the same physical principles govern small and large systems, the deployment of the intrinsic complexity of collective many-body interference makes more particles behave differently.

arXiv:1312.4266Journal of Physics B Atomic Molecular and Optical PhysicsMay 7, 201496 citations

Efficient Certification of Boson Sampling in Waveguide Lattices with parity-like Symmetry

Christoph Dittel, Robert Keil, Malte C. Tichy +6 more

The goal of universal quantum computing that challenges classical computation is still far from being reached. However, Aaronson and Arkhipov recently proposed a nonuniversal quantum computer [1] to solve sampling problems of identical bosons in linear-optical networks which are intractable for classical computers. Once outperforming the classically computable limit of such a boson-sampling device, the very hardness of boson sampling excludes any straightforward efficient verification of the results. A computationally accessible while physically non-trivial instance of the problem was proposed to prove many-particle interference and thereby benchmark the functionality of a candidate device [2]. However, the Fourier matrix proposed in [2] is a highly artificial singular case that remains challenging to implement experimentally.The goal of universal quantum computing that challenges classical computation is still far from being reached. However, Aaronson and Arkhipov recently proposed a nonuniversal quantum computer [1] to solve sampling problems of identical bosons in linear-optical networks which are intractable for classical computers. Once outperforming the classically computable limit of such a boson-sampling device, the very hardness of boson sampling excludes any straightforward efficient verification of the results. A computationally accessible while physically non-trivial instance of the problem was proposed to prove many-particle interference and thereby benchmark the functionality of a candidate device [2]. However, the Fourier matrix proposed in [2] is a highly artificial singular case that remains challenging to implement experimentally.

European Quantum Electronics Conference (EQEC)Jun 21, 20150 citations

Entanglement swapping by particle indistinguishability

Alessia Castellini, Bruno Bellomo, Giuseppe Compagno +1 more

Entanglement swapping represents an important protocol for transferring information within quantum networks. Here we present a scheme to implement entanglement swapping with independently-prepared identical particles (bosons or fermions), exploiting the indistinguishability due to their spatial overlap. In this protocol no initial entangled pairs are required and, for fermions, even Bell state measurements have not to be performed. These features constitute both a conceptual and practical advance compared to the standard procedure. The scheme is straightforwardly extended to multiple swapping, which is basic for quantum repeaters and relays in quantum information processing.Entanglement swapping represents an important protocol for transferring information within quantum networks. Here we present a scheme to implement entanglement swapping with independently-prepared identical particles (bosons or fermions), exploiting the indistinguishability due to their spatial overlap. In this protocol no initial entangled pairs are required and, for fermions, even Bell state measurements have not to be performed. These features constitute both a conceptual and practical advance compared to the standard procedure. The scheme is straightforwardly extended to multiple swapping, which is basic for quantum repeaters and relays in quantum information processing.

Dec 5, 20180 citations

Sufficient condition for the mode mismatch of single photons for scalability of the boson-sampling computer

V. S. Shchesnovich

The boson sampler proposed by Aaronson and Arkhipov is a nonuniversal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of a linear unitary optical network with indistinguishable single photons at the input. Four experimental groups have already tested their small-scale prototypes with up to four photons. A boson sampler with a few dozens of single photons is believed to be hard to simulate on a classical computer. For scalability of a realistic boson sampler with current technology it is necessary to know the effect of the photon mode mismatch on its operation. Here a nondeterministic model of the boson sampler is analyzed, which employs partially indistinguishable single photons emitted by identical sources. A sufficient condition on the average mutual fidelity $\ensuremath{\langle}\mathcal{F}\ensuremath{\rangle}$ of the single photons is found, which guarantees that the realistic boson sampler outperforms the classical computer. Moreover, the boson-sampler computer with partially indistinguishable single photons is scalable and has more power than classical computers when the single-photon mode mismatch $1\ensuremath{-}\ensuremath{\langle}\mathcal{F}\ensuremath{\rangle}$ scales as $O({N}^{\ensuremath{-}3/2})$ with the total number of photons $N$ .The boson sampler proposed by Aaronson and Arkhipov is a nonuniversal quantum computer, which can serve as evidence against the extended Church-Turing thesis. It samples the probability distribution at the output of a linear unitary optical network with indistinguishable single photons at the input. Four experimental groups have already tested their small-scale prototypes with up to four photons. A boson sampler with a few dozens of single photons is believed to be hard to simulate on a classical computer. For scalability of a realistic boson sampler with current technology it is necessary to know the effect of the photon mode mismatch on its operation. Here a nondeterministic model of the boson sampler is analyzed, which employs partially indistinguishable single photons emitted by identical sources. A sufficient condition on the average mutual fidelity $\ensuremath{\langle}\mathcal{F}\ensuremath{\rangle}$ of the single photons is found, which guarantees that the realistic boson sampler outperforms the classical computer. Moreover, the boson-sampler computer with partially indistinguishable single photons is scalable and has more power than classical computers when the single-photon mode mismatch $1\ensuremath{-}\ensuremath{\langle}\mathcal{F}\ensuremath{\rangle}$ scales as $O({N}^{\ensuremath{-}3/2})$ with the total number of photons $N$.

arXiv:1311.6796Physical Review AFeb 24, 201472 citations

An atomic boson sampler

Aaron W. Young, Shawn Geller, William J. Eckner +4 more

Abstract 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 ac- cording to programmable, non-interacting dynamics [1]. Here, we demonstrate a new combination of tools for implementing boson sampling using ultracold atoms in a two-dimensional, tunnel-coupled optical lattice. These tools include fast and programmable preparation of large ensembles of nearly identical bosonic atoms (99.5+0.5 −1.6% indistinguishability) by means of rearrangement with optical tweezers and high-fidelity optical cooling, propagation for variable evolution time in the lattice with low loss (5.0(2) %, independent of evolution time), and high fidelity detection of the atom positions after their evolution (typically 99.8(1) %). With this system, we study specific instances of boson sampling involving up to 180 atoms distributed among ∼ 1000 sites in the lattice. Direct verifi- cation of a given boson sampling distribution is not feasible in this regime. Instead, we introduce and perform targeted tests to determine the indistinguishability of the prepared atoms, to char- acterize the applied family of single particle unitaries, and to observe expected bunching features due to interference for a large range of atom numbers. When extended to interacting systems, our work demonstrates the core capabilities required to directly assemble ground and excited states in simulations of various Hubbard models [2, 3].Abstract 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 ac- cording to programmable, non-interacting dynamics [1]. Here, we demonstrate a new combination of tools for implementing boson sampling using ultracold atoms in a two-dimensional, tunnel-coupled optical lattice. These tools include fast and programmable preparation of large ensembles of nearly identical bosonic atoms (99.5+0.5 −1.6% indistinguishability) by means of rearrangement with optical tweezers and high-fidelity optical cooling, propagation for variable evolution time in the lattice with low loss (5.0(2) %, independent of evolution time), and high fidelity detection of the atom positions after their evolution (typically 99.8(1) %). With this system, we study specific instances of boson sampling involving up to 180 atoms distributed among ∼ 1000 sites in the lattice. Direct verifi- cation of a given boson sampling distribution is not feasible in this regime. Instead, we introduce and perform targeted tests to determine the indistinguishability of the prepared atoms, to char- acterize the applied family of single particle unitaries, and to observe expected bunching features due to interference for a large range of atom numbers. When extended to interacting systems, our work demonstrates the core capabilities required to directly assemble ground and excited states in simulations of various Hubbard models [2, 3].

arXiv:2307.06936NatureMay 8, 202440 citations

N