Reliable inference for complex models by discriminative composite likelihood estimation

Composite likelihood estimation has an important role in the analysis of multivariate data for which the full likelihood function is intractable. An important issue in composite likelihood inference is the choice of the weights associated with lower-dimensional data sub-sets, since the presence of incompatible sub-models can deteriorate the accuracy of the resulting estimator. In this paper, we introduce a new approach for simultaneous parameter estimation by tilting, or re-weighting, each sub-likelihood component called discriminative composite likelihood estimation (D-McLE). The data-adaptive weights maximize the composite likelihood function, subject to moving a given distance from uniform weights; then, the resulting weights can be used to rank lower-dimensional likelihoods in terms of their influence in the composite likelihood function. Our analytical findings and numerical examples support the stability of the resulting estimator compared to estimators constructed using standard composition strategies based on uniform weights. The properties of the new method are illustrated through simulated data and real spatial data on multivariate precipitation extremes.Comment: 29 pages, 4 figure

Improved Deterministic N-To-One Joint Remote Preparation of an Arbitrary Qubit via EPR Pairs

Recently, Bich et al. (Int. J. Theor. Phys. 51: 2272, 2012) proposed two deterministic joint remote state preparation (JRSP) protocols of an arbitrary single-qubit state: one is for two preparers to remotely prepare for a receiver by using two Einstein-Podolsky-Rosen (ERP) pairs; the other is its generalized form in the case of arbitrary N>2 preparers via N ERP pairs. In this paper, Through reviewing and analyzing Bich et al.'s second protocols with N>2 preparers, we find that the success probability P_{suc}=1/4 < 1. In order to solve the problem, we firstly constructed two sets of projective measurement bases: the real-coefficient basis and the complex-coefficient one, and further proposed an improved deterministic N-to-one JRSP protocol for an arbitrary single-qubit state with unit success probability (i.e, P_{suc}=1). Morever, our protocol is also flexible and convenient, and it can be used in a practical network.Comment: 13 pages, 2 figures, two table

Cryptanalysis and improvement of the quantum private comparison protocol based on Bell entangled states

Recently, Liu et al. [Commun. Theor. Phys. 57, 583, 2012] proposed a quantum private comparison protocol based on entanglement swapping of Bell states, which aims to securely compare the equality of two participants' information with the help of a semi-honest third party (TP). However, this study points out there is a fatal loophole in this protocol, i.e., TP can obtain all of the two participants secret inputs without being detected through making a specific Bell-basis measurement. To fix the problem, a simple solution, which uses one-time eavesdropper checking with decoy photons instead of twice eavesdropper checking with Bell states, is demonstrated. Compared with the original protocol, it also reduces the Bell states consumption and simplifies the steps in the protocol.Comment: 9 pages, 1 figur