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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
基金the National Natural Science Foundation of China (Grant No. 61702202)China Postdoctoral Science Foundation Funded Project (2017M610477 and 2017T100555).
文摘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.
基金This work is jointly supported by the National Natural Science Foundation of China under grant 61703347the Chongqing Natural Science Foundation grant cstc2016jcyjA0428+2 种基金the Common Key Technology Innovation Special of Key Industries under grant no. cstc2017zdcy-zdyf0252 and cstc2017zdcy-zdyfX0055the Artificial Intelligence Technology Innovation Significant Theme Special Project under grant nos. cstc2017rgzn-zdyf0073 and cstc2017rgznzdyf0033the China University of Mining and Technology Teaching and Research Project (2018ZD03, 2018YB10).
文摘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.
基金by National Natural Science Foundation of China(No.61505168,No.61802319)the Fundamental Research Funds for the Central Universities,P.R.China.
文摘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.
基金the Fundamental Research Funds for the Central Universities(No.2018YJS008)the National Natural Science Foundation of China(61471031,61661021,61531009)+4 种基金Beijing Natural Science Foundation(L182018)the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University(No.2017D14)the State Key Laboratory of Rail Traffic Control and Safety(Contract No.RCS2017K009)Science and Technology Program of Jiangxi Province(20172BCB22016,20171BBE50057)Shenzhen Science and Technology Program under Grant(No.JCYJ20170817110410346).
文摘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.
基金the Scientific Research Foundation of Shanxi Institute of Technology(Grant No.201706001)the Fund for Shanxi“1331 Project”Key Subjects Construction+2 种基金the China Postdoctoral Science Foundation(Grant No.2017M612411)the Education Department Foundation of Henan Province,China(Grant No.18A140009)the National Natural Science Foundation of China(Grant Nos.61821280,11604190,and 61465013).
文摘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.
基金NSFC (11301331, 11371086, 11571079 and 51771083)NSF under the grant DMS-1664561, Shanghai Pujiang Program (14PJD007)+2 种基金the Natural Science Foundation of Shanghai (14ZR1403500)Natural Science Fund for Colleges and Universities of Jiangsu Province under the grant 17KJB110020Emphasis Foundation of Special Science Research on Subject Frontiers of CUMT under Grant No. 2017XKZD11.
文摘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.
基金sponsored by the National Natural Science Foundation of China(No.41504012).
文摘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.
基金Supported by Key Laboratory of Management, Decision and Information Systems, Chinese Academy of Science.
文摘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.
基金the National Basic Research Program of China(Grant No.2013CB338002)the National Natural Science Foundation of China(Grant No.61502526).
文摘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.
基金the National Key Research and Development Program of China(2018YFA0305604 and 2017YFA0303302)the National Natural Science Foundation of China(11774008)the Strategic Priority Research Program of Chinese Academy of Sciences(XDB28000000)
文摘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.
基金the Scientific Research Foundation of Hebei Educational Committee,China(No.ZD2017004)the Talent Program of Hebei University,China.
文摘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.
基金National Natural Science Foundation of Jiangxi Province, China (No. 20132BAB201044)Jiangxi Higher Technology Landing Project, China (No. KJLD12071)
文摘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.
基金National Natural Science Foundation of China (91112003).
文摘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.
基金the National Key Research and Development Plan (Grant Nos. 2018 YFC 1200200 and 2018 YFC1200205)the National Natural Science Foundation of China (Grant No. 61463016)the "Science and Technology Innovation Action Plan"' of Shanghai in 2017 (Grant No. 17510740300).
文摘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.
基金Supported in part by the Ministry of Science and Technology of China (MSTC) under 973 project "Systematic studies on light hadron spectroscopy"(2015CB856702)It is also supported in part by the DFG and the NSFC through funds provided to the Sino-Germen CRC 110 "Symmetries and the Emergence of Structure in QCD",DFG grant no.TRR 110 and NSFC (11621131001)+2 种基金This work is supported in part by the National Science Foundation of China (NSFC)(11775229,11875169)by the Youth Innovation Promotion Association of CAS (2015013)LL acknowledges the support from the Key Research Program of the Chinese Academy of Sciences (XDPB09).
文摘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.
基金National Natural Science Foundation of China(Grant Nos.61751208,61502510,61773390)Outstanding Natural Science Foundation of Hunan Province(Grant No.2017JJ1001)Special Program for the Applied Basic Research of National University of Defense Technology(Grant No.ZDYYJCYJ20140601).
文摘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.
基金supported by the National Natural Science Foundation of China(61622401,61851402 and 61734003)the National Key Research and Development Program of China(2017YFB0405600)+2 种基金Shanghai Education Development FoundationShanghai Municipal Education Commission Shuguang Program(18SG01)support from Shanghai Municipal Science and Technology Commission(18JC1410300).
文摘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.
基金This work was supported by the National Basic Research Program of China(Grant Nos.2017YFA0303700,and 2015CB921001)the National Natural Science Foundation of China(Grant Nos.61726801,1147416&and 11474181)in part by the Beijing Advanced Innovative Center for Future Chip(ICFC).Jiang Zhang acknowledges support by the China Postdoctoral Science Foundation(Grant No.2018M631437).Xiao-Dong Yu acknowledges support by the Deutsche Forschungs Gemeinschaft(DFG)and the European Research Council(ERC)(Consolidator Grant 683107/TempoQ).
文摘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.