共查询到20条相似文献,搜索用时 15 毫秒
1.
Michael R. Frey 《Quantum Information Processing》2016,15(3):1103-1116
A protocol for quantum energy teleportation (QET) is known for a so-called minimal spin-\(\frac{1}{2}\) particle pair model. We extend this protocol to explicitly admit quantum weak measurements at its first stage. The extended protocol is applied beyond the minimal model to spin-\(\frac{1}{2}\) particle pairs whose Hamiltonians are of a general class characterized by orthogonal pairs of entangled eigenstates. The energy transfer efficiency of the extended QET protocol is derived for this setting, and we show that weaker measurement yields greater efficiency. In the minimal particle pair model, for example, the efficiency can be doubled by this means. We also show that the QET protocol’s transfer efficiency never exceeds 100 %, supporting the understanding that quantum energy teleportation is, indeed, an energy transfer protocol, rather than a protocol for remotely catalyzing local extraction of system energy already present. 相似文献
2.
The construction of quantum MDS codes has been studied by many authors. We refer to the table in page 1482 of (IEEE Trans Inf Theory 61(3):1474–1484, 2015) for known constructions. However, there have been constructed only a few q-ary quantum MDS \([[n,n-2d+2,d]]_q\) codes with minimum distances \(d>\frac{q}{2}\) for sparse lengths \(n>q+1\). In the case \(n=\frac{q^2-1}{m}\) where \(m|q+1\) or \(m|q-1\) there are complete results. In the case \(n=\frac{q^2-1}{m}\) while \(m|q^2-1\) is neither a factor of \(q-1\) nor \(q+1\), no q-ary quantum MDS code with \(d> \frac{q}{2}\) has been constructed. In this paper we propose a direct approach to construct Hermitian self-orthogonal codes over \(\mathbf{F}_{q^2}\). Then we give some new q-ary quantum codes in this case. Moreover many new q-ary quantum MDS codes with lengths of the form \(\frac{w(q^2-1)}{u}\) and minimum distances \(d > \frac{q}{2}\) are presented. 相似文献
3.
Enrico Marchioni 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(6):559-564
In this work we further explore the connection between -algebras and ordered fields. We show that any two -chains generate the same variety if and only if they are related to ordered fields that have the same universal theory.
This will yield that any -chain generates the whole variety if and only if it contains a subalgebra isomorphic to the -chain of real algebraic numbers, that consequently is the smallest -chain generating the whole variety. We also show that any two different subalgebras of the -chain over the real algebraic numbers generate different varieties. This will be exploited in order to prove that the lattice
of subvarieties of -algebras has the cardinality of the continuum. Finally, we will also briefly deal with some model-theoretic properties of
-chains related to real closed fields, proving quantifier-elimination and related results. 相似文献
4.
The parallel complexity class $\textsf{NC}$ 1 has many equivalent models such as polynomial size formulae and bounded width branching programs. Caussinus et al. (J. Comput. Syst. Sci. 57:200–212, 1992) considered arithmetizations of two of these classes, $\textsf{\#NC}$ 1 and $\textsf{\#BWBP}$ . We further this study to include arithmetization of other classes. In particular, we show that counting paths in branching programs over visibly pushdown automata is in $\textsf{FLogDCFL}$ , while counting proof-trees in logarithmic width formulae has the same power as $\textsf{\#NC}$ 1. We also consider polynomial-degree restrictions of $\textsf{SC}$ i , denoted $\textsf{sSC}$ i , and show that the Boolean class $\textsf{sSC}$ 1 is sandwiched between $\textsf{NC}$ 1 and $\textsf{L}$ , whereas $\textsf{sSC}$ 0 equals $\textsf{NC}$ 1. On the other hand, the arithmetic class $\textsf{\#sSC}$ 0 contains $\textsf{\#BWBP}$ and is contained in $\textsf{FL}$ , and $\textsf{\#sSC}$ 1 contains $\textsf{\#NC}$ 1 and is in $\textsf{SC}$ 2. We also investigate some closure properties of the newly defined arithmetic classes. 相似文献
5.
Rana Noor Arun K. Srivastava 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2014,18(10):1865-1871
We show that the category \(L\) - \(\mathbf{Top}_{0}\) of \(T_{0}\) - \(L\) -topological spaces is the epireflective hull of Sierpinski \(L\) -topological space in the category \(L\) - \(\mathbf{Top}\) of \(L\) -topological spaces and the category \(L\) - \(\mathbf{Sob}\) of sober \(L\) -topological spaces is the epireflective hull of Sierpinski \(L\) -topological space in the category \(L\) - \(\mathbf{Top}_{0}\) . 相似文献
6.
In this paper we offer an efficient controller synthesis algorithm for assume-guarantee specifications of the form $\varphi _1 \wedge \varphi _2 \wedge \cdots \wedge \varphi _n \rightarrow \psi _1 \wedge \psi _2 \wedge \cdots \wedge \psi _m$ . Here, $\{\varphi _i,\psi _j\}$ are all safety-MTL $_{0, \infty }$ properties, where the sub-formulas $\{\varphi _i\}$ are supposed to specify assumptions of the environment and the sub-formulas $\{\psi _j\}$ are specifying requirements to be guaranteed by the controller. Our synthesis method exploits the engine of Uppaal-Tiga and the novel translation of safety- and co-safety-MTL $_{0, \infty }$ properties into under-approximating, deterministic timed automata. Our approach avoids determinization of Büchi automata, which is the main obstacle for the practical applicability of controller synthesis for linear-time specifications. The experiments demonstrate that the chosen specification formalism is expressive enough to specify complex behaviors. The proposed approach is sound but not complete. However, it successfully produced solutions for all the experiments. Additionally we compared our tool with Acacia+ and Unbeast, state-of-the-art LTL synthesis tools; and our tool demonstrated better timing results, when we applied both tools to the analogous specifications. 相似文献
7.
8.
9.
10.
We study mutually unbiased maximally entangled bases (MUMEB’s) in bipartite system \(\mathbb {C}^d\otimes \mathbb {C}^d (d \ge 3)\). We generalize the method to construct MUMEB’s given in Tao et al. (Quantum Inf Process 14:2291–2300, 2015), by using any commutative ring R with d elements and generic character of \((R,+)\) instead of \(\mathbb {Z}_d=\mathbb {Z}/d\mathbb {Z}\). Particularly, if \(d=p_1^{a_1}p_2^{a_2}\ldots p_s^{a_s}\) where \(p_1, \ldots , p_s\) are distinct primes and \(3\le p_1^{a_1}\le \cdots \le p_s^{a_s}\), we present \(p_1^{a_1}-1\) MUMEB’s in \(\mathbb {C}^d\otimes \mathbb {C}^d\) by taking \(R=\mathbb {F}_{p_1^{a_1}}\oplus \cdots \oplus \mathbb {F}_{p_s^{a_s}}\), direct sum of finite fields (Theorem 3.3). 相似文献
11.
12.
13.
O. Zahiri 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2014,18(3):419-426
The aim of this paper is to solve the open problem appeared in Motamed and Moghaderi (Soft Comput 2012), about the relation between Noetherian (Artinian) $\textit{BL}$ -algebras in short exact sequences. Also, a better theorem to improve its results is suggested. The relation between Noetherian and Artinian $\textit{BL}$ -algebras is found, the concept of length for a filter in $\textit{BL}$ -algebras is introduced and properties of finite length $\textit{BL}$ -algebras are developed. Finally, it is proved that any $\textit{BL}$ -algebra has finite length if and only if be Noetherian and Artinian. 相似文献
14.
Constantin Christof 《Calcolo》2017,54(4):1243-1264
In this paper, we present an alternative approach to a priori \(L^\infty \)-error estimates for the piecewise linear finite element approximation of the classical obstacle problem. Our approach is based on stability results for discretized obstacle problems and on error estimates for the finite element approximation of functions under pointwise inequality constraints. As an outcome, we obtain the same order of convergence proven in several works before. In contrast to prior results, our estimates can, for example, also be used to study the situation where the function space is discretized but the obstacle is not modified at all. 相似文献
15.
Marek Chrobak Christoph Dürr Flavio Guí?ez Antoni Lozano Nguyen Kim Thang 《Algorithmica》2012,64(2):267-278
Discrete tomography deals with reconstructing finite spatial objects from their projections. The objects we study in this paper are called tilings or tile-packings, and they consist of a number of disjoint copies of a fixed tile, where a tile is defined as a connected set of grid points. A row projection specifies how many grid points are covered by tiles in a given row; column projections are defined analogously. For a fixed tile, is it possible to reconstruct its tilings from their projections in polynomial time? It is known that the answer to this question is affirmative if the tile is a bar (its width or height is 1), while for some other types of tiles $\mathbb {NP}$ -hardness results have been shown in the literature. In this paper we present a complete solution to this question by showing that the problem remains $\mathbb {NP}$ -hard for all tiles other than bars. 相似文献
16.
Modern data centers are playing an important role in a world full of information and communication technologies (ICTs). Many efforts have been paid to build a more efficient, cleaner data center for economic, social, and environmental benefits. This objective is being enabled by emerging technologies such as cloud computing and software-defined networking (SDN). However, a data center is inherently heterogeneous, consisting of servers, networking devices, cooling devices, power supply devices, etc., resulting in daunting challenges in its management and control. Previous approaches typically focus on only a single domain, for example, traditional cloud computing for server resource (e.g., computing resource and storage resource) management and SDN for network management. In a similar context of networking device heterogeneity, network function virtualization has been proposed to offer a standard abstract interface to manage all networking devices. In this research, we take the challenge of building a suit of unified middleware to monitor and control the three intrinsic subsystems in a data centre, including ICT, power, and cooling. Specifically, we present \(\upmu \mathrm{DC}^2\) , a unified scalable IP-based data collection system for data center management with elevated extensibility, as an initial step to offer a unified platform for data center operations. Our system consists of three main parts, i.e., data-source adapters for information collection over various subsystems in a data center, a unified message bus for data transferring, and a high-performance database for persistent data storage. We have conducted performance benchmark for the key building components, namely messaging server and database, confirming that our system is scalable for a data center with high device density and real-time management requirements. Key features, such as configuration files, dynamical module loading, and data compression, enhance our implementation with high extensibility and performance. The effectiveness of our proposed data collection system is verified by sample applications, such as, traffic flow migration for load balancing, VM migration for resource reservation, and server power management for hardware safety. This research lays out a foundation for a unified data centre management in future. 相似文献
17.
18.
Distributed \begin{document}$H_{2}/H_\infty$\end{document} Filter Design for Discrete-Time Switched Systems
下载免费PDF全文
![点击此处可从《IEEE/CAA Journal of Automatica Sinica》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This paper addresses an infinite horizon distributed H2/H∞ filtering for discrete-time systems under conditions of bounded power and white stochastic signals. The filter algorithm is designed by computing a pair of gains namely the estimator and the coupling. Herein, we implement a filter to estimate unknown parameters such that the closed-loop multi-sensor accomplishes the desired performances of the proposed H2 and H∞ schemes over a finite horizon. A switched strategy is implemented to switch between the states once the operation conditions have changed due to disturbances. It is shown that the stability of the overall filtering-error system with H2/H∞ performance can be established if a piecewise-quadratic Lyapunov function is properly constructed. A simulation example is given to show the effectiveness of the proposed approach. 相似文献
19.
The problem MaxLin2 can be stated as follows. We are given a system S of m equations in variables x 1,…,x n , where each equation $\sum_{i \in I_{j}}x_{i} = b_{j}$ is assigned a positive integral weight w j and $b_{j} \in\mathbb{F}_{2}$ , I j ?{1,2,…,n} for j=1,…,m. We are required to find an assignment of values in $\mathbb{F}_{2}$ to the variables in order to maximize the total weight of the satisfied equations. Let W be the total weight of all equations in S. We consider the following parameterized version of MaxLin2: decide whether there is an assignment satisfying equations of total weight at least W?k, where k is a nonnegative parameter. We prove that this parameterized problem is W[1]-hard even if each equation of S has exactly three variables and every variable appears in exactly three equations and, moreover, each weight w j equals 1 and no two equations have the same left-hand side. We show the tightness of this result by proving that if each equation has at most two variables then the parameterized problem is fixed-parameter tractable. We also prove that if no variable appears in more than two equations then we can maximize the total weight of satisfied equations in polynomial time. 相似文献