检索结果-内蒙古大学图书馆

arXiv 2018年

作者： Wang, Xin Wilde, Mark M. Institute for Quantum Computing Baidu Research Beijing100093 China Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Hearne Institute for Theoretical Physics Department of Physics and Astronomy Center for Computation and Technology Louisiana State University Baton RougeLA70803 United States School of Electrical and Computer Engineering Cornell University IthacaNY14850 United States

This paper establishes single-letter formulas for the exact entanglement cost of simulating quantum channels under free quantum operations that completely preserve positivity of the partial transpose (PPT). First, we introduce the κ-entanglement measure for point-to-point quantum channels, based on the idea of the κ-entanglement of bipartite states, and we establish several fundamental properties for it, including amortization collapse, monotonicity under PPT superchannels, additivity, normalization, faithfulness, and non-convexity. Second, we introduce and solve the exact entanglement cost for simulating quantum channels in both the parallel and sequential settings, along with the assistance of free PPT-preserving operations. In particular, we establish that the entanglement cost in both cases is given by the same single-letter formula, the κ-entanglement measure of a quantum channel. We further show that this cost is equal to the largest κ-entanglement that can be shared or generated by the sender and receiver of the channel. This formula is calculable by a semidefinite program, thus allowing for an efficiently computable solution for general quantum channels. Noting that the sequential regime is more powerful than the parallel regime, another notable implication of our result is that both regimes have the same power for exact quantum channel simulation, when PPT superchannels are free. For several basic Gaussian quantum channels, we show that the exact entanglement cost is given by the Holevo-Werner formula [Holevo and Werner, Phys. Rev. A 63, 032312 (2001)], giving an operational meaning of the Holevo-Werner quantity for these channels. Copyright © 2018, The Authors. All rights reserved.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Data based reconstruction of complex multiplex networks

arXiv

引用

arXiv 2018年

作者： Ma, Chuang Chen, Han-Shuang Li, Xiang Lai, Ying-Cheng Zhang, Hai-Feng School of Mathematical Science Anhui University Hefei230601 China School of Physics and Material Science Anhui University Hefei230601 China Adaptive Networks and Control Laboratory Department of Electronic Engineering Center of Smart Networks and Systems School of Information Science and Engineering Fudan University Shanghai200433 China School of Electrical Computer and Energy Engineering Arizona State University TempeAZ85287 United States Department of Communication Engineering North University of China Taiyuan Shanxi030051 China

It has been recognized that many complex dynamical systems in the real world require a description in terms of multiplex networks, where a set of common, mutually connected nodes belong to distinct network layers and play a different role in each layer. In spite of recent progress towards data based inference of single-layer networks, to reconstruct complex systems with a multiplex structure remains largely open. We articulate a mean-field based maximum likelihood estimation framework to solve this outstanding and challenging problem. We demonstrate the power of the reconstruction framework and characterize its performance using binary time series from a class of prototypical duplex network systems that host two distinct types of spreading dynamics. In addition to validating the framework using synthetic and real-world multiplex networks, we carry out a detailed analysis to elucidate the impacts of structural and dynamical parameters as well as noise on the reconstruction accuracy and robustness. Copyright © 2018, The Authors. All rights reserved.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

Secure quantum communication in the presence of phase- and polarization-dependent loss

引用

Physical Review A 2018年第4期98卷 042324-042324页

作者： Chenyang Li Marcos Curty Feihu Xu Olinka Bedroya Hoi-Kwong Lo Center for Quantum Information and Quantum Control Department of Electrical & Computer Engineering and Department of Physics University of Toronto Toronto Ontario M5S 3G4 Canada Escuela de Ingeniería de Telecomunicación Department of Signal Theory and Communications University of Vigo Vigo E-36310 Spain Shanghai Branch Hefei National Laboratory for Physical Sciences at the Microscale University of Science and Technology of China Shanghai 201315 China

Silicon photonics holds the promise of the miniaturization of quantum communication devices. Recently, silicon chip optical transmitters for quantum key distribution (QKD) have been built and demonstrated experimentally. Nonetheless, these silicon chips suffer substantial phase- and polarization-dependent loss (PDL) which, if unchecked, could compromise the security of QKD systems due to overestimation of the secret key rate. Here, first, we restore the security by regarding single photons without phase and polarization dependence as untagged and secure qubits. Next, by using a postselection technique, we implement a secure QKD protocol that provides a high key generation rate even in the presence of severe phase- and polarization-dependent loss. Our solution is simple to realize in a practical experiment, as it does not require any hardware modification.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Benchmarking quantum processors with a single qubit

arXiv

引用

arXiv 2019年

作者： Göktaş, Oktay Tham, W.K. Bonsma-Fisher, Kent Brodutch, Aharon Agnostiq Labs 100 College St TorontoONM5G 1L5 Canada Department of Physics and Center for Quantum Information and Quantum Control University of Toronto 60 St George St TorontoONM5S 1A7 Canada National Research Council of Canada 100 Sussex Dr. OttawaONK1A 0R6 Canada Edward S. Rogers Department of Electrical and Computer Engineering University of Toronto 10 King's College Road TorontoONM5S 3G4 Canada

The first generation of small noisy quantum processors have recently become available to non-specialists who are not required to understand specifics of the physical platforms and, in particular, the types and sources of noise. As such, it is useful to benchmark the performance of such computers against specific tasks that may be of interest to users, ideally keeping both the circuit depth and width as free parameters. Here we benchmark the IBM Quantum Experience using the Deterministic Quantum Computing with 1 qubit (DQC1) algorithm originally proposed by Knill and Laflamme in the context of liquid state NMR. In the first set of experiments we use DQC1 as a trace estimation algorithm to produce visibility plots. In the second set we use this trace estimation algorithm to distinguish between knots, a classically difficult task which is known to be complete for DQC1. Our results indicate that the main limiting factor is the length of the circuit, and that both random and systematic errors become an issue when the gate count increases. Surprisingly, we find that at the same gate count wider circuits perform better, probably due to randomization of coherent errors. Copyright © 2019, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

An optimized energy management strategy for fuel cell hybrid vehicles

引用

IOP Conference Series: Materials Science and engineering 2019年第4期612卷

作者： Wenxin Xiao Lei Wang Dongyin Liu Wenwen Zhang Chinese-German College Tongji University Shanghai China Department of Electrical and Computer Engineering Technische Universität München Munich Germany Research Center of Control Science and Intelligent System University of Electronic Science and Technology of China Chengdu China College of Electronics and Information Engineering Tongji University Shanghai China

Fuel cell hybrid vehicles are environmentally friendly and have good development prospects. Their energy management is very important, but there are currently few studies on this topic. In this paper, an optimized energy management strategy specifically applied to fuel cell hybrid vehicles is proposed. Fuel cell hybrid vehicles have some different characteristics from ordinary hybrid vehicles, which need to be considered in energy management. For the fuel cell to remain activated during driving, its output power must remain above a minimum power. In addition, it takes some time for the fuel cell to start up. These characteristics are considered in the vehicle model. The energy management strategy proposed in this paper maximizes energy use efficiency by controlling the SOC value of the battery. The SOC value of the battery is in the proper range during driving. At high speeds, fuel is consumed as a source of energy and the battery is charged to keep its SOC at a high level. When approaching the destination or when the vehicle is traveling at a low speed, the battery is discharged to reduce fuel consumption. Applying this strategy to the ECE-15 and EUDCL environments, the simulation results show that this optimized energy management strategy improves the energy efficiency of the fuel cell and enables the battery to operate at the appropriate power.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Consensus Problem in General Linear Multiagent Systems Under Stochastic Topologies

引用

IFAC-PapersOnLine 2016年第13期49卷 13-18页

作者： Rezaee, Hamed Abdollahi, Farzaneh The Center of Excellence on Control and Robotics Department of Electrical Engineering Amirkabir University of Technology Tehran Iran Department of Electrical and Computer Engineering Concordia University MontrealQuebec Canada

Consensus control of a class of multiagent systems with general linear dynamics is studied. Based on solution of some linear matrix inequalities, a protocol is obtained which guarantees achieving consensus among agents in the presences of stochastically switching topologies. By invoking the concept super-martingales, it is shown that if the probability of the network connectivity is not zero, the agents reach almost sure consensus upon their state vectors. Despite existing results in the literature for consensus control of general linear multiagent systems under stochastic networks, the proposed consensus protocol in this paper requires no knowledge on the set of feasible topologies, and this issue significantly decreases the design computational costs. Simulation results for a diving consensus problem among a team of autonomous underwater vehicles validate the proposed consensus protocol. © 2016

关键词： Multi agent systems Autonomous underwater vehicles Linear matrix inequalities Stochastic systems Topology Almost sure consensus computational costs Consensus problems Consensus protocols Linear dynamics Network connectivity Of autonomous underwater vehicles Stochastic networks

来源：评论

学校读者我要写书评

暂无评论

Accuracy analysis for distributed weighted least-squares estimation in finite steps and loopy networks

arXiv

引用

arXiv 2018年

作者： Sui, Tianju Marelli, Damián Fu, Minyue Lu, Renquan Department of Control Science and Engineering Dalian University of Technology Liaoning China School of Automation Guandong University of Technology Guangzhou China French-Argentinean International Center for Information and Systems Sciences National Scientific and Technical Research Council Ocampo y Esmeralda Rosario2000 Argentina School of Electrical Engineering and Computer Science University of Newcastle University Drive CallaghanNSW2308 Australia

Distributed parameter estimation for large-scale systems is an active research problem. The goal is to derive a distributed algorithm in which each agent obtains a local estimate of its own subset of the global parameter vector, based on local measurements as well as information received from its neighbours. A recent algorithm has been proposed, which yields the optimal solution (i.e., the one that would be obtained using a centralized method) in finite time, provided the communication network forms an acyclic graph. If instead, the graph is cyclic, the only available alternative algorithm, which is based on iterative matrix inversion, achieving the optimal solution, does so asymptotically. However, it is also known that, in the cyclic case, the algorithm designed for acyclic graphs produces a solution which, although non optimal, is highly accurate. In this paper we do a theoretical study of the accuracy of this algorithm, in communication networks forming cyclic graphs. To this end, we provide bounds for the sub-optimality of the estimation error and the estimation error covariance, for a class of systems whose topological sparsity and signal-to-noise ratio satisfy certain condition. Our results show that, at each node, the accuracy improves exponentially with the so-called loop-free depth. Also, although the algorithm no longer converges in finite time in the case of cyclic graphs, simulation results show that the convergence is significantly faster than that of methods based on iterative matrix inversion. Our results suggest that, depending on the loop-free depth, the studied algorithm may be the preferred option even in applications with cyclic communication graphs. Copyright © 2018, The Authors. All rights reserved.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

Breast Cancer Diagnosis Using an Unsupervised Feature Extraction Algorithm Based on Deep Learning

Breast Cancer Diagnosis Using an Unsupervised Feature Extrac...

引用

第37届中国控制会议

作者： Yawen Xiao Jun Wu Zongli Lin Xiaodong Zhao Department of Automation Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information Processing of Ministry of Education The Center for Bioinformatics and Computational Biology Shanghai Key Laboratory of Regulatory Biologythe Institute of Biomedical Sciences and School of Life SciencesEast China Normal University Charles L.Brown Department of Electrical and Computer Engineering University of Virginia School of Biomedical Engineering Shanghai Jiao Tong University

Breast cancer is the most often detected cancer in women. At the same time, it is one of the most curable types of cancer if diagnosed early. With the development of the detection technology, a growing amount of clinical data and highdimensional features can be used for breast cancer diagnosis. The high-dimensional data contributes to advances in the diagnostic technology, but also incurs a large amount of computational redundancy. Thus, extracting important information and reducing the feature dimension is critical to effective prediction and an accurate treatment ***, the previous works for breast cancer diagnosis are mainly based on labeled data that is difficult to obtain. To address this issue, in this paper, we demonstrate a new scheme, which integrates a deep learning based unsupervised feature extraction algorithm, the stacked auto-encoders, with a support vector machine model（SAE-SVM）, for breast cancer diagnosis. The stacked auto-encoders with the greedy layerwise pre-training and an improved momentum update algorithm is applied to capture essential information and extract necessary features of the original data. Then, a support vector machine model is employed to classify the samples with new features into malignant or benign tumors. The proposed method was tested on the Wisconsin Diagnostic Breast Cancer data set. The performance is evaluated using various measures and compared with the previously published results. The comparison results show that the proposed SAE-SVM method improves the accuracy to 98.25% and outperforms the other methods. The deep learning based unsupervised feature extraction significantly improves the performance of classification and provides a promising approach to breast cancer diagnosis.

关键词： Deep learning auto-encoder feature extraction breast cancer diagnosis unlabeled data

来源：评论

学校读者我要写书评

暂无评论

Active disturbance rejection control： between the formulation in time and the understanding in frequency

引用

control Theory and Technology 2016年第3期14卷 250-259页

作者： Qing ZHENG Zhiqiang GAO Department of Electrical and Computer Engineering Gannon University Erie PA 16541 U.S.A. Center for Advanced Control Technologies Department of Electrical and Computer Engineering Cleveland State University Cleveland OH 44115 U.S.A.

With the rapid deployments of the active disturbance rejection control （ADRC） as a bonafide industrial technology in the background, this paper summarizes some recent results in the analysis of linear ADRC and offers explanations in the frequency response language with which practicing engineers are familiar. Critical to this endeavor is the concept of bandwidth, which has been used in a more general sense. It is this concept that can serve as the link between the otherwise opaque state space formulation of the ADRC and the command design considerations and concerns shared by practicing engineers. The remarkable characteristics of a simple linear ADRC was first shown in the frequency domain, followed by the corresponding analysis in time domain, where the relationship between the tracking error and the ADRC bandwidth is established. It is shown that such insight is only possible by using the method of solving linear differential equations, instead of the more traditional techniques such as the Lyapunov methods, which tend to be more conservative and difficult to grasp by engineers. The insight obtained from such analysis is further demonstrated in the simulation validation.

关键词： Active disturbance rejection control extended state observer uncertain systems stability bandwidth

来源：评论

学校读者我要写书评

暂无评论

A hybrid systems framework for multi agent task planning and control

A hybrid systems framework for multi agent task planning and...

引用

American control Conference

作者： Maria Guinaldo Dimos V. Dimarogonas Department of Computer Sciences and Automatic Control School of Computer Engineering UNED Madrid Spain ACCESS Linneaeus Center School of Electrical Engineering KTH Stockholm Sweden

ISBN: (纸本)9781509045839

In this paper, we investigate the coordination of a multi-agent system to achieve a high level plan. In, particular, we assume that this planning is decomposed in a sequence of simple control objectives. The coordination is carried out through event-based communications between the agents, and distributed control laws are synthesized to achieve each control objective according to a time-constraint. All the elements (planning, motion, and communication) are integrated in a hybrid systems framework, which also allows to conclude about the achievement of the high level plan.

关键词： hybrid systems Agents Multi-agent systems Communication Research Planning Standing Orders Frameworks communication between animals Event-based

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：