We use one photon to simulate an n-qubit quantum system for the first time. We propose a new scheme to realize universal quantum computation in polynomial time O(n^5). A generating set of gates can be realized with high accuracy in the lab. We conclude that photonic quantum computation is one of the promising approaches to universal quantum computation.

Let G=(V,E) be a locally finite connected weighted graph, and Ω be an unbounded subset of V. Using Rothe's method, we study the existence of solutions for the semilinear heat equation ∂_t u+|u|^{p−1}⋅u=Δu (p≥1) and the parabolic variational inequality ∫_{Ω^∘} ∂_t u⋅(v−u)dμ ≥ ∫_{Ω^∘} (Δu+f)⋅(v−u)dμ for any v∈H, where H={u∈W^{1,2}(V):u=0 on V∖Ω^∘}.

We give a new type of Schur-Weyl duality for the representations of a family of quantum subgroups and their centralizer algebra. We define and classify singly-generated, Yang-Baxter relation planar algebras. We present the skein theoretic construction of a new parameterized planar algebra. We construct infinitely many new subfactors and unitary fusion categories, and compute their trace formula as a closed-form expression, in terms of Young diagrams.

In this paper, we prove some analogues of Payne-Polya-Weinberger, Hile-Protter and Yang's inequalities for Dirichlet (discrete) Laplace eigenvalues on any subset in the integer lattice $\Z^n.$ This partially answers a question posed by Chung and Oden.

No abstract uploaded!