A simple scheme for universal linear optics quantum computing with constant experimental complexity using fiber-loops
arXiv:1410.0433 · doi:10.1103/PhysRevA.91.012306
Abstract
Recently, Motes, Gilchrist, Dowling & Rohde [Phys. Rev. Lett. 113, 120501 (2014)] presented a scheme for photonic boson-sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full, universal linear optics quantum computing, in various incarnations. The scheme employs two embedded fiber-loops, a single push-button photon source, three dynamically controlled beamsplitters, and a single time-resolved photo-detector. The architecture has only a single point of interference, and thus may be significantly easier to align than other schemes. The experimental complexity of the scheme is constant, irrespective of the size of the computation, limited only by fiber lengths and their respective loss rates.
References in corpus (7)
- Resource-efficient linear optical quantum computation
- Photonic Boson Sampling in a Tunable Circuit
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Scalable boson-sampling with time-bin encoding using a loop-based architecture
- Potential and limits to cluster state quantum computing using probabilistic gates
- Error models for mode-mismatch in linear optics quantum computing
- Strategies for the preparation of large cluster states using non-deterministic gates