Error tolerance of the BosonSampling model for linear optics quantum computing

TL;DR

This paper investigates the robustness of BosonSampling, a simplified linear optics quantum computing model, against practical errors like loss and mode-mismatch, showing such errors do not necessarily make the system classically simulatable.

Contribution

It provides evidence that BosonSampling remains classically hard to simulate even with realistic errors, supporting its experimental feasibility.

Findings

Lossy systems are likely still classically hard to simulate.

Mode-mismatch does not significantly reduce classical hardness.

Results apply also to multi-walker quantum walk models.

Abstract

Linear optics quantum computing (LOQC) is a promising approach to implementing scalable quantum computation (QC). However, this approach has very demanding physical resource requirements. Recently, Aaronson & Arkhipov showed that a simplified model, which avoids the requirement for fast feed-forward and post-selection, while likely not capable of solving BQP-complete problems efficiently, can solve an interesting sampling problem, believed to be classically hard. Loss and mode-mismatch are the dominant sources of error in such systems. We provide evidence that even lossy systems, or systems with mode-mismatch, are likely to be classically hard to simulate. This is of practical interest to experimentalists wishing to demonstrate such systems, since it suggests that even with errors in their implementation, they are likely implementing an algorithm which is classically hard to simulate. Our results also equivalently apply to the multi-walker quantum walk model.