已有的跨句多元关系抽取工作将输入文本表示为集成句内和句间依赖关系的复杂文档图,但图中包含的噪声信息会影响关系抽取的效果。针对这种情况,该文利用Graph state LSTM获得上下文信息,再分别利用词级注意力机制或位置感知的注意力机制...已有的跨句多元关系抽取工作将输入文本表示为集成句内和句间依赖关系的复杂文档图,但图中包含的噪声信息会影响关系抽取的效果。针对这种情况,该文利用Graph state LSTM获得上下文信息,再分别利用词级注意力机制或位置感知的注意力机制,自动聚焦在对关系抽取起到决定性作用的关键词上,降低噪声信息的影响。并且比较了两种注意力机制对使用Graph state LSTM进行关系抽取的影响。通过在一个重要的精确医学数据集上进行实验,验证了该文所提出模型的有效性。展开更多
We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so ...We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.展开更多
In this paper, a scheme for generating various multiatom entangled graph states via resonant interactions is proposed. We investigate the generation of various four-atom graph states first in the ideal case and then i...In this paper, a scheme for generating various multiatom entangled graph states via resonant interactions is proposed. We investigate the generation of various four-atom graph states first in the ideal case and then in the case in which the cavity decay and atomic spontaneous emission are taken into consideration in the process of interaction. More importantly, we improve the possible distortion of the graph states coming from cavity decay and atomic spontaneous emission by performing appropriate unitary transforms on atoms. The generation of multiatom entangled graph states is very important for constructing quantum one-way computer in a fault-tolerant manner. The resonant interaction time is very short, which is important in the sense of decoherence. Our scheme is easy and feasible within the reach of current experimental technology.展开更多
We propose feasible schemes for preparation of all five-atom graph states by cavity quantum electrodynamics （QED）. Our schemes require only the atom-cavity interaction with a large detuning which is available in cur...We propose feasible schemes for preparation of all five-atom graph states by cavity quantum electrodynamics （QED）. Our schemes require only the atom-cavity interaction with a large detuning which is available in current experiment so that these schemes are within the reach of the current technology.展开更多
We propose a scheme for generating multi-ion graph states using many trapped ions in thermal motion.Our generation scheme is insensitive to external state since the interaction between ions and laser fields does not i...We propose a scheme for generating multi-ion graph states using many trapped ions in thermal motion.Our generation scheme is insensitive to external state since the interaction between ions and laser fields does not involvethe external degree of freedom.The scheme can be well realized within the current experimental technique.展开更多
Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entangleme...Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.展开更多
We study the spin squeezing property of weighted graph states,which can be used to improve sensitivity in interferometry.We study the time evolution of spin squeezing under local decoherence acting independently on ea...We study the spin squeezing property of weighted graph states,which can be used to improve sensitivity in interferometry.We study the time evolution of spin squeezing under local decoherence acting independently on each qubit.Based on the analysis,the spin squeezing of the weighted graph states is somehow robust in the presence of decoherence and the decoherence limit in the improvement of the interferometric sensitivity is still achievable.Furthermore,one can obtain the optimal improvement of sensitivity by tuning the weighted of each edges of the weighted graph state.展开更多
We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known...We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.展开更多
To check whether a program behaves in expectation, program monitoring systems are used for intrusion detection. This article presents a program monitoring system using automaton simulation based on the state graphs ex...To check whether a program behaves in expectation, program monitoring systems are used for intrusion detection. This article presents a program monitoring system using automaton simulation based on the state graphs extracted from C programs through static analysis. For complete state graph construction, a pointer alias analysis method is proposed to solve the function pointers for obtaining actual control flows. After compiling, pro- grams are instrumented with probes to report the internal states when they are running. A program monitor is built in the kernel of Linux system, which monitors the states of programs from probes and checks the paths of execution. This monitoring system could respond to the abnormal behaviors immediately to protect the sys- tems and programs from further damages.展开更多
Quantum degenerate code may improve the hashing bound of quantum capacity. We propose a family of quantum degenerate codes derived from two-colorable graphs. The coherent information of the codes is analyticaJly obtai...Quantum degenerate code may improve the hashing bound of quantum capacity. We propose a family of quantum degenerate codes derived from two-colorable graphs. The coherent information of the codes is analyticaJly obtained as a function of the channd noise for the depolarizing channel. We find a new code which has a higher noise threshold than that of the repetition code.展开更多
Quantum many-body problem(QMBP)has become a hot topic in high energy physics and condensed matter physics.With the exponential increasing of the dimension of the Hilbert space,it becomes a big challenge to solve the Q...Quantum many-body problem(QMBP)has become a hot topic in high energy physics and condensed matter physics.With the exponential increasing of the dimension of the Hilbert space,it becomes a big challenge to solve the QMBP even with the most powerful computers.With the rapid development of machine learning,artificial neural networks provide a powerful tool to represent or approximate quantum many-body states.In this paper,we aim to construct explicitly the neural network representations of graph states,without stochastic optimization of the network parameters.Our method shows constructively that all graph states can be represented precisely by proper neural networks originated from[Science,355,602(2017)]and formulated in[Sci.China-Phys.Mech.Astron.,63,210312(2020)].展开更多
We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ＂two-colorable＂ graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2.9...We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ＂two-colorable＂ graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2.9275, less than the upper bound determined by local operations and classical communication. An upper bound of entanglement is proposed based on the definition of graph state.展开更多
Machine learning is currently the most active interdisciplinary field having numerous applications; additionally, machine-learning techniques are used to research quantum many-body problems. In this study, we first pr...Machine learning is currently the most active interdisciplinary field having numerous applications; additionally, machine-learning techniques are used to research quantum many-body problems. In this study, we first propose neural network quantum states(NNQSs) with general input observables and explore a few related properties, such as the tensor product and local unitary operation. Second, we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS. Finally, to quantify the approximation degree of a given pure state, we define the best approximation degree using normalized NNQSs. Furthermore, we observe that some N-qubit states can be represented by a normalized NNQS, such as separable pure states, Bell states and GHZ states.展开更多
This paper considers optimization problems for a new kind of control systems based on non-equilibrium dynamic games.To be precise,the authors consider the infinitely repeated games between a human and a machine based ...This paper considers optimization problems for a new kind of control systems based on non-equilibrium dynamic games.To be precise,the authors consider the infinitely repeated games between a human and a machine based on the generic 2×2 game with fixed machine strategy of finite k-step memory.By introducing and analyzing the state transfer graphes(STG),it will be shown that the system state will become periodic after finite steps under the optimal strategy that maximizes the human’s averaged payoff,which helps us to ease the task of finding the optimal strategy considerably. Moreover,the question whether the optimizer will win or lose is investigated and some interesting phenomena are found,e.g.,for the standard Prisoner’s Dilemma game,the human will not lose to the machine while optimizing her own averaged payoff when k = 1;however,when k≥2,she may indeed lose if she focuses on optimizing her own payoff only The robustness of the optimal strategy and identification problem are also considered.It appears that both the framework and the results are beyond those in the classical control theory and the traditional game theory.展开更多
At-speed testing using external tester requires an expensive equipment, thus built-in self-test (BIST) is an alternative technique due to its ability to perform on-chip at-speed self-testing. The main issue in BIST f...At-speed testing using external tester requires an expensive equipment, thus built-in self-test (BIST) is an alternative technique due to its ability to perform on-chip at-speed self-testing. The main issue in BIST for at-speed testing is to obtain high delay fault coverage with a low hardware overhead. This paper presents an improved loop-based BIST scheme, in which a configurable MISR (multiple-input signature register) is used to generate test-pair sequences. The structure and operation modes of the BIST scheme are described. The topological properties of the state-transit ion- graph of t he proposed B IS T scheme are analyzed. B ased on it, an approach to design and efficiently implement the proposed BIST scheme is developed. Experimental results on academic benchmark circuits are presented to demonstrate the effectiveness of the proposed BIST scheme as well as the design approach.展开更多
文摘已有的跨句多元关系抽取工作将输入文本表示为集成句内和句间依赖关系的复杂文档图,但图中包含的噪声信息会影响关系抽取的效果。针对这种情况,该文利用Graph state LSTM获得上下文信息,再分别利用词级注意力机制或位置感知的注意力机制,自动聚焦在对关系抽取起到决定性作用的关键词上,降低噪声信息的影响。并且比较了两种注意力机制对使用Graph state LSTM进行关系抽取的影响。通过在一个重要的精确医学数据集上进行实验,验证了该文所提出模型的有效性。
文摘We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.
基金Project supported by the National Natural Science Foundation of China (Grant Nos 60678022 and 10704001)the Specialized Research Fund for the Doctoral Program of Higher Education, China (Grant No 20060357008)+2 种基金Anhui Provincial Natural Science Foundation, China (Grant No 070412060)the Key Program of the Education Department of Anhui Province, China (Grant Nos KJ2008A28ZC, KJ2008B83ZC, KJ2008B265 and KJ2007B082)the Talent Foundation of Anhui University, China,and the Anhui Key Laboratory of Information Materials and Devices (Anhui University), China
文摘In this paper, a scheme for generating various multiatom entangled graph states via resonant interactions is proposed. We investigate the generation of various four-atom graph states first in the ideal case and then in the case in which the cavity decay and atomic spontaneous emission are taken into consideration in the process of interaction. More importantly, we improve the possible distortion of the graph states coming from cavity decay and atomic spontaneous emission by performing appropriate unitary transforms on atoms. The generation of multiatom entangled graph states is very important for constructing quantum one-way computer in a fault-tolerant manner. The resonant interaction time is very short, which is important in the sense of decoherence. Our scheme is easy and feasible within the reach of current experimental technology.
文摘We propose feasible schemes for preparation of all five-atom graph states by cavity quantum electrodynamics （QED）. Our schemes require only the atom-cavity interaction with a large detuning which is available in current experiment so that these schemes are within the reach of the current technology.
基金National Natural Science Foundation of China under Grant Nos.60678022 and 10704001the Specialized Research Fund for the Doctoral Program of Higher Education of Anhui Province under Grant No.20060357008+2 种基金Natural Science Foundation of Anhui Province under Grant No.070412060the Talent Foundation of Anhui UniversityAnhui Key Laboratory of Information Materials and Devices (Anhui University)
文摘We propose a scheme for generating multi-ion graph states using many trapped ions in thermal motion.Our generation scheme is insensitive to external state since the interaction between ions and laser fields does not involvethe external degree of freedom.The scheme can be well realized within the current experimental technique.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.60972071 and 11375152)
文摘Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11004029 and 11174052)the Natural Science Foundation of Jiangsu Province of China (Grant No. BK2010422)+2 种基金the Ph. D. Program of the Ministry of Education of Chinathe Excellent Young Teachers Program of Southeast Universitythe National Basic Research Development Program of China(Grant No. 2011CB921203)
文摘We study the spin squeezing property of weighted graph states,which can be used to improve sensitivity in interferometry.We study the time evolution of spin squeezing under local decoherence acting independently on each qubit.Based on the analysis,the spin squeezing of the weighted graph states is somehow robust in the presence of decoherence and the decoherence limit in the improvement of the interferometric sensitivity is still achievable.Furthermore,one can obtain the optimal improvement of sensitivity by tuning the weighted of each edges of the weighted graph state.
文摘We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.
基金Supported by National Natural Science Foundation of China(91118003,61003071)Special Funds for Shenzhen Strategic New Industry Development(JCYJ20120616135936123)the Fundamental Research Funds for the Central Universities(3101046,201121102020006)
文摘To check whether a program behaves in expectation, program monitoring systems are used for intrusion detection. This article presents a program monitoring system using automaton simulation based on the state graphs extracted from C programs through static analysis. For complete state graph construction, a pointer alias analysis method is proposed to solve the function pointers for obtaining actual control flows. After compiling, pro- grams are instrumented with probes to report the internal states when they are running. A program monitor is built in the kernel of Linux system, which monitors the states of programs from probes and checks the paths of execution. This monitoring system could respond to the abnormal behaviors immediately to protect the sys- tems and programs from further damages.
基金Supported by the National Natural Science Foundation of China under Grant Nos.60972071 and 11375152
文摘Quantum degenerate code may improve the hashing bound of quantum capacity. We propose a family of quantum degenerate codes derived from two-colorable graphs. The coherent information of the codes is analyticaJly obtained as a function of the channd noise for the depolarizing channel. We find a new code which has a higher noise threshold than that of the repetition code.
基金Supported by the National Natural Science Foundation of China (Grant Nos.12001480,11871318)Applied Basic Research Program of Shanxi Province (Grant No.201901D211461)+2 种基金Scientific and Technologial Innovation Programs of Higher Education Institutions in Shanxi (Grant No.2020L0554)Excellent Doctoral Research Pro ject of Shanxi Province (Grant No.QZX-2020001)PhD Start-up Pro ject of Yuncheng University (Grant No.YQ-2019021)。
文摘Quantum many-body problem(QMBP)has become a hot topic in high energy physics and condensed matter physics.With the exponential increasing of the dimension of the Hilbert space,it becomes a big challenge to solve the QMBP even with the most powerful computers.With the rapid development of machine learning,artificial neural networks provide a powerful tool to represent or approximate quantum many-body states.In this paper,we aim to construct explicitly the neural network representations of graph states,without stochastic optimization of the network parameters.Our method shows constructively that all graph states can be represented precisely by proper neural networks originated from[Science,355,602(2017)]and formulated in[Sci.China-Phys.Mech.Astron.,63,210312(2020)].
文摘We exactly evaluate the entanglement of a six vertex and a nine vertex graph states which correspond to non ＂two-colorable＂ graphs. The upper bound of entanglement for five vertex ring graph state is improved to 2.9275, less than the upper bound determined by local operations and classical communication. An upper bound of entanglement is proposed based on the definition of graph state.
基金supported by the National Natural Science Foundation of China(Grant Nos.11871318,11771009,11571213,and 11601300)the Fundamental Research Funds for the Central Universities(Grant Nos.GK201703093,and GK201801011)+2 种基金the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2018JM1020)the Shaanxi Province Innovation Ability Support Program(Grant No.2018KJXX-054)the Subject Research Project of Yuncheng University(Grant No.XK-2018032)
文摘Machine learning is currently the most active interdisciplinary field having numerous applications; additionally, machine-learning techniques are used to research quantum many-body problems. In this study, we first propose neural network quantum states(NNQSs) with general input observables and explore a few related properties, such as the tensor product and local unitary operation. Second, we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS. Finally, to quantify the approximation degree of a given pure state, we define the best approximation degree using normalized NNQSs. Furthermore, we observe that some N-qubit states can be represented by a normalized NNQS, such as separable pure states, Bell states and GHZ states.
基金supported by the National Natural Science Foundation of China under Grant No.60821091 by the Knowledge Innovation Project of Chinese Academy of Sciences under Grant No.KJCX3-SYW-S01
文摘This paper considers optimization problems for a new kind of control systems based on non-equilibrium dynamic games.To be precise,the authors consider the infinitely repeated games between a human and a machine based on the generic 2×2 game with fixed machine strategy of finite k-step memory.By introducing and analyzing the state transfer graphes(STG),it will be shown that the system state will become periodic after finite steps under the optimal strategy that maximizes the human’s averaged payoff,which helps us to ease the task of finding the optimal strategy considerably. Moreover,the question whether the optimizer will win or lose is investigated and some interesting phenomena are found,e.g.,for the standard Prisoner’s Dilemma game,the human will not lose to the machine while optimizing her own averaged payoff when k = 1;however,when k≥2,she may indeed lose if she focuses on optimizing her own payoff only The robustness of the optimal strategy and identification problem are also considered.It appears that both the framework and the results are beyond those in the classical control theory and the traditional game theory.
基金the National Natural Science Foundation of China under grant Nos.69976002and 69733010.
文摘At-speed testing using external tester requires an expensive equipment, thus built-in self-test (BIST) is an alternative technique due to its ability to perform on-chip at-speed self-testing. The main issue in BIST for at-speed testing is to obtain high delay fault coverage with a low hardware overhead. This paper presents an improved loop-based BIST scheme, in which a configurable MISR (multiple-input signature register) is used to generate test-pair sequences. The structure and operation modes of the BIST scheme are described. The topological properties of the state-transit ion- graph of t he proposed B IS T scheme are analyzed. B ased on it, an approach to design and efficiently implement the proposed BIST scheme is developed. Experimental results on academic benchmark circuits are presented to demonstrate the effectiveness of the proposed BIST scheme as well as the design approach.
