A simple encoding of a quantum circuit amplitude as a matrix permanent

A simple construction is presented which allows computing the transition amplitude of a quantum circuit to be encoded as computing the permanent of a matrix which is of size proportional to the number of quantum gates in the circuit. This opens up some interesting classical monte-carlo algorithms for approximating quantum circuits.Comment: 6 figure

Some Remarks on the Matching Polynomial and Its Zeros

The matching polynomial (also called reference and acyclic polynomial) was discovered in chemistry, physics and mathematics at least six times. We demonstrate that the matching polynomial of a bipartite graph coincides with the rook polynomial of a certain board. The basic notions of rook theory17 are described. It is also shown that the matching polynomial cannot always discriminate between planar isospectral molecules

Some Remarks on the Matching Polynomial and Its Zeros

The matching polynomial (also called reference and acyclic polynomial) was discovered in chemistry, physics and mathematics at least six times. We demonstrate that the matching polynomial of a bipartite graph coincides with the rook polynomial of a certain board. The basic notions of rook theory17 are described. It is also shown that the matching polynomial cannot always discriminate between planar isospectral molecules

A general algorithm for manipulating non-linear and linear entanglement witnesses by using exact convex optimization

A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem. This approach is completely general and can be applied for the entanglement detection of any N-partite quantum system. For this purpose, a map from convex space of separable density matrices to a convex region called feasible region is defined, where by using exact convex optimization method, the linear entanglement witnesses can be obtained from polygonal shape feasible regions, while for curved shape feasible regions, envelope of the family of linear entanglement witnesses can be considered as nonlinear entanglement witnesses. This method proposes a new methodological framework within which most of previous EWs can be studied. To conclude and in order to demonstrate the capability of the proposed approach, besides providing some nonlinear witnesses for entanglement detection of density matrices in unextendible product bases, W-states, and GHZ with W-states, some further examples of three qubits systems and their classification and entanglement detection are included. Also it is explained how one can manipulate most of the non-decomposable linear and nonlinear three qubits entanglement witnesses appearing in some of the papers published by us and other authors, by the method proposed in this paper. Keywords: non-linear and linear entanglement witnesses, convex optimization. PACS number(s): 03.67.Mn, 03.65.UdComment: 37 page

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code - a subset of U(d) in which the trace inner product of any pair of matrices is restricted to only a small number of distinct values - and give an upper bound for the size of a code of degree s in U(d) for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.Comment: 25 pages, no figure

Laser-modified one- and two-photon absorption:Expanding the scope of optical nonlinearity

It is shown that conventional one-photon and two-photon absorption processes can be made subject to nonlinear optical control, in each case significantly modifying the efficiency of absorption, through the effect of a secondary, off-resonant stimulus laser beam. The mechanistic origin of these laser-modified absorption processes, in which the stimulus beam emerges unchanged, is traced to higher-order terms in standard perturbation treatments. These normally insignificant terms become unusually prominent when the secondary optical stimulus is moderately intense. Employing a quantum formulation, the effects of the stimulus beam on one-photon and two-photon absorption are analyzed, and calculations are performed to determine the degree of absorption enhancement, and the form of spectral manifestation, under various laser intensities. The implications of differences in selection rules are also considered and exemplified, leading to the identification of dark states that can be populated as a result of laser-modified absorption. Attention is also drawn to the possibility of quantum nondemolition measurements, based on such a form of optical nonlinearity

Weight of quadratic forms and graph states

We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results concerning the weight of quadratic forms in terms of graph states properties. As a byproduct, we obtain a straightforward characterization of the weight of functions associated with pivot-minor of bipartite graphs.Comment: 8 pages, 3 eps figure, REVTeX; v2: We have extended the introduction, included extra references and added two figures; v3: small typos fixe