Optimizing linear optics quantum gates

Abstract

In this paper, the problem of finding optimal success probabilities of static linear optics quantum gates is linked to the theory of convex optimization. It is shown that by exploiting this link, upper bounds for the success probability of networks realizing single-mode gates can be derived, which hold in generality for linear optical networks followed by postselection, i.e., for networks of arbitrary size, any number of auxiliary modes, and arbitrary photon numbers. As a corollary, the previously formulated conjecture is proven that the optimal success probability of a postselected non-linear sign shift without feed-forward is 1/4, a gate playing the central role in the scheme of Knill-Laflamme-Milburn for quantum computation with linear optics. The concept of Lagrange duality is shown to be applicable to provide rigorous proofs for such bounds for elementary gates, although the original problem is a difficult non-convex problem in infinitely many objective variables. The versatility of this approach to identify other optimal linear optical schemes is demonstrated.

5 pages, RevTeX, essentially identical with version in Phys. Rev. Lett., typesetting altered to increase readability

References in corpus (8)

• Resource-efficient linear optical quantum computation
• A near deterministic linear optical CNOT gate
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• A complete family of separability criteria
• Quantum Computing Using Single Photons and the Zeno Effect
• Complete hierarchies of efficient approximations to problems in entanglement theory
• Efficiencies for the single mode operation of a quantum optical nonlinear shift gate
• On improving single photon sources via linear optics and photodetection

Cited by in corpus (31)

• Review article: Linear optical quantum computing
• Novel schemes for measurement-based quantum computation
• Measurement-based quantum computation beyond the one-way model
• Optimal entanglement witnesses for continuous-variable systems
• Hyperentangled Bell-state analysis
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Potential and limits to cluster state quantum computing using probabilistic gates
• Protecting an optical qubit against photon loss
• Photonic two-qubit parity gate with tiny cross-Kerr nonlinearity
• Optical generation of matter qubit graph states
• Maximal Success Probabilities of Linear-Optical Quantum Gates
• Quantum Optical Systems for the Implementation of Quantum Information Processing
• General linear-optical quantum state generation scheme: Applications to maximally path-entangled states
• Efficient construction of 2-D cluster states with probabilistic quantum gates
• On photonic controlled phase gates
• Experimental measurement-based quantum computing beyond the cluster-state model
• Minimal resources for linear optical one-way computing
• Semi-definite programming and quantum information
• Linear-optical implementations of the iSWAP and controlled NOT gates based on conventional detectors
• Non-linear Boson Sampling
• Cluster state preparation using gates operating at arbitrary success probabilities
• Feed-forward and its role in conditional linear optical quantum dynamics
• Generic Two-Qubit Photonic Gates Implemented by Number-Resolving Photodetection
• Measurement induced nonclassical states from coherent state heralded by Knill-Laflamme-Milburn-type SU(3) interference
• Quasiprobability methods for multimode conditional optical gates
• Percolation in quantum computation and communication
• Degree of separability of bipartite quantum states
• Implementing Non-Projective Measurements via Linear Optics: an Approach Based on Optimal Quantum State Discrimination
• Concatenated beam splitters, optical feed-forward and the nonlinear sign gate
• The effect of component variations on the gate fidelity in linear optical networks
• Building a fusion-based quantum computer using teleported gates