The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The number of inequivalent classes of 10-qubit graph states is 3132. All 3132 local inequivalent graphs are classified as two categories: graphs with equal bound, graphs with unequal bounds. We will use different methods to calculate the entanglement of graph states of ten qubits for the different categories. For graph states with different entanglement bounds, the closest product states are given,...
Given an LB-compact floorplan, a 3D block-level thermal model is firstly proposed to calculate the temperature of each circuit block in reasonable time. Furthermore, based on the temperature calculation in the proposed 3D block-level thermal model and the final floorplan region, an iterative approach is proposed to reduce the final floorplan temperature by inserting or redistribution the feasible...
In terms of Gauss-Newton (G-N) nonlinear least-squares algorithm, if J(x) is rank-deficient, then either the Gauss-Newton method cannot work well, or the algorithm converges to a non-stationary point. To overcome the difficulty, in this paper we consider employing trust-region technique, and propose Levenberg-Marquardt (L-M) algorithm. In L-M algorithm, damping term mukI is added to G-N algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.