General linear-optical quantum state generation scheme: Applications to maximally path-entangled states

Abstract

We introduce schemes for linear-optical quantum state generation. A quantum state generator is a device that prepares a desired quantum state using product inputs from photon sources, linear-optical networks, and post-selection using photon counters. We show that this device can be concisely described in terms of polynomial equations and unitary constraints. We illustrate the power of this language by applying the Gröbner-basis technique along with the notion of vacuum extensions to solve the problem of how to construct a quantum state generator analytically for any desired state, and use methods of convex optimization to identify bounds to success probabilities. In particular, we disprove a conjecture concerning the preparation of the maximally path-entangled NOON-state by providing a counterexample using these methods, and we derive a new upper bound on the resources required for NOON-state generation.

Maximal success probabilities of linear-optical quantum gates

“…The tradeoff in this measurement-assisted scheme is that the gate is properly implemented only when the measurement yields a positive outcome, i.e., the gate is non-deterministic. Soon after the KLM scheme became a paradigm for linear optical quantum computation (LOQC), it became clear that there is a general unresolved theoretical problem of finding the optimal implementation for a desired quantum transformation [5].…”

“…The tradeoff in this measurement-assisted scheme is that the gate is properly implemented only when the measurement yields a positive outcome, i.e., the gate is non-deterministic. Soon after the KLM scheme became a paradigm for linear optical quantum computation (LOQC), it became clear that there is a general unresolved theoretical problem of finding the optimal implementation for a desired quantum transformation [5].For the nonlinear sign (NS) gate, which acts on photons in a single optical mode, α 0 |0 + α 1 |1 + α 2 |2 → α 0 |0 + α 1 |1 − α 2 |2 , the maximum success probability without feed-forward has been theoretically proved to be 1/4 [6]. Here we focus on more complicated gates, taking as examples the two-qubit controlled sign (CS) gate (equivalently, the CNOT gate), and the three-qubit Toffoli gate.…”

“…This question may be answered straightforwardly by repeating the above optimization with (N c + N a + N v ) × (N c + N a + N v ) unitary matrices U, for various values of N v . However, there exists an alternative "unitary dilation" approach [5].…”

“…Here we focus on more complicated gates, taking as examples the two-qubit controlled sign (CS) gate (equivalently, the CNOT gate), and the three-qubit Toffoli gate. For these physically important gates, existing theoretical results are limited to upper or lower bounds on the success probability [1,7,8].A linear-optical quantum gate, or state generator (LO-QSG) [5], can be viewed formally as a device implementing a contraction transformation (for ideal detectors) that converts pure input states into desired pure output states. The goal of the optimization problem is to find a proper linear optical network (see Fig.…”

“…A linear-optical quantum gate, or state generator (LO-QSG) [5], can be viewed formally as a device implementing a contraction transformation (for ideal detectors) that converts pure input states into desired pure output states. The goal of the optimization problem is to find a proper linear optical network (see Fig.…”