pith. sign in

arxiv: 1509.02703 · v2 · pith:PYX4ZAKHnew · submitted 2015-09-09 · 🪐 quant-ph · cond-mat.str-el

Spin models and boson sampling

classification 🪐 quant-ph cond-mat.str-el
keywords bosonsamplingmappingmodelsquantumspinbunchingcomplexity
0
0 comments X
read the original abstract

In this work we proof that boson sampling with $N$ particles in $M$ modes is equivalent to short-time evolution with $N$ excitations in an XY model of $2N$ spins. This mapping is efficient whenever the boson bunching probability is small, and errors can be efficiently postselected. This mapping opens the door to boson sampling with quantum simulators or general purpose quantum computers, and highlights the complexity of time-evolution with critical spin models, even for very short times.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.