Quantum computers promise to solve finite-temperature properties of quantum many-body systems,which is generally challenging for classical computers due to high computational complexities.Here,we report experimental p...Quantum computers promise to solve finite-temperature properties of quantum many-body systems,which is generally challenging for classical computers due to high computational complexities.Here,we report experimental preparations of Gibbs states and excited states of Heisenberg X X and X X Z models by using a 5-qubit programmable superconducting processor.In the experiments,we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits.We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits,which enable us to prepare excited states at arbitrary energy density.We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error.Based on numerical results,we further show that the time complexity of our approach scales polynomially in the number of qubits,revealing its potential in solving large-scale problems.展开更多
The stochastic simulation algorithm (SSA) accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often ab...The stochastic simulation algorithm (SSA) accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often abandoned when modeling larger systems because of its computational complexity. In this work, a twin support vector regression based stochastic simulations algorithm (TS^3A) is proposed by combining the twin support vector regression and SSA, the former is a well-known robust regression method in machine learning. Numerical results indicate that this proposed algorithm can be applied to a wide range of chemically reacting systems and obtain significant improvements on efficiency and accuracy with fewer simulating runs over the existing methods.展开更多
The regulation of polyacrylonitrile(PAN)copolymer composition and sequence structure is the precondition for producing high-quality carbon fiber high quality.In this work,the sequential structure control of acrylonitr...The regulation of polyacrylonitrile(PAN)copolymer composition and sequence structure is the precondition for producing high-quality carbon fiber high quality.In this work,the sequential structure control of acrylonitrile(AN),methyl acrylate(MA)and itaconic acid(IA)aqueous copolymerization was investigated by Monte Carlo(MC)simulation.The parameters used in Monte Carlo were optimized via machine learning(ML)and genetic algorithms(GA)using the experimental data from batch copolymerization.The results reveal that it is difficult to control the aqueous copolymerization to obtain PAN copolymer with uniform sequence structure by batch polymerization with one-time feeding.By contrary,it is found that the PAN copolymer with uniform composition and sequence structure can be obtained by adjusting IA feeding quantity in each reactor of a train of five CSTRs.Hopefully,the results obtained in this work can provide valuable information for the understanding and optimization of AN copolymerization process to obtain high-quality PAN copolymer precursor.展开更多
This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consis...This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem;usage of a heuristic is inevitable to obtain the solution in polynomial time. In this paper, simulated annealing algorithm is presented. In the first phase, a seed generation algorithm is given. Then, it is followed by three variations of the simulated annealing algorithms and their comparison using ANOVA in terms of their solutions on makespan.展开更多
This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrel...This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.展开更多
This paper presents a customized simulation system for analyzing welding temperature field, which is based on Finite elementary Analysis software MSC. Marc. The system has the functions of robustly hexahedral meshing,...This paper presents a customized simulation system for analyzing welding temperature field, which is based on Finite elementary Analysis software MSC. Marc. The system has the functions of robustly hexahedral meshing, automated loading of dynamic heat source models for various welding methods and convenient post-processing for welding temperature field. A gene unit algorithm is presented to achieve robust simulation for assembled structure. High order routine method is used to generate various customized routines robustly, which includes Fortran subroutines for welding heat source, Marc command routines for automated modeling, and python subroutines for post-processing etc. With the system, simulation of welding temperature fields can be easily conducted with simple operations.展开更多
In this paper,models to predict hot spot temperature and to estimate cooling air’s working parameters of racks in data centers were established using machine learning algorithms based on simulation data.First,simulat...In this paper,models to predict hot spot temperature and to estimate cooling air’s working parameters of racks in data centers were established using machine learning algorithms based on simulation data.First,simulation models of typical racks were established in computational fluid dynamics(CFD).The model was validated with field test results and results in literature,error of which was less than 3%.Then,the CFD model was used to simulate thermal environments of a typical rack considering different factors,such as servers’power,which is from 3.3 kW to 20.1 kW,cooling air’s inlet velocity,which is from 1.0 m/s to 3.0 m/s,and cooling air’s inlet temperature,which is from 16℃ to 26℃ The highest temperature in the rack,also called hot spot temperature,was selected for each case.Next,a prediction model of hot spot temperature was built using machine learning algorithms,with servers’power,cooling air’s inlet velocity and cooling air’s inlet temperature as inputs,and the hot spot temperatures as outputs.Finally,based on the prediction model,an operating parameters estimation model was established to recommend cooling air’s inlet temperatures and velocities,which can not only keep the hot spot temperature at the safety value,but are also energy saving.展开更多
基金Project supported by the State Key Development Program for Basic Research of China(Grant No.2017YFA0304300)the National Natural Science Foundation of China(Grant Nos.11934018,11747601,and 11975294)+4 种基金Strategic Priority Research Program of Chinese Academy of Sciences(Grant No.XDB28000000)Scientific Instrument Developing Project of Chinese Academy of Sciences(Grant No.YJKYYQ20200041)Beijing Natural Science Foundation(Grant No.Z200009)the Key-Area Research and Development Program of Guangdong Province,China(Grant No.2020B0303030001)Chinese Academy of Sciences(Grant No.QYZDB-SSW-SYS032)。
文摘Quantum computers promise to solve finite-temperature properties of quantum many-body systems,which is generally challenging for classical computers due to high computational complexities.Here,we report experimental preparations of Gibbs states and excited states of Heisenberg X X and X X Z models by using a 5-qubit programmable superconducting processor.In the experiments,we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits.We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits,which enable us to prepare excited states at arbitrary energy density.We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error.Based on numerical results,we further show that the time complexity of our approach scales polynomially in the number of qubits,revealing its potential in solving large-scale problems.
基金This work was supported by the National Natural Science Foundation of China (No.30871341), the National High-Tech Research and Development Program of China (No.2006AA02-Z190), the Shanghai Leading Academic Discipline Project (No.S30405), and the Natural Science Foundation of Shanghai Normal University (No.SK200937).
文摘The stochastic simulation algorithm (SSA) accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often abandoned when modeling larger systems because of its computational complexity. In this work, a twin support vector regression based stochastic simulations algorithm (TS^3A) is proposed by combining the twin support vector regression and SSA, the former is a well-known robust regression method in machine learning. Numerical results indicate that this proposed algorithm can be applied to a wide range of chemically reacting systems and obtain significant improvements on efficiency and accuracy with fewer simulating runs over the existing methods.
基金The authors gratefully acknowledge the supports from the National Natural Science Foundation of China(21878256,21978089)the National Key Research and Development Program of China(2016YFB0302701)+1 种基金the Fundamental Research Funds for the Central Universities(22221818010)Programe of Introducing Talents of Discipline to Universities(B20031).
文摘The regulation of polyacrylonitrile(PAN)copolymer composition and sequence structure is the precondition for producing high-quality carbon fiber high quality.In this work,the sequential structure control of acrylonitrile(AN),methyl acrylate(MA)and itaconic acid(IA)aqueous copolymerization was investigated by Monte Carlo(MC)simulation.The parameters used in Monte Carlo were optimized via machine learning(ML)and genetic algorithms(GA)using the experimental data from batch copolymerization.The results reveal that it is difficult to control the aqueous copolymerization to obtain PAN copolymer with uniform sequence structure by batch polymerization with one-time feeding.By contrary,it is found that the PAN copolymer with uniform composition and sequence structure can be obtained by adjusting IA feeding quantity in each reactor of a train of five CSTRs.Hopefully,the results obtained in this work can provide valuable information for the understanding and optimization of AN copolymerization process to obtain high-quality PAN copolymer precursor.
文摘This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem;usage of a heuristic is inevitable to obtain the solution in polynomial time. In this paper, simulated annealing algorithm is presented. In the first phase, a seed generation algorithm is given. Then, it is followed by three variations of the simulated annealing algorithms and their comparison using ANOVA in terms of their solutions on makespan.
文摘This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.
基金This work is supported by the National Natural Science Foundation of China under contracts 50904038 and 51175253.
文摘This paper presents a customized simulation system for analyzing welding temperature field, which is based on Finite elementary Analysis software MSC. Marc. The system has the functions of robustly hexahedral meshing, automated loading of dynamic heat source models for various welding methods and convenient post-processing for welding temperature field. A gene unit algorithm is presented to achieve robust simulation for assembled structure. High order routine method is used to generate various customized routines robustly, which includes Fortran subroutines for welding heat source, Marc command routines for automated modeling, and python subroutines for post-processing etc. With the system, simulation of welding temperature fields can be easily conducted with simple operations.
基金The authors appreciate support of the project from China Electronics Engineering Design Institute CO.,LTD.(No.SDIC2021-08)from the Beijing Natural Science Foundation(No.4212040).
文摘In this paper,models to predict hot spot temperature and to estimate cooling air’s working parameters of racks in data centers were established using machine learning algorithms based on simulation data.First,simulation models of typical racks were established in computational fluid dynamics(CFD).The model was validated with field test results and results in literature,error of which was less than 3%.Then,the CFD model was used to simulate thermal environments of a typical rack considering different factors,such as servers’power,which is from 3.3 kW to 20.1 kW,cooling air’s inlet velocity,which is from 1.0 m/s to 3.0 m/s,and cooling air’s inlet temperature,which is from 16℃ to 26℃ The highest temperature in the rack,also called hot spot temperature,was selected for each case.Next,a prediction model of hot spot temperature was built using machine learning algorithms,with servers’power,cooling air’s inlet velocity and cooling air’s inlet temperature as inputs,and the hot spot temperatures as outputs.Finally,based on the prediction model,an operating parameters estimation model was established to recommend cooling air’s inlet temperatures and velocities,which can not only keep the hot spot temperature at the safety value,but are also energy saving.