Approximate error correction scheme for three-dimensional surface codes based reinforcement learning

Quantum error correction technology is an important method to eliminate errors during the operation of quantum computers.In order to solve the problem of influence of errors on physical qubits,we propose an approximate error correction scheme that performs dimension mapping operations on surface codes.This error correction scheme utilizes the topological properties of error correction codes to map the surface code dimension to three dimensions.Compared to previous error correction schemes,the present three-dimensional surface code exhibits good scalability due to its higher redundancy and more efficient error correction capabilities.By reducing the number of ancilla qubits required for error correction,this approach achieves savings in measurement space and reduces resource consumption costs.In order to improve the decoding efficiency and solve the problem of the correlation between the surface code stabilizer and the 3D space after dimension mapping,we employ a reinforcement learning(RL)decoder based on deep Q-learning,which enables faster identification of the optimal syndrome and achieves better thresholds through conditional optimization.Compared to the minimum weight perfect matching decoding,the threshold of the RL trained model reaches 0.78%,which is 56%higher and enables large-scale fault-tolerant quantum computation.

Gas diffusion in a cylindrical coal sample – A general solution,approximation and error analyses

The analytical mathematical solutions of gas concentration and fractional gas loss for the diffusion of gas in a cylindrical coal sample were given with detailed mathematical derivations by assuming that the diffusion of gas through the coal matrix is concentration gradient-driven and obeys the Fick’s Second Law of Diffusion.The analytical solutions were approximated in case of small values of time and the error analyses associated with the approximation were also undertaken.The results indicate that the square root relationship of gas release in the early stage of desorption,which is widely used to provide a simple and fast estimation of the lost gas,is the first term of the approximation,and care must be taken in using the square root relationship as a significant error might be introduced with increase in the lost time and decrease in effective diameter of a cylindrical coal sample.

Approximation-error-ADP-based optimal tracking control for chaotic systems with convergence proof

In this paper, an optimal tracking control scheme is proposed for a class of discrete-time chaotic systems using the approximation-error-based adaptive dynamic programming （ADP） algorithm. Via the system transformation, the optimal tracking problem is transformed into an optimal regulation problem, and then the novel optimal tracking control method is proposed. It is shown that for the iterative ADP algorithm with finite approximation error, the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some convergence conditions. Two examples are given to demonstrate the validity of the proposed optimal tracking control scheme for chaotic systems.

The Approximation Error of Ordinary Differential Equations Based on the Moved Node Method

One of the central issues in solving differential equations by numerical methods is the issue of approximation. The standard way of approximating differential equations by numerical methods (particularly difference methods) is to question the degree of approximation in the form O(hp). Here h is the grid step. In this case we have an implicit approximation. Based on the difference equation approximating the differential equation, the order of approximation is obtained using the Taylor series. However, it is possible to calculate the approximation error at nodal points based on the method of moving nodes. The method of moving nodes allows obtaining an approximate analytical expression. On the basis of the approximate form, it is possible to calculate the approximation error. The analytical form of the approximation makes it possible to efficiently calculate this error. On the other hand, the property of this error allows the construction of new improved circuits. In addition, based on these types of errors, you can create a differential analog of the difference equation that gives an exact approximation.

Carlson iterating rational approximation and performance analysis of fractional operator with arbitrary order

The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained.K-index,P-index,O-index,and complexity index are introduced to contribute to performance analysis.Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order,these rational approximation impedance functions calculated by the iterating function meet computational rationality,positive reality,and operational validity.Then they are capable of having the operational performance of fractional operators and being physical realization.The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.

Data-Based Optimal Tracking of Autonomous Nonlinear Switching Systems

In this paper,a data-based scheme is proposed to solve the optimal tracking problem of autonomous nonlinear switching systems.The system state is forced to track the reference signal by minimizing the performance function.First,the problem is transformed to solve the corresponding Bellman optimality equation in terms of the Q-function(also named as action value function).Then,an iterative algorithm based on adaptive dynamic programming(ADP)is developed to find the optimal solution which is totally based on sampled data.The linear-in-parameter(LIP)neural network is taken as the value function approximator.Considering the presence of approximation error at each iteration step,the generated approximated value function sequence is proved to be boundedness around the exact optimal solution under some verifiable assumptions.Moreover,the effect that the learning process will be terminated after a finite number of iterations is investigated in this paper.A sufficient condition for asymptotically stability of the tracking error is derived.Finally,the effectiveness of the algorithm is demonstrated with three simulation examples.

ON NEWMAN-TYPE RATIONAL INTERPOLATION TO |x| AT THE CHEBYSHEV NODES OF THE SECOND KIND

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary set of symmetric nodes in [-1,1] and gave the general estimation of the approximation error.By their methods one could establish the exact order of approximation for some special nodes. In the present paper we consider the special case where the interpolation nodes are the zeros of the Chebyshev polynomial of the second kind and prove that in this case the exact order of approximation is O（1/n｜nn）

A search-free near-field source localization method with exact signal model

Most of the near-field source localization methods are developed with the approximated signal model,because the phases of the received near-field signal are highly non-linear.Nevertheless,the approximated signal model based methods suffer from model mismatch and performance degradation while the exact signal model based estimation methods usually involve parameter searching or multiple decomposition procedures.In this paper,a search-free near-field source localization method is proposed with the exact signal model.Firstly,the approximative estimates of the direction of arrival(DOA)and range are obtained by using the approximated signal model based method through parameter separation and polynomial rooting operations.Then,the approximative estimates are corrected with the exact signal model according to the exact expressions of phase difference in near-field observations.The proposed method avoids spectral searching and parameter pairing and has enhanced estimation performance.Numerical simulations are provided to demonstrate the effectiveness of the proposed method.

Investigating the Synthesis of RBF Networks

The approximation capability of RBF networks is investigated using a test function and a fixed finite number of training data. The test function used allows to confirm the recently introducedconcept of second derivative dependent placement of RBF centers. Different Gaussian RBF networksare trained varying the width and the number of centers (number of hidden units). The dependenceof the approximation error on these network parameters is studied experimentally.

WAVELET-BASED FAIRING OF B-SPLINE SURFACES

A method of fairing B spline surfaces by wavelet decomposition is investigated. The wavelet decomposition and reconstruction of quasi uniform bicubic B spline surfaces are described in detail. A method is introduced to approximate a B spline surface by a quasi uniform one. An error control approach for wavelet based fairing is suggested. Samples are given to show the feasibility of the algorithms presented in this paper. The practice showed that the wavelet based fairing is better than energy based one in case where the number of vertices of the B spline surface is greater than 1000. The quantitative variance of the approximation error in accordance with the change of decomposition levels needs to be further explored.

On the Approximation of an Analytic Function Represented by Laplace-Stieltjes Transformation

In the present paper,we have considered the approximation of analytic functions represented by Laplace-Stieltjes transformations using sequence of definite integrals. We have characterized their order and type in terms of the rate of decrease of E;（F,β） where E;（F,β） is the error in approximating of the function F（s） by definite integral polynomials in the half plane Res≤β<α.

AN ITERATIVE ALGORITHM FOR OPTIMAL DESIGN OF NON-FREQUENCY-SELECTIVE FIR DIGITAL FILTERS

This paper proposes a novel iterative algorithm for optimal design of non-frequency-selective Finite Impulse Response(FIR) digital filters based on the windowing method.Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length.In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration.Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain.A design example is employed to illustrate the efficiency of the algorithm.

UNIFORM APPROXIMATION OF ENTIRE FUNCTIONS OF SLOW GROWTH ON COMPACT SETS

In the present paper, we study the polynomial approximation of entire functions of several complex variables. The characterizations of generalized order and generalized type of entire functions of slow growth are obtained in terms of approximation and interpolation errors.

APPROXIMATION PROPERTIES OF LAGRANGE INTERPOLATION POLYNOMIAL BASED ON THE ZEROS OF (1-x^2)cosnarccosx

We study some approximation properties of Lagrange interpolation polynomial based on the zeros of （1-x^2）cosnarccosx. By using a decomposition for f（x） ∈ C^τC^τ＋1 we obtain an estimate of ‖f（x） -Ln＋2（f, x）‖ which reflects the influence of the position of the x＇s and ω（f^（r＋1）,δ）j,j = 0, 1,... , s,on the error of approximation.

COMPUTING AREAS BOUNDED BYRATIONAL BEZIER CURVES

An approach is presented for computing integral values, such as areas and volumes of revo-lution . of regions bounded by rational plane B zier curves. The method approximates rational curveswith polynomial curves, and then computes the integral values on those polynomial curves. Errorbounds are provided. For high precision, this new algorithm performs much more quickly than con-ventional numerical methods.

Estimation of the Misclassification Error for Multicategory Support Vector Machine Classification

The purpose of this paper is to provide an error analysis for the multicategory support vector machine （MSVM） classificaton problems. We establish the uniform convergency approach for MSVMs and estimate the misclassification error. The main difficulty we overcome here is to bound the offset vector. As a result, we confirm that the MSVM classification algorithm with polynomial kernels is always efficient when the degree of the kernel polynomial is large enough. Finally the rate of convergence and examples are given to demonstrate the main results.

Development of stability-preserving time-limited model reduction framework for 2-D and 1-D models with error bound

Due to their complex structure,2-D models are challenging to work with;additionally,simulation,analysis,design,and control get increasingly difficult as the order of the model grows.Moreover,in particular time intervals,Gawronski and Juang’s time-limited model reduction schemes produce an unstable reduced-order model for the 2-D and 1-D models.Researchers revealed some stability preservation solutions to address this key flaw which ensure the stability of 1-D reduced-order systems;nevertheless,these strategies result in large approximation errors.However,to the best of the authors’knowledge,there is no literature available for the stability preserving time-limited-interval Gramian-based model reduction framework for the 2-D discrete-time systems.In this article,2-D models are decomposed into two separate sub-models(i.e.,two cascaded 1-D models)using the condition of minimal rank-decomposition.Model reduction procedures are conducted on these obtained two 1-D sub-models using limited-time Gramian.The suggested methodology works for both 2-D and 1-D models.Moreover,the suggested methodology gives the stability of the reduced model as well as a priori error-bound expressions for the 2-D and 1-D models.Numerical results and comparisons between existing and suggested methodologies are provided to demonstrate the effectiveness of the suggested methodology.

STOCHASTIC APPROXIMATION UNDER CORRELATED MEASUREMENT ERRORS

In this paper the Kiefer-Wolfowitz (KW) procedure for searching the extremum of the regression function as well as the Robbins-Monro (RM) procedure for solving the regression equation are modified in order that they can be applied to the case when the measurement errors form an ARMA process. Simple conditions are given to guarantee their convergence to the extremum and the root of regression function respectively by using a new approach combining both the probabilistic method and the ordinary differential equation (ODE) method. The results given here are better than the well-known ones even if the measurement error is the martingale difference sequence.

Estimating Subdivision Depth of Catmull-Clark Surfaces

In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control polyhedron are derived. The exponential bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Based on the exponential bound, we can predict the depth of subdivision within a user-specified error tolerance. This is quite useful and important for pre-computing the subdivision depth of subdivision surfaces in many engineering applications such as surface/surface intersection, mesh generation, numerical control machining and surface rendering.

A MULTIVARIATE MULTIQUADRIC QUASI-INTERPOLATION WITH QUADRIC REPRODUCTION

In this paper, by using multivariate divided differences to approximate the partial derivative and superposition, we extend the multivariate quasi-interpolation scheme based on dimension-splitting technique which can reproduce linear polynomials to the scheme quadric polynomials. Furthermore, we give the approximation error of the modified scheme. Our multivariate multiquadric quasi-interpolation scheme only requires information of lo- cation points but not that of the derivatives of approximated function. Finally, numerical experiments demonstrate that the approximation rate of our scheme is significantly im- proved which is consistent with the theoretical results.