Generic two-qubit photonic gates implemented by number-resolving photodetection

Abstract

We combine numerical optimization techniques [Uskov et al., Phys. Rev. A 79, 042326 (2009)] with symmetries of the Weyl chamber to obtain optimal implementations of generic linear-optical KLM-type two-qubit entangling gates. We find that while any two-qubit controlled-U gate, including cnot and cs, can be implemented using only two ancilla resources with success probability S > 0.05, a generic SU (4) operation requires three unentangled ancilla photons, with success S > 0.0063. Specifically, we obtain a maximal success probability close to 0.0072 for the B gate. We show that single-shot implementation of a generic SU (4) gate offers more than an order of magnitude increase in the success probability and two-fold reduction in overhead ancilla resources compared to standard triple-cnot and double-B gate decompositions.

Translating non-trivial algorithms from the circuit model to the measurement-based quantum computing model

“…The C Z operation can be defined as, simply placing a minus sign on the terms a ∧ b or a b = 1. Experimentally this can be performed by various means with success rates of s = 2/27, s = 1/9 or by a more recent method with success of up to s = 1/2 [6,[11][12][13]. We can write this in a more useful form as,…”

Optimal encoding capacity of a linear optical quantum channel

“…The susceptibility of entangled states to decoherence and noise must be considered. Optical quantum computers are an attractive idea in this regard because photons do not strongly interact with most matter; photonic states can thus be carried over large distances [4,9].…”

Optimal entangling operations between deterministic blocks of qubits encoded into single photons

“…Indeed, the condition that entangling operations between photons be linearly accessible is generally found to be severely restricting [17][18][19][20][21][22][23].…”