Related papers: Upper bounds on success probabilities in linear op…
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theory. One of such examples is exceptional configuration phenomenon -- it appears that it may be much harder to find any of two or more marked…
In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known.…
We describe a simple scheme for implementing the non-linear sign gate of Knill, Laflamme and Milburn (Nature, {\bf 409}, 46-52, Jan. 4 (2001)) which forms the basis of an experiment underway at the University of Vienna.
In this paper, with the weak cross-Kerr nonlinearity, we first present a special experimental scheme called C-path gate with which the realization of all possible bipartite POVMs of two-photon polarization states can be simpler and nearly…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…
We present a linear-optical scheme for a controlled-phase gate with tunable phase shift programmed by a qubit state. In contrast to all previous tunable controlled-phase gates, the phase shift is not hard-coded into the optical setup, but…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore,…
Knill, Laflamme, and Milburn [Nature 409, 46 (2001)] showed that linear optics techniques could be used to implement a nonlinear sign gate. They also showed that two of their nonlinear sign gates could be combined to implement a…
We use the numerical optimization techniques of Uskov et al. [PRA 81, 012303 (2010)] to investigate the behavior of the success rates for KLM style [Nature 409, 46 (2001)] two- and three-qubit entangling gates. The methods are first…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
We examine three possible implementations of non-deterministic linear optical cnot gates with a view to an in-principle demonstration in the near future. To this end we consider demonstrating the gates using currently available sources such…
This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate…
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to two times using a tunable controlled-phase gate. On the platform of linear optics,…
Linear optics is a promising candidate to enable the construction of quantum computers. A number of quantum protocols gates based on linear optics have been demonstrated. However, it is well-known that these gates are non-deterministic and…
Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…
We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive…
We study the class of two qubit gates which can be achieved using only linear optical elements (beam splitters and phase shifters) and post-selection. We are able to exactly characterize this set, and find that it is impossible to implement…