A heavy focus for optical quantum computing is the introduction of error correction, and the minimization of resource requirements. We detail a complete encoding and manipulation scheme designed for circuit-model linear optics quantum computing, incorporating scalable operations and loss-tolerant architecture. We also calculate loss thresholds for the gate systems described, with an efficiency of
83 required for the single-qubit operations, and
90 for the two-qubit controlled-NOT gate.
Implementation of quantum logic gates with linear optical elements plays a prominent role in quantum computing due to the relatively easier manipulation and realization. We present efficient schemes to implement controlled-NOT (CNOT) gate and controlled-swap (Fredkin) gate by solely using linear optics. We encode the control qubits and target qudits in photonic polarization (two-level) and spatial degrees of freedom (
d-level), respectively. Based on the hybrid encoding, CNOT and Fredkin gates are constructed in a deterministic way without any borrowed ancillary photons or measurement-induced nonlinearities. Remarkably, the number of linear optics required to implement a CNOT gate has been reduced to one polarization beam splitter (PBS), while only
d PBSs are necessary to implement a generalized Fredkin gate. The optical depths of all schemes are reduced to one and dimension-independent. Besides, the fidelity of our three-qubit Fredkin gate is higher than 99.7\% under realistic conditions, which is higher than the previous schemes.
This paper reports on work to parallelize QC-lib, a C++ library for the simulation of quantum computers at an abstract functional level. After a brief introduction to quantum computing, we give an outline of QC-lib, then describe the parallelization using MPI of the general single qubit gate and the controlled-NOT gate (CNOT). Although QC-lib also implements other gates, this combination is already universal for quantum computing, and has allowed us to implement Grover's quantum search algorithm as a test case. We present some performance measurements made on a Beowulf cluster, which show reasonable speedups for Grover's algorithm.