Archive: February, 2014

Comment: Will boson-sampling ever disprove the Extended Church-Turing thesis?

Full text here. Boson-sampling is a highly simplified, but non-universal, approach to implementing optical quantum computation. It was shown by Aaronson & Arkhipov that this protocol cannot be efficiently classically simulated unless the polynomial hierarchy collapses, which would be a shocking result in computational complexity theory. Based on this, numerous authors have made the claim […]

» Read More

New paper: Boson sampling with photon-added coherent states

Full paper here. Boson sampling is a simple and experimentally viable model for non-universal linear optics quantum computing. Boson sampling has been shown to implement a classically hard algorithm when fed with single photons. This raises the question as to whether there are other quantum states of light that implement similarly computationally complex problems. We […]

» Read More

Get In Touch

Peter Rohde
e-mail: dr.rohde@gmail.com
Skype: peter_rohde
Twitter: @peter_rohde
LinkedIn: peterrohde
YouTube: prohde81
arXiv: Peter Rohde
Google Scholar
ResearchGate
SoundCloud: peter.rohde