One sided indeterminism alone is not a useful resource to simulate any nonlocal correlation

Determinism, no signaling and measurement independence are some of the constraints required for framing Bell inequality. Any model simulating nonlocal correlations must either individually or jointly give up these constraints. Recently Hall (Phys Review A, 84:022102, 2011) derived different forms of Bell inequalities under the assumption of individual or joint relaxation of those constraints on both (i.e., two) the sides of a bipartite system. In this work, we have investigated whether one sided relaxation can also be a useful resource for simulating nonlocal correlations or not. We have derived Bell-type inequalities under the assumption of joint relaxation of these constraints only by one party of a bipartite system. Interestingly, we found that any amount of randomness in correlations of one party in absence of signaling between two parties is incapable of showing any sort of Bell–CHSH violation, whereas signaling and measurement dependence individually can simulate any nonlocal correlations. We have also completed the proof of a recent conjecture due to Hall (Phys. Rev. A 82:062117, 2010; Phys. Rev. A 84:022102, 2011) for one-sided relaxation scenario only.     

H ∞ control for non-linear stochastic systems: the output-feedback case

The H _∞ output-feedback control problem for non-linear stochastic systems is considered. A solution for a large class of non-linear stochastic systems is introduced (including non-linear diffusion systems as a subclass). This solution is based on a bounded real lemma for non-linear stochastic systems that was previously established via a stochastic dissipativity concept. The theory yields sufficient conditions for the closed-loop system to possess a prescribed L ₂-gain bound in terms of two Hamilton Jacobi inequalities: one that is associated with the state feedback part of the problem is n-dimensional (where n is the underlying system's state dimension) and the other inequality that stems from the estimation part is 2n-dimensional. Both stationary and non–stationary systems are considered. Stability of the closed-loop system is established, both in the mean-square and the in-probability senses. As the solution to the Hamilton Jacobi inequalities may, in general, lead to a non–realisable state estimator, a modification of the associated 2n-dimensional Hamilton Jacobi inequality is made in order to circumvent this realisation problem, while preserving the system's L ₂-gain bound. For time-invariant systems, the problem of robust output-feedback is considered in the case of norm-bounded uncertainties. A solution is then derived in terms of linear state-dependent matrix inequalities.     

Construction of Bell inequalities based on the CHSH structure

It is a computationally hard task to find all Bell inequalities for a given number of parties, measurement settings, and measurement outcomes. We investigate the construction of the Clauser-Horne-Shimony-Holt Bell inequalities, based on which we present a set of new Bell inequalities. The maximal violations of the constructed Bell inequalities are analysed, and computable formulas are derived.     

On Tight Multiparty Bell Inequalities for Many Settings

A derivation method is given, which leads to a series of tight Bell inequalities for experiments involving N parties, with binary observables, and three possible local settings. The approach can be generalized to more settings. Ramifications are presented.QUPON/QIPC Special Issue     

Multi-party quantum private comparison based on the entanglement swapping of <Emphasis Type="Italic">d</Emphasis>-level cat states and <Emphasis Type="Italic">d</Emphasis>-level Bell states

In this paper, a novel multi-party quantum private comparison protocol with a semi-honest third party (TP) is proposed based on the entanglement swapping of d-level cat states and d-level Bell states. Here, TP is allowed to misbehave on his own, but will not conspire with any party. In our protocol, n parties employ unitary operations to encode their private secrets and can compare the equality of their private secrets within one time execution of the protocol. Our protocol can withstand both the outside attacks and the participant attacks on the condition that none of the QKD methods is adopted to generate keys for security. One party cannot obtain other parties’ secrets except for the case that their secrets are identical. The semi-honest TP cannot learn any information about these parties’ secrets except the end comparison result on whether all private secrets from n parties are equal.     

Constraint elimination method for the committee problem

We introduce a method of reducing the q-Member p-Committee Problem for an arbitrary finite system of sets to the same problem for a system of sets of smaller size and with a smaller number of subsystems with nonempty intersection maximal with respect to inclusion. For p = 1/2, for an infeasible system of linear inequalities in ℝ ⁿ we give an efficient implementation of this method with complexity polynomial in the number of inequalities and the number of committee elements, but exponential in the dimension of the space. For this implementation, we give experimental results for n = 2, 3.     

On the design of a reduced-order H ∞ controller for nonlinear sampled-data systems

In this paper, the problem of designing reduced-order H ^∞ controllers is studied for nonlinear continuous-time systems with sampled measurements. Using the concepts of dissipativity and differential game, sufficient conditions are derived for the existence of such reduced-order H ^∞ controllers. These conditions are expressed in terms of the solutions of two Hamilton–Jacobi inequalities, comprising a standard Hamilton–Jacobi inequality and a differential Hamilton–Jacobi inequality with jumps. These Hamilton–Jacobi inequalities are exactly those used in the construction of full-order H ^∞ controllers. When these conditions hold, state-space formulae are also given for such reduced-order controllers. An illustrative example is also included.     

H∞ state estimation of generalised neural networks with interval time-varying delays

This paper focuses on studying the H_∞ state estimation of generalised neural networks with interval time-varying delays. The integral terms in the time derivative of the Lyapunov–Krasovskii functional are handled by the Jensen’s inequality, reciprocally convex combination approach and a new Wirtinger-based double integral inequality. A delay-dependent criterion is derived under which the estimation error system is globally asymptotically stable with H_∞ performance. The proposed conditions are represented by linear matrix inequalities. Optimal H_∞ norm bounds are obtained easily by solving convex problems in terms of linear matrix inequalities. The advantage of employing the proposed inequalities is illustrated by numerical examples.     

Polynomials‐based summation inequalities and their applications to discrete‐time systems with time‐varying delays

This paper proposes a novel summation inequality, say a polynomials‐based summation inequality, which contains well‐known summation inequalities as special cases. By specially choosing slack matrices, polynomial functions, and an arbitrary vector, it reduces to Moon's inequality, a discrete‐time counterpart of Wirtinger‐based integral inequality, auxiliary function‐based summation inequalities employing the same‐order orthogonal polynomial functions. Thus, the proposed summation inequality is more general than other summation inequalities. Additionally, this paper derives the polynomials‐based summation inequality employing first‐order and second‐order orthogonal polynomial functions, which contributes to obtaining improved stability criteria for discrete‐time systems with time‐varying delays. Copyright © 2017 John Wiley & Sons, Ltd.     

Large-scale k-means clustering with user-centric privacy-preservation

A k-means clustering with a new privacy-preserving concept, user-centric privacy preservation, is presented. In this framework, users can conduct data mining using their private information by storing them in their local storage. After the computation, they obtain only the mining result without disclosing private information to others. In most cases, the number of parties that can join conventional privacy-preserving data mining has been assumed to be only two. In our framework, we assume large numbers of parties join the protocol; therefore, not only scalability but also asynchronism and fault-tolerance is important. Considering this, we propose a k-mean algorithm combined with a decentralized cryptographic protocol and a gossip-based protocol. The computational complexity is O(log n) with respect to the number of parties n, and experimental results show that our protocol is scalable even with one million parties.     

Finding least-weight subsequences with fewer processors

By restricting weight functions to satisfy the quadrangle inequality or the inverse quadrangle inequality, significant progress has been made in developing efficient sequential algorithms for the least-weight subsequence problem [10], [9], [12], [16]. However, not much is known on the improvement of the naive parallel algorithm for the problem, which is fast but demands too many processors (i.e., it takesO(log² n) time on a CREW PRAM with n³/logn processors). In this paper we show that if the weight function satisfies the inverse quadrangle inequality, the problem can be solved on a CREW PRAM in O(log² n log logn) time withn/log logn processors, or in O(log² n) time withn logn processors. Notice that the processor-time complexity of our algorithm is much closer to the almost linear-time complexity of the best-known sequential algorithm [12].     

On the static H∞ control problem

The problem of existence of static controller in standard H_∞ control problem or, equivalently, solvability of a couple of Riccati inequalities with respect to the same Hermitian matrix is reduced to solvability of a single Riccati inequality. This inequality is presented in a form which is bilinear with respect to unknown parameters. In a special case the inequality is transformed to LMI.     

Violation of Bell inequalities for arbitrary-dimensional bipartite systems

In this paper, we consider the violation of Bell inequalities for quantum system \(\mathbb {C}^K\otimes \mathbb {C}^K\) (integer \(K\ge 2\)) with group theoretical method. For general M possible measurements, and each measurement with K outcomes, the Bell inequalities based on the choice of two orbits are derived. When the observables are much enough, the quantum bounds are only dependent on M and approximate to the classical bounds. Moreover, the corresponding nonlocal games with two different scenarios are analyzed.     

Multi-party quantum state sharing of an arbitrary two-qubit state with Bell states

We present a new scheme for sharing an arbitrary two-qubit quantum state with n agents. In our scheme, the sender Alice first shares n Einsein-Podolsky-Rosen (EPR) pairs in Bell states with n agents. After setting up the secure quantum channel, Alice first applies (n − 2) Controlled-Not (CNOT) gate operations, and then performs two Bell-state measurements and (n − 2) single-particle measurements (n >2). In addition, all controllers only hold one particle in their hands, respectively, and thus they only need to perform a single-particle measurement on the respective particle with the basis {|0?, |1?}{\{{\vert}0\rangle, {\vert}1\rangle\}}. Compared with other schemes with Bell states, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher total efficiency.     

Improved H∞ sampled‐data control for semilinear parabolic PDE systems

In this paper, an H_∞ sampled‐data control problem is addressed for semilinear parabolic partial differential equation (PDE) systems. By using a time‐dependent Lyapunov functional and vector Poincare's inequality, a sampled‐data controller under spatially averaged measurements is developed to stabilize exponentially the PDE system with an H_∞ control performance. The stabilization condition is presented in terms of a set of linear matrix inequalities. Finally, simulation results on the control of the diffusion equation and the FitzHugh‐Nagumo equation are given to illustrate the effectiveness of the proposed design method.     

New results on H ∞ filter design for nonlinear systems with time-delay through a T-S fuzzy model approach

H _∞ filter design for nonlinear systems with time-delay via a T-S fuzzy model approach is investigated based on a piecewise analysis method. Two cases of time-varying delays are fully considered: one is the time-varying delay being continuous uniformly bounded while the other is the time-varying delay being differentiable uniformly bounded with delay-derivative bounded by a constant. Based on a piecewise analysis method, the variation interval of the time delay is first divided into several subintervals, then the convexity property of the matrix inequality and the free weighting matrix method are fully used in this article. Some novel delay-dependent H _∞ filtering criteria are expressed as a set of linear matrix inequalities, which can lead to much less conservative analysis results. Finally, a numerical example is given to illustrate that the results in this article are more effective and less conservative than some existing ones.     

Bell inequality,steering, incompatibility and Leggett–Garg inequality under coarsening measurement

We investigate the effects of the coarsening measurement on the quantum-to-classical transition by Bell–Clauser–Horne–Shimony–Holt (Bell–CHSH) non-locality for the conventional two-qubit system, the Leggett–Garg inequality for a two-level system, and steering and incompatibility both in the equatorial plane for N measurement settings. We find that for any fixed N, steering is more vulnerable than incompatibility for coarsening measurement both in reference and in final resolution. For \(N=2\) measurement settings, under the coarsening measurement reference the Leggett–Garg inequality is the most robust, Bell–CHSH non-locality lies between steering and incompatibility, while in the coarsening measurement of final resolution for \(N=2\) measurement settings incompatibility is the most robust, steering and Bell–CHSH non-locality are equally vulnerable, and more than the Leggett–Garg inequality. However, as N increases, incompatibility and steering will become more robust than the Leggett–Garg inequality under the coarsening measurement in reference and in final resolution, respectively. Finally, for the Leggett–Garg inequality, we find that the robustness of the coarsening measurement reference is more than the coarsening temporal reference. In one word, the effects of coarsening measurement strongly depend on the ways of coarsening.     

A family of H∞ controllers for dissipative Hamiltonian systems

Using structure properties of dissipative Hamiltonian systems, this paper investigates the parameterization problem of H_infty controllers for such systems. A family of H_∞ controllers with full information is first obtained by interconnecting an H_∞ controller with a generalized zero‐energy‐gradient (ZEG) detectable, free generalized Hamiltonian system. Then, a family of H_∞ controllers with partial information is presented in terms of the solution to an inequality only in 2n independent variables (twice as many as the one used to characterize the state feedback) and without imposing an additional cascade condition. Both of the parameterization methods avoid solving Hamilton–Jacobi–Issacs equations (or inequalities), and thus the proposed controllers are relatively simple in form and easy in operation. Numerical experiments show the effectiveness and feasibility of the proposed methods. Copyright © 2011 John Wiley & Sons, Ltd.     

LMI-based H ∞-optimal control with transients

In this article, the worst-case norm of the regulated output over all exogenous signals and initial states as a performance measure of the system is characterised in terms of linear matrix inequalities (LMIs). Optimal time-invariant state- and output-feedback controllers are synthesised as minimising this performance measure. The essential role in this synthesis plays a weighting matrix reflecting the relative importance of the uncertainty in the initial state contrary to the uncertainty in the exogenous signal. H _∞-optimal control with transients is shown to be actually a trade-off between H _∞-control, being optimal under unknown exogenous disturbances and zero initial state, and γ-control, being optimal under zero exogenous signal and unknown initial conditions, if and only if the weighting matrix satisfies a fundamental inequality. If this inequality is met, the performance measure is achieved and the explicit formulae for the worst-case disturbance and initial state are provided. If this inequality fails, the performance measure coincides with the H _∞-norm and the trade-off gets broken.