PROBABILISTIC MULTIPARTY-CONTROLLED REMOTE PREPARATION OF AN ARBITRARY m-QUDIT STATE VIA POSITIVE OPERATOR-VALUED MEASUREMENT

2012 ◽  
Vol 10 (05) ◽  
pp. 1250062 ◽  
Author(s):  
ZHAO LI ◽  
PING ZHOU

We present a scheme for multiparty-controlled remote preparation of an arbitrary m-qudit (d-dimensional quantum system) state via positive operator-valued measurement (POVM) by using nonmaximally entangled states as the quantum channel, not resorting to auxiliary qubits. The sender performs an optimal POVM measurement on her m particles with measurement operators that depend on the original state, the controllers perform generalized X-basis measurement X d and the receiver can prepare the original state if he cooperates with all the controllers and the sender. The scheme has the advantage of having high success probability for remote preparing an arbitrary m-qudit state and more convenient than others in a practical application. Moreover, it discusses the relationship between the probability that the receiver obtains the originally state and the coefficients of the entangled states.

2010 ◽  
Vol 08 (08) ◽  
pp. 1265-1275 ◽  
Author(s):  
DONG WANG

A scheme for remotely preparing an arbitrary two-particle pure state is proposed by employing bipartite nonmaximally entangled states as quantum channels. During the preparation, two auxiliary particles and an optimal positive operator-valued measurement are introduced. The preparation of two-particle pure states can be remotely realized with certain success probability (SP). And the SP of our scheme is exactly worked out. It turns out that the SP depends inherently on the quantum channels employed beforehand. Furthermore, we find that, as far as two special ensembles of two-particle states are concerned, i.e. real and equatorial-like, the SP can be enhanced to quadruple.


2011 ◽  
Vol 09 (06) ◽  
pp. 1437-1448
Author(s):  
YI-BAO LI ◽  
KUI HOU ◽  
SHOU-HUA SHI

We propose two kinds of schemes for multiparty remote state preparation (MRSP) of the multiparticle d-dimensional equatorial quantum states by using partial entangled state as the quantum channel. Unlike more remote state preparation scheme which only one sender knows the original state to be remotely prepared, the quantum state is shared by two-party or multiparty in this scheme. We show that if and only if all the senders agree to collaborate with each other, the receiver can recover the original state with certain probability. It is found that the total success probability of MRSP is only by means of the smaller coefficients of the quantum channel and the dimension d.


2008 ◽  
Vol 06 (05) ◽  
pp. 1115-1125 ◽  
Author(s):  
DAOWEN QIU

Recently, Harrow et al. [Phys. Rev. Lett.92 (2004) 187901] gave a method for preparing an arbitrary quantum state with high success probability by physically transmitting some qubits, and by consuming a maximally entangled state, together with exhausting some shared random bits. In this paper, we discover that some states are impossible to be perfectly prepared by Alice and Bob initially sharing some entangled states. In particular, we present a sufficient and necessary condition for the states being enabled to be exactly prepared with probability equal to unity, in terms of the initial entangled states (maybe nonmaximally). In contrast, if the initially shared entanglement is maximal, then the probabilities for preparing these quantum states are smaller than unity. Furthermore, the lower bound on the probability for preparing some states are derived.


1982 ◽  
Vol 14 (7) ◽  
pp. 869-888 ◽  
Author(s):  
P F Lesse

This paper deals with a class of models which describe spatial interactions and are based on Jaynes's principle. The variables entering these models can be partitioned in four groups: (a) probability density distributions (for example, relative traffic flows), (b) expected values (average cost of travel), (c) their duals (Lagrange multipliers, traffic impedance coefficient), and (d) operators transforming probabilities into expected values. The paper presents several dual formulations replacing the problem of maximizing entropy in terms of the group of variables (a) by equivalent extreme problems involving groups (b)-(d). These problems form the basis of a phenomenological theory. The theory makes it possible to derive useful relationships among groups (b) and (c). There are two topics discussed: (1) practical application of the theory (with examples), (2) the relationship between socioeconomic modelling and statistical mechanics.


2017 ◽  
Vol 16 (10) ◽  
Author(s):  
Jiahua Wei ◽  
Lei Shi ◽  
Lihua Ma ◽  
Yang Xue ◽  
Xuchun Zhuang ◽  
...  

Author(s):  
Kotchapong Sumanonta ◽  
Pasist Suwanapingkarl ◽  
Pisit Liutanakul

This article presents a novel model for the equivalent circuit of a photovoltaic module. This circuit consists of the following important parameters: a single diode, series resistance (Rs) and parallel resistance (Rp) that can be directly adjusted according to ambient temperature and the irradiance. The single diode in the circuit is directly related to the ideality factor (m), which represents the relationship between the materials and significant structures of PV module such as mono crystalline, multi crystalline and thin film technology.  Especially, the proposed model in this article is to present the simplified model that can calculate the results of I-V curves faster and more accurate than other methods of the previous models. This can show that the proposed models are more suitable for the practical application. In addition, the results of the proposed model are validated by the datasheet, the practical data in the laboratory (indoor test) and the onsite data (outdoor test). This ensures that the less than 0.1% absolute errors of the model can be accepted.


2015 ◽  
Vol 12 (1) ◽  
pp. 33-48 ◽  
Author(s):  
Balázs Kósa ◽  
Márton Balassi ◽  
Péter Englert ◽  
Attila Kiss

In our paper we compare two centrality measures of networks, betweenness and Linerank. Betweenness is widely used, however, its computation is expensive for large networks. Calculating Linerank remains manageable even for graphs of billion nodes, it was offered as a substitute of betweenness in [12]. To the best of our knowledge the relationship between these measures has never been seriously examined. We calculate the Pearson?s and Spearman?s correlation coefficients for both node and edge variants of these measures. For edges the correlation tends to be rather low. Our tests with the Girvan-Newman algorithm [16] also underline that edge betweenness cannot be substituted with edge Linerank. The results for the node variants are more promising. The correlation coefficients are close to 1. Notwithstanding, the practical application in which the robustness of social and web graphs is examined node betweenness still outperforms node Linerank. We also clarify how Linerank should be computed on undirected graphs.


Abstract Built elements and structures are a prominent component of our historic gardens, both in terms of function and artistic composition and garden scenery. The surveys of historic garden structures are important research tasks, which also underpins and validates restoration work. In most cases, the neglected state of historic gardens and sites and the unavailable archival materials do not allow an authentic restoration of historic gardens to their original state. Nevertheless, there is a real need to reconstruct our historic gardens, based not only on historical authenticity but also on a systematic reinterpretation of the relationship between society and landscape. The objective of this article is to present a general methodology for renewal of historic gardens through examples of specific garden reconstructions. The case studies are the authors' own design works, which demonstrate the application of different design approaches, highlighting details of the reconstruction of specific built garden elements.


Sign in / Sign up

Export Citation Format

Share Document