期刊文献+
共找到96,408篇文章
< 1 2 250 >
每页显示 20 50 100
An effective framework for asynchronous incremental graph processing
1
作者 Xinqiao LV Wei XIAO +3 位作者 Yu ZHANG Xiaofei LIAO Hai JIN Qiangsheng HUA 《中国计算机科学前沿:英文版》 SCIE EI CSCD 2019年第3期539-551,共13页
Although many graph processing systems have been proposed, graphs in the real-world are often dynamic. It is important to keep the results of graph computation up-todate. Incremental computation is demonstrated to be ... Although many graph processing systems have been proposed, graphs in the real-world are often dynamic. It is important to keep the results of graph computation up-todate. Incremental computation is demonstrated to be an efficient solution to update calculated results. Recently, many incremental graph processing systems have been proposed to handle dynamic graphs in an asynchronous way and are able to achieve better performance than those processed in a synchronous way. However, these solutions still suffer from sub-optimal convergence speed due to their slow propagation of important vertex state (important to convergence speed) and poor locality. In order to solve these problems, we propose a novel graph processing framework. It introduces a dynamic partition method to gather the important vertices for high locality, and then uses a priority-based scheduling algorithm to assign them with a higher priority for an effective processing order. By such means, it is able to reduce the number of updates and increase the locality, thereby reducing the convergence time. Experimental results show that our method reduces the number of updates by 30%, and reduces the total execution time by 35%, compared with state-of-the-art systems. 展开更多
关键词 INCREMENTAL COMPUTATION GRAPH processing ITERATIVE COMPUTATION ASYNCHRONOUS CONVERGENCE
Convolutional neural network based detection and judgement of environmental obstacle in vehicle operation 预览
2
作者 Guanqiu Qi Huan Wang +3 位作者 Matthew Haner Chenjie Weng Sixin Chen Zhiqin Zhu 《智能技术学报》 2019年第2期80-91,共12页
Precise real-time obstacle recognition is both vital to vehicle automation and extremely resource intensive. Current deep-learning based recognition techniques generally reach high recognition accuracy, but require ex... Precise real-time obstacle recognition is both vital to vehicle automation and extremely resource intensive. Current deep-learning based recognition techniques generally reach high recognition accuracy, but require extensive processing power. This study proposes a region of interest extraction method based on the maximum difference method and morphology, and a target recognition solution created with a deep convolutional neural network. In the proposed solution, the central processing unit and graphics processing unit work collaboratively. Compared with traditional deep learning solutions, the proposed solution decreases the complexity of algorithm, and improves both calculation efficiency and recognition accuracy. Overall it achieves a good balance between accuracy and computation. 展开更多
关键词 RECOGNITION study COMPUTATION
在线阅读 免费下载
On Multicast Routing With Network Coding:A Multiobjective Artificial Bee Colony Algorithm 预览
3
作者 Huanlai Xing Fuhong Song +1 位作者 Lianshan Yan Wei Pan 《中国通信:英文版》 SCIE CSCD 2019年第2期160-176,共17页
This paper is concerned with two important issues in multicast routing problem with network coding for the first time,namely the load balancing and the transmission delay.A bi-objective optimization problem is formula... This paper is concerned with two important issues in multicast routing problem with network coding for the first time,namely the load balancing and the transmission delay.A bi-objective optimization problem is formulated,where the average bandwidth utilization ratio and the average transmission delay are both to be minimized.To address the problem,we propose a novel multiobjective artificial bee colony algorithm,with two performance enhancing schemes integrated.The first scheme is an elitism-based food source generation scheme for scout bees,where for each scout bee,a new food source is generated by either recombining two elite solutions randomly selected from an archive or sampling the probabilistic distribution model built from all elite solutions in this archive.This scheme provides scouts with high-quality and diversified food sources and thus helps to strengthen the global exploration.The second one is a Pareto local search operator with the concept of path relinking integrated.This scheme is incorporated into the onlooker bee phase for exploring neighboring areas of promising food sources and hence enhances the local exploitation.Experimental results show that the proposed algorithm performs better than a number of state-of-the-art multiobjective evolutionary algorithms in terms of the approximated Pareto-optimal front. 展开更多
关键词 EVOLUTIONARY computation MULTICAST network coding SWARM INTELLIGENCE
在线阅读 下载PDF
Energy-Efficient Computation Offloading and Resource Allocation in Fog Computing for Internet of Everything 预览
4
作者 Qiuping Li Junhui Zhao +1 位作者 Yi Gong Qingmiao Zhang 《中国通信:英文版》 SCIE CSCD 2019年第3期32-41,共10页
With the dawning of the Internet of Everything(IoE)era,more and more novel applications are being deployed.However,resource constrained devices cannot fulfill the resource-requirements of these applications.This paper... With the dawning of the Internet of Everything(IoE)era,more and more novel applications are being deployed.However,resource constrained devices cannot fulfill the resource-requirements of these applications.This paper investigates the computation offloading problem of the coexistence and synergy between fog computing and cloud computing in IoE by jointly optimizing the offloading decisions,the allocation of computation resource and transmit power.Specifically,we propose an energy-efficient computation offloading and resource allocation(ECORA)scheme to minimize the system cost.The simulation results verify the proposed scheme can effectively decrease the system cost by up to 50%compared with the existing schemes,especially for the scenario that the computation resource of fog computing is relatively small or the number of devices increases. 展开更多
关键词 FOG COMPUTING cloud COMPUTING resource allocation COMPUTATION OFFLOADING IoE
在线阅读 下载PDF
Error-detected single-photon quantum routing using a quantum dot and a double-sided microcavity system
5
作者 刘阿鹏 程留永 +3 位作者 郭奇 苏石磊 王洪福 张寿 《中国物理B:英文版》 SCIE EI CAS CSCD 2019年第2期111-116,共6页
Based on a hybrid system consisting of a quantum dot coupled with a double-sided micropillar cavity, we investigate the implementation of an error-detected photonic quantum routing controlled by the other photon. The ... Based on a hybrid system consisting of a quantum dot coupled with a double-sided micropillar cavity, we investigate the implementation of an error-detected photonic quantum routing controlled by the other photon. The computational errors from unexpected experimental imperfections are heralded by single photon detections, resulting in a unit fidelity for the present scheme, so that this scheme is intrinsically robust. We discuss the performance of the scheme with currently achievable experimental parameters. Our results show that the present scheme is efficient. Furthermore, our scheme could provide a promising building block for quantum networks and distributed quantum information processing in the future. 展开更多
关键词 QUANTUM ROUTING error-detected QUANTUM computation QUANTUM information processing
LUMP AND INTERACTION SOLUTIONS TO LINEAR (4+1)-DIMENSIONAL PDES 预览
6
作者 马文秀 《数学物理学报:B辑英文版》 SCIE CSCD 2019年第2期498-508,共11页
Taking a class of linear(4+1)-dimensional partial differential equations as examples, we would like to show that there exist lump solutions and interaction solutions in(4+1)-dimensions. We will compute abundant lump s... Taking a class of linear(4+1)-dimensional partial differential equations as examples, we would like to show that there exist lump solutions and interaction solutions in(4+1)-dimensions. We will compute abundant lump solutions and interaction solutions to the considered linear(4+1)-dimensional partial differential equations via symbolic computations,and plot three specific solutions with Maple plot tools, which supplements the existing literature on lump, rogue wave and breather solutions and their interaction solutions in soliton theory. 展开更多
关键词 SYMBOLIC COMPUTATION lump solution: INTERACTION SOLUTION
在线阅读 下载PDF
Precise geoid computation using Stokes-Helmert’s scheme and strict integrals of topographic effects
7
作者 Dongmei Guo Huiyou He Peng Sang 《大地测量与地球动力学:英文版》 2019年第4期290-296,共7页
The high-precision local geoid model was computed based on the improved Stokes-Helmert0 s boundary value problem and strict integrals of topographic effects. This proposed method involves three steps.First, the mathem... The high-precision local geoid model was computed based on the improved Stokes-Helmert0 s boundary value problem and strict integrals of topographic effects. This proposed method involves three steps.First, the mathematical form of Stokes-Helmert0 s boundary value problem was derived, and strict computational formulas regarding topographic effects were provided to overcome the disadvantage of planar approximations. Second, a gravimetric geoid model was constructed using the proposed StokesHelmert0 s scheme with a heterogeneous data set. Third, a least squares adjustment method combined with a multi-surface function model was employed to remove the bias between the gravimetric geoid model and the GNSS/leveling data and to refine the final local geoid model. The accuracy of the final geoid model was evaluated using independent GNSS/leveling data. Numerical results show that an external precision of 1.45 cm is achievable. 展开更多
关键词 GEOID COMPUTATION Stokes-Helmert’s method Surface integration Heterogeneous HEIGHTS
融合应用网络中模糊目标计算机制的研究 预览
8
作者 余庚 《舰船电子工程》 2019年第2期35-37,共3页
论文针对融合应用网络中因不可预测的外界因素对信标发起的影响,进而导致其向全局广播伪信息引发了目标计算错误的情形,提出一种目标计算机制。文中首先对目标计算机制进行可行性分析,并结合融合网络目标模糊特征建立计算模型。其次,引... 论文针对融合应用网络中因不可预测的外界因素对信标发起的影响,进而导致其向全局广播伪信息引发了目标计算错误的情形,提出一种目标计算机制。文中首先对目标计算机制进行可行性分析,并结合融合网络目标模糊特征建立计算模型。其次,引入参数用于甄别异常信标和筛查伪数据。然后构建模糊目标计算算法。最后在模拟环境中搭建测试模型,通过调整呼损距离和异常信标规模来考察本文研究算法相对于传统研究的优势。所收集的实验数据表明,模糊目标计算机制对信标性能的偏好度最弱,对模糊目标评估的贡献度最高。 展开更多
关键词 融合 模糊 计算 优势 测试
在线阅读 下载PDF
The Efficient Computation of Aircraft Range Problem
9
作者 Fang YU Jin-chuan CUI 《应用数学学报:英文版》 CSCD 2019年第4期862-872,共11页
The goal of efficient computation is to determine reasonable computing cost in polynomial time by using data structure of instance, and analyze the computing cost of satisfactory solution which can meet user’s requir... The goal of efficient computation is to determine reasonable computing cost in polynomial time by using data structure of instance, and analyze the computing cost of satisfactory solution which can meet user’s requirements. When faced with NP-hard problem, we usually assess computational performance in the worst case. Polynomial algorithm cannot handle with NP-hard problem, so we research on NP-hard problem from efficient computation point of view. The work is intended to fill the blank of computational complexity theory.We focus on the cluster structure of instance data of aircraft range problem. By studying the partition and complexity measurement of cluster, we establish a connection between the aircraft range problem and N-vehicle exploration problem, and construct the efficient computation mechanism for aircraft range problem. The last examples show that the effect is significant when we use efficient computation mechanism on aircraft range problem. Decision makers can calculate the computing cost before actually computing. 展开更多
关键词 COMPUTATIONAL COMPLEXITY efficient COMPUTATION mechanism AIRCRAFT RANGE PROBLEM cluster
Realization of -bit semiclassical quantum Fourier transform on IBM’s quantum cloud computer
10
作者 付向群 鲍皖苏 +5 位作者 黄合良 李坦 史建红 汪翔 张硕 李风光 《中国物理B:英文版》 SCIE EI CAS CSCD 2019年第2期117-122,共6页
To overcome the difficulty of realizing large-scale quantum Fourier transform(QFT) within existing technology, this paper implements a resource-saving method(named t-bit semiclassical QFT over Z2n), which could realiz... To overcome the difficulty of realizing large-scale quantum Fourier transform(QFT) within existing technology, this paper implements a resource-saving method(named t-bit semiclassical QFT over Z2n), which could realize large-scale QFT using an arbitrary-scale quantum register. By developing a feasible method to realize the control quantum gate Rk, we experimentally realize the 2-bit semiclassical QFT over Z23 on IBM’s quantum cloud computer, which shows the feasibility of the method. Then, we compare the actual performance of 2-bit semiclassical QFT with standard QFT in the experiments.The squared statistical overlap experimental data shows that the fidelity of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to fewer two-qubit gates in the semiclassical QFT. Furthermore, based on the proposed method, N = 15 is successfully factorized by implementing Shor’s algorithm. 展开更多
关键词 QUANTUM cloud COMPUTATION QUANTUM FOURIER TRANSFORM SEMICLASSICAL QUANTUM FOURIER TRANSFORM Shor’s algorithm
Superconductivity in topological semimetals
11
作者 Jian Wang 《国家科学评论:英文版》 CSCD 2019年第2期199-202,共4页
Topological superconductors, where the bulk state shows superconducting gap and Majorana fermions constitute gapless edge states, have become one of the most important topics in physical sciences. Majorana fermions ar... Topological superconductors, where the bulk state shows superconducting gap and Majorana fermions constitute gapless edge states, have become one of the most important topics in physical sciences. Majorana fermions are their own antiparticles and Majorana quasiparticles in a solid-state system obey non-Abelian statistics;and thus can be used for faulttolerant topological quantum computation. 展开更多
关键词 SUPERCONDUCTORS STATES COMPUTATION
“可计算”的迷思:计算导向的新闻生产及其公共性效应 预览
12
作者 王昀 《湖南师范大学社会科学学报》 CSSCI 北大核心 2019年第1期23-31,共9页
媒介组织积极拥抱数据、算法与社会科学方法的过程中,“计算”成为了重思新闻实践的主导性观念话语。相较于技术本身,人们需要更为在意的是,此种植入新闻产制的计算观念对公共政治生活产生的深远影响。新媒介变革带来的量化转向推动了... 媒介组织积极拥抱数据、算法与社会科学方法的过程中,“计算”成为了重思新闻实践的主导性观念话语。相较于技术本身,人们需要更为在意的是,此种植入新闻产制的计算观念对公共政治生活产生的深远影响。新媒介变革带来的量化转向推动了新闻生产网络的多元协作趋势,新闻业也逐渐掌握更多工具实现意见气候的可视化挖掘。同时,计算方法在阐释制度行为互动性、参与社会治理与决策评估中发挥的优势,进一步提供了新闻业延展其社会功能的可能性。不过,面对新传播语境下的“神话”,我们也必须叩问计算范式与公共参与之间的关系,其如何解决新闻生产面临的种种危机,以及被应用于公共性研究的适用性争议。研究者仍需审视计算方法衍生的种种迷思,将新闻生产植入更为宽广的政治、经济与文化语境,去考量计算导向之所以形成的竞合与协商空间。 展开更多
关键词 计算 新闻生产 公共性 迷思
在线阅读 下载PDF
Conformer Pair Contributions to Optical Rotations in a Series of Chiral Linear Aiiphatic Alcohols
13
作者 ZHAO Dan REN Jie +3 位作者 XIONG Yongfei DONG Mengxiang ZHU Huajie Charles U.PITTMAN.Jr. 《高等学校化学研究:英文版》 SCIE CAS CSCD 2019年第1期109-119,共11页
The chain length effect of four chiral aliphatic alcohols,(S)-2-butanol,(S)-2-pentanol,(S)-2-hexanol and (S)-2-heptanol,on their specific optical rotations(OR)was studied experimentally and theoretically via quantum t... The chain length effect of four chiral aliphatic alcohols,(S)-2-butanol,(S)-2-pentanol,(S)-2-hexanol and (S)-2-heptanol,on their specific optical rotations(OR)was studied experimentally and theoretically via quantum theory.Many conformations of each chiral alcohol exist as conformer pairs in solution.The OR sum from these pairs of conformers has much smaller contributions to OR values than that contributed by the most stable conformation. These four alcohols'OR values were also investigated using the matrix model,which employs each substituent's comprehensive mass,radii,electronegativity and symmetry number as the elements in the matrix.These are all particle properties.This matrix determinant is proportional to its OR values within a closely related structural series of chiral compounds.The experimental OR values and the matrix determinants of these four alcohols were compared with the predicted OR values obtained from quantum theory wave functions.The ORs predicted by the matrix method, which is based on particle function statistics,agreed with the results from quantum theory.The agreement between OR predictions by the matrix method and DFT calculations illustrates the wave-particle duality of polarized light that is operating in these predictions. 展开更多
关键词 Optical ROTATION ABSOLUTE configuration CONFORMER PAIR Matrix model Quantum computation
Sequential Fault Diagnosis Using an Inertial Velocity Differential Evolution Algorithm
14
作者 Xiao-Hong Qiu Yu-Ting Hu Bo Li 《国际自动化与计算杂志:英文版》 EI CSCD 2019年第3期389-397,共9页
The optimal test sequence design for fault diagnosis is a challenging NP-complete problem.An improved differential evolution(DE)algorithm with additional inertial velocity term called inertial velocity differential ev... The optimal test sequence design for fault diagnosis is a challenging NP-complete problem.An improved differential evolution(DE)algorithm with additional inertial velocity term called inertial velocity differential evolution(IVDE)is proposed to solve the optimal test sequence problem(OTP)in complicated electronic system.The proposed IVDE algorithm is constructed based on adaptive differential evolution algorithm.And it is used to optimize the test sequence sets with a new individual fitness function including the index of fault isolation rate(FIR)satisfied and generate diagnostic decision tree to decrease the test sets and the test cost.The simulation results show that IVDE algorithm can cut down the test cost with the satisfied FIR.Compared with the other algorithms such as particle swarm optimization(PSO)and genetic algorithm(GA),IVDE can get better solution to OTP. 展开更多
关键词 Differential evolution(DE) EVOLUTIONARY computation FAULT isolation rate(FIR) TESTABILITY FAULT diagnosis
Aggregation Tree Statistical Computing Based on Functional Encryption
15
作者 XIANG Guangli WANG Dengjia +1 位作者 YU Benzhi LI Ankang 《武汉大学学报:自然科学英文版》 CAS CSCD 2019年第2期116-124,共9页
The medical monitoring system is widely used. In the medical monitoring system, each user only possesses one piece of data logging that participates in statistical computing. Specifically in such a situation, a feasib... The medical monitoring system is widely used. In the medical monitoring system, each user only possesses one piece of data logging that participates in statistical computing. Specifically in such a situation, a feasible solution is to scatter its statistical computing workload to corresponding statistical nodes. Moreover, there are still two problems that should be resolved. One is how the server takes advantage of intermediate results obtained through statistical node aggregation to perform statistical computing. Statistical variable decomposition technique points out the direction for statistical projects. The other problem is how to design an efficient topological structure for statistical computing. In this paper, tree topology was adopted to implement data aggregation to improve aggregation efficiency. And two experiments were done for time consumption of statistical computing which focuses on encrypted data aggregation and encrypted data computing. The first experiment indicates that encrypted data aggregation efficiency of the scheme proposed in this paper is better than that of Drosatos, scheme, and the second indicates that improving computing power of the server or computational efficiency of the functional encryption scheme can shorten the computation time. 展开更多
关键词 TREE TOPOLOGY MULTIPARTY STATISTICAL COMPUTATION function ENCRYPTION
Novel quantum secret image-sharing scheme
16
作者 罗高峰 周日贵 胡文文 《中国物理B:英文版》 SCIE EI CAS CSCD 2019年第4期61-69,共9页
In this paper, we propose a novel quantum secret image-sharing scheme which constructs m quantum secret images into m+1 quantum share images. A chaotic image generated by the logistic map is utilized to assist in the ... In this paper, we propose a novel quantum secret image-sharing scheme which constructs m quantum secret images into m+1 quantum share images. A chaotic image generated by the logistic map is utilized to assist in the construction of quantum share images first. The chaotic image and secret images are expressed as quantum image representation by using the novel enhanced quantum representation. To enhance the confidentiality, quantum secret images are scrambled into disordered images through the Arnold transform. Then the quantum share images are constructed by performing a series of quantum swap operations and quantum controlled-NOT operations. Because all quantum operations are invertible, the original quantum secret images can be reconstructed by performing a series of inverse operations. Theoretical analysis and numerical simulation proved both the security and low computational complexity of the scheme, which has outperformed its classical counterparts. It also provides quantum circuits for sharing and recovery processes. 展开更多
关键词 QUANTUM IMAGE processing SECRET IMAGE SHARING QUANTUM COMPUTATION QUANTUM CIRCUIT
A coupled-channel lattice study of the resonance-like structure Zc(3900)
17
作者 陈婷 陈莹 +7 位作者 宫明 刘川 刘柳明 刘玉斌 刘朝峰 马建平 Markus Werner 张剑波 《中国物理C:英文版》 SCIE CAS CSCD 2019年第10期24-37,共14页
In this exploratory study, near-threshold scattering of D and D^-* meson is investigated using lattice QCD with Nf=2+1+1 twisted mass fermion configurations. The calculation is performed in the coupled-channel Lü... In this exploratory study, near-threshold scattering of D and D^-* meson is investigated using lattice QCD with Nf=2+1+1 twisted mass fermion configurations. The calculation is performed in the coupled-channel Lüscher finite-size formalism. The study focuses on the channel with I^G(J^PC)=1^+(1+^+-) where the resonance-like structure Zc(3900) was discovered. We first identify the two most relevant channels and the lattice study is performed in the two-channel scattering model. Combined with the two-channel Ross-Shaw theory, scattering parameters are extracted from the energy levels by solving the generalized eigenvalue problem. Our results for the scattering length parameters suggest that for the particular lattice parameters that we studied, the best fit parameters do not correspond to the peak in the elastic scattering cross-section near the threshold. Furthermore, in the zero-range Ross-Shaw theory, the scenario of a narrow resonance close to the threshold is disfavored beyond the 3σ level. 展开更多
关键词 Luescher FORMALISM LATTICE QCD computation EXOTIC MESONS
Solving multi-scenario cardinality constrained optimization problems via multi-objective evolutionary algorithms
18
作者 Xing ZHOU Huaimin WANG +2 位作者 Wei PENG Bo DING Rui WANG 《中国科学:信息科学(英文版)》 SCIE EI CSCD 2019年第9期73-90,共18页
Cardinality constrained optimization problems(CCOPs) are fixed-size subset selection problems with applications in several fields. CCOPs comprising multiple scenarios, such as cardinality values that form an interval,... Cardinality constrained optimization problems(CCOPs) are fixed-size subset selection problems with applications in several fields. CCOPs comprising multiple scenarios, such as cardinality values that form an interval, can be defined as multi-scenario CCOPs(MSCCOPs). An MSCCOP is expected to optimize the objective value of each cardinality to support decision-making processes. When the computation is conducted using traditional optimization algorithms, an MSCCOP often requires several passes(algorithmic runs) to obtain all the(near-)optima, where each pass handles a specific cardinality. Such separate passes abandon most of the knowledge(including the potential superior solution structures) learned in one pass that can also be used to improve the results of other passes. By considering this situation, we propose a generic transformation strategy that can be referred to as the Mucard strategy, which converts an MSCCOP into a low-dimensional multi-objective optimization problem(MOP) to simultaneously obtain all the(near-)optima of the MSCCOP in a single algorithmic run. In essence, the Mucard strategy combines separate passes that deal with distinct variable spaces into a single pass, enabling knowledge reuse and knowledge interchange of each cardinality among genetic individuals. The performance of the Mucard strategy was demonstrated using two typical MSCCOPs. For a given number of evolved individuals, the Mucard strategy improved the accuracy of the obtained solutions because of the in-process knowledge than that obtained by untransformed evolutionary algorithms, while reducing the average runtime. Furthermore, the equivalence between the optimal solutions of the transformed MOP and the untransformed MSCCOP can be theoretically proved. 展开更多
关键词 EVOLUTIONARY computation multi-objective OPTIMIZATION cardinality-constrained OPTIMIZATION PROBLEM multiple scenarios transformation P-MEDIAN PROBLEM PORTFOLIO OPTIMIZATION PROBLEM
Two-dimensional materials for synaptic electronics and neuromorphic systems
19
作者 Shuiyuan Wang David Wei Zhang Peng Zhou 《科学通报:英文版》 SCIE EI CSCD 2019年第15期1056-1066,共11页
Synapses in biology provide a variety of functions for the neural system. Artificial synaptic electronics that mimic the biological neuron functions are basic building blocks and developing novel artificial synapses i... Synapses in biology provide a variety of functions for the neural system. Artificial synaptic electronics that mimic the biological neuron functions are basic building blocks and developing novel artificial synapses is essential for neuromorphic computation. Inspired by the unique features of biological synapses that the basic connection components of the nervous system and the parallelism, low power consumption, fault tolerance, self-learning and robustness of biological neural systems, artificial synaptic electronics and neuromorphic systems have the potential to overcome the traditional von Neumann bottleneck and create a new paradigm for dealing with complex problems such as pattern recognition, image classification, decision making and associative learning. Nowadays, two-dimensional(2 D) materials have drawn great attention in simulating synaptic dynamic plasticity and neuromorphic computing with their unique properties. Here we describe the basic concepts of bio-synaptic plasticity and learning, the 2 D materials library and its preparation. We review recent advances in synaptic electronics and artificial neuromorphic systems based on 2 D materials and provide our perspective in utilizing 2 D materials to implement synaptic electronics and neuromorphic systems in hardware. 展开更多
关键词 Artificial SYNAPTIC ELECTRONICS Neuromorphic COMPUTATION 2D MATERIALS SYNAPTIC PLASTICITY Hebbian learning
Topological dynamical decoupling
20
作者 Jiang Zhang Xiao-Dong Yu +1 位作者 Gui-Lu Long and Qi-Kun Xue 《中国科学:物理学、力学、天文学英文版》 SCIE EI CAS CSCD 2019年第12期2-9,共8页
We show that topological equivalence classes of circles in a two-dimensional square lattice can be used to design dynamical decoupling procedures to protect qubits attached on the edges of the lattice. Based on the ci... We show that topological equivalence classes of circles in a two-dimensional square lattice can be used to design dynamical decoupling procedures to protect qubits attached on the edges of the lattice. Based on the circles of the topologically trivial class in the original and the dual lattices, we devise a procedure which removes all kinds of local Hamiltonians from the dynamics of the qubits while keeping information stored in the homological degrees of freedom unchanged. If only the linearly independent interaction and nearest-neighbor two-qubit interactions are concerned, a much simpler procedure which involves the four equivalence classes of circles can be designed. This procedure is compatible with Eulerian and concatenated dynamical decouplings,which make it possible to implement the procedure with bounded-strength controls and for a long time period. As an application,it is shown that our method can be directly generalized to finite square lattices to suppress uncorrectable errors in surface codes. 展开更多
关键词 dynamical decoupling surface codes topological quantum computation
上一页 1 2 250 下一页 到第
使用帮助 返回顶部 意见反馈