Abstract
We study the sampling complexity of a probability distribution associated with an ensemble of identical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice. With uniform nearest-neighbor hopping we show that one can efficiently sample the distribution for times logarithmic in the size of the system, while for longer times there is no known efficient sampling algorithm. With time-dependent hopping and optimal control, we design the time evolution to approximate an arbitrary Haar-random unitary map analogous to that designed for photons in a linear optical network. This approach highlights a route to generating quantum complexity by optimal control only of a single-body unitary matrix. We study this in the context of two potential experimental realizations: a spinor optical lattice of ultracold atoms and a quantum gas microscope.
| Original language | English |
|---|---|
| Article number | 055003 |
| Pages (from-to) | 1-13 |
| Number of pages | 13 |
| Journal | New Journal of Physics |
| Volume | 21 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1 May 2019 |
| Externally published | Yes |
Bibliographical note
© 2019 The Author(s). Published by IOP Publishing Ltd on behalf of the Institute of Physics and Deutsche Physikalische Gesellschaft. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.Keywords
- Boson sampling
- optical lattice and traps
- quantum gas microscopes
- quantum simulation
- quantum walks
Fingerprint
Dive into the research topics of 'Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver