Teleportation Topology

We discuss the structure of teleportation. By associating matrices to the preparation and measurement states, we show that for a unitary transformation M there is a full teleportation procedure for obtaining M|S> from a given state |S>. The key to this construction is a diagrammatic intepretation of matrix multiplication that applies equally well to a topological composition of a maximum and a minimum that underlies the structure of the teleportation. This paper is a preliminary report on joint work with H. Carteret and S. Lomonaco.Comment: LaTeX document, 16 pages, 8 figures, Talk delivered at the Xth International Conference on Quantum Optics, Minsk, Belaru

Phase transition in a class of non-linear random networks

We discuss the complex dynamics of a non-linear random networks model, as a function of the connectivity k between the elements of the network. We show that this class of networks exhibit an order-chaos phase transition for a critical connectivity k = 2. Also, we show that both, pairwise correlation and complexity measures are maximized in dynamically critical networks. These results are in good agreement with the previously reported studies on random Boolean networks and random threshold networks, and show once again that critical networks provide an optimal coordination of diverse behavior.Comment: 9 pages, 3 figures, revised versio

The computational complexity of Kauffman nets and the P versus NP problem

Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model can be adjusted so that the problem of finding its global energy minimum is extremely sensitive to small changes in the problem statement. This result has implications not only for studies of the physics of random systems but may also lead to new strategies for resolving the well-known P versus NP question in computational complexity theory.Comment: 4 pages, no figure

Production of a Higgs pseudoscalar plus two jets in hadronic collisions

We consider the production of a Higgs pseudoscalar accompanied by two jets in hadronic collisions. We work in the limit that the top quark is much heavier than the Higgs pseudoscalar and use an effective Lagrangian for the interactions of gluons with the pseudoscalar. We compute the amplitudes involving: 1) four gluons and the pseudoscalar, 2) two quarks, two gluons and the pseudoscalar and 3) four quarks and the pseudoscalar. We find that the pseudoscalar amplitudes are nearly identical to those for the scalar case, the only differences being the overall size and the relative signs between terms. We present numerical cross sections for proton-proton collisions with center-of-mass energy 14 TeV.Comment: 12 pages, LaTeX, 4 Postscript figures, submitted to Phys. Rev.

On homotopies with triple points of classical knots

We consider a knot homotopy as a cylinder in 4-space. An ordinary triple point $p$ of the cylinder is called {\em coherent} if all three branches intersect at $p$ pairwise with the same index. A {\em triple unknotting} of a classical knot $K$ is a homotopy which connects $K$ with the trivial knot and which has as singularities only coherent triple points. We give a new formula for the first Vassiliev invariant $v_2(K)$ by using triple unknottings. As a corollary we obtain a very simple proof of the fact that passing a coherent triple point always changes the knot type. As another corollary we show that there are triple unknottings which are not homotopic as triple unknottings even if we allow more complicated singularities to appear in the homotopy of the homotopy.Comment: 10 pages, 13 figures, bugs in figures correcte

On the number of attractors in random Boolean networks

The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update functions. A connection is made between the terms occurring in the calculation and between the more graphic concepts of frozen, nonfrozen and relevant nodes, and relevant components. Based on this understanding, a phenomenological argument is given that reproduces the dependence of the attractor numbers on system size.Comment: 6 page