Partially monotone tensor spline estimation of the joint distribution function with bivariate current status data

The analysis of the joint cumulative distribution function (CDF) with bivariate event time data is a challenging problem both theoretically and numerically. This paper develops a tensor spline-based sieve maximum likelihood estimation method to estimate the joint CDF with bivariate current status data. The I-splines are used to approximate the joint CDF in order to simplify the numerical computation of a constrained maximum likelihood estimation problem. The generalized gradient projection algorithm is used to compute the constrained optimization problem. Based on the properties of B-spline basis functions it is shown that the proposed tensor spline-based nonparametric sieve maximum likelihood estimator is consistent with a rate of convergence potentially better than $n^{1/3}$ under some mild regularity conditions. The simulation studies with moderate sample sizes are carried out to demonstrate that the finite sample performance of the proposed estimator is generally satisfactory.Comment: Published in at http://dx.doi.org/10.1214/12-AOS1016 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

Spin liquids on a honeycomb lattice: Projective Symmetry Group study of Schwinger fermion mean-field theory

Spin liquids are novel states of matter with fractionalized excitations. A recent numerical study of Hubbard model on a honeycomb lattice\cite{Meng2010} indicates that a gapped spin liquid phase exists close to the Mott transition. Using Projective Symmetry Group, we classify all the possible spin liquid states by Schwinger fermion mean-field approach. We find there is only one fully gapped spin liquid candidate state: "Sublattice Pairing State" that can be realized up to the 3rd neighbor mean-field amplitudes, and is in the neighborhood of the Mott transition. We propose this state as the spin liquid phase discovered in the numerical work. To understand whether SPS can be realized in the Hubbard model, we study the mean-field phase diagram in the $J_1-J_2$ spin-1/2 model and find an s-wave pairing state. We argue that s-wave pairing state is not a stable phase and the true ground state may be SPS. A scenario of a continuous phase transition from SPS to the semimetal phase is proposed. This work also provides guideline for future variational studies of Gutzwiller projected wavefunctions.Comment: 13 pages, 4 figures, Revtex

Solutions to the complex Korteweg-de Vries equation: Blow-up solutions and non-singular solutions

In the paper two kinds of solutions are derived for the complex Korteweg-de Vries equation, including blow-up solutions and non-singular solutions. We derive blow-up solutions from known 1-soliton solution and a double-pole solution. There is a complex Miura transformation between the complex Korteweg-de Vries equation and a modified Korteweg-de Vries equation. Using the transformation, solitons, breathers and rational solutions to the complex Korteweg-de Vries equation are obtained from those of the modified Korteweg-de Vries equation. Dynamics of the obtained solutions are illustrated.Comment: 12 figure

Symbolic bisimulation for quantum processes

With the previous notions of bisimulation presented in literature, to check if two quantum processes are bisimilar, we have to instantiate the free quantum variables of them with arbitrary quantum states, and verify the bisimilarity of resultant configurations. This makes checking bisimilarity infeasible from an algorithmic point of view because quantum states constitute a continuum. In this paper, we introduce a symbolic operational semantics for quantum processes directly at the quantum operation level, which allows us to describe the bisimulation between quantum processes without resorting to quantum states. We show that the symbolic bisimulation defined here is equivalent to the open bisimulation for quantum processes in the previous work, when strong bisimulations are considered. An algorithm for checking symbolic ground bisimilarity is presented. We also give a modal logical characterisation for quantum bisimilarity based on an extension of Hennessy-Milner logic to quantum processes.Comment: 30 pages, 7 figures, comments are welcom

Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs

We extract a novel quantum programming paradigm - superposition of programs - from the design idea of a popular class of quantum algorithms, namely quantum walk-based algorithms. The generality of this paradigm is guaranteed by the universality of quantum walks as a computational model. A new quantum programming language QGCL is then proposed to support the paradigm of superposition of programs. This language can be seen as a quantum extension of Dijkstra's GCL (Guarded Command Language). Surprisingly, alternation in GCL splits into two different notions in the quantum setting: classical alternation (of quantum programs) and quantum alternation, with the latter being introduced in QGCL for the first time. Quantum alternation is the key program construct for realizing the paradigm of superposition of programs. The denotational semantics of QGCL are defined by introducing a new mathematical tool called the guarded composition of operator-valued functions. Then the weakest precondition semantics of QGCL can straightforwardly derived. Another very useful program construct in realizing the quantum programming paradigm of superposition of programs, called quantum choice, can be easily defined in terms of quantum alternation. The relation between quantum choices and probabilistic choices is clarified through defining the notion of local variables. We derive a family of algebraic laws for QGCL programs that can be used in program verification, transformations and compilation. The expressive power of QGCL is illustrated by several examples where various variants and generalizations of quantum walks are conveniently expressed using quantum alternation and quantum choice. We believe that quantum programming with quantum alternation and choice will play an important role in further exploiting the power of quantum computing.Comment: arXiv admin note: substantial text overlap with arXiv:1209.437