اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Liege Oscillation Code
41
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Liege Oscillation code can be used as a stand-alone program or as a library of subroutines that the user calls from a Fortran main program of his own to compute radial and non-radial adiabatic oscillations of stellar models. We describe the variables and the equations used by the program and the methods used to solve them. A brief account is given of the use and the output of the program.
قيم البحث
اقرأ أيضاً
The present paper provides a description of the oscillation code FILOU, its main features, type of applications it can be used for, and some representative solutions. The code is actively involved in CoRoT/ESTA exercises (this volume) for the prepara
tion for the proper interpretation of space data from the CoRoT mission. Although CoRoT/ESTA exercises have been limited to the oscillations computations for non-rotating models, the main characteristic of FILOU is, however, the computation of radial and non-radial oscillation frequencies in presence of rotation. In particular, FILOU calculates (in a perturbative approach) adiabatic oscillation frequencies corrected for the effects of rotation (up to the second order in the rotation rate) including near degeneracy effects. Furthermore, FILOU works with either a uniform rotation or a radial differential rotation profile (shellular rotation), feature which makes the code singular in the field.
In neutrino oscillations, a neutrino created with one flavor can be later detected with a different flavor, with some probability. In general, the probability is computed exactly by diagonalizing the Hamiltonian operator that describes the physical s
ystem and that drives the oscillations. Here we use an alternative method developed by Ohlsson & Snellman to compute exact oscillation probabilities, that bypasses diagonalization, and that produces expressions for the probabilities that are straightforward to implement. The method employs expansions of quantum operators in terms of SU(2) and SU(3) matrices. We implement the method in the code NuOscProbExact, which we make publicly available. It can be applied to any closed system of two or three neutrino flavors described by an arbitrary time-independent Hamiltonian. This includes, but is not limited to, oscillations in vacuum, in matter of constant density, with non-standard matter interactions, and in a Lorentz-violating background.
Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes. The challenge is to design practical quantum error-correcting codes that perform well against realistic n
oise using modest resources. Here we show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel; it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favourable sub-threshold resource scaling that can be obtained by specialising a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes on memoryless binary-input/symmetric-output channels. The case of non-symmetric channels is tackled either by the LDPC coset code ensemble (
a channel symmetrizing argument) or by the generalized DE for linear codes on non-symmetric channels. Existing simulations show that the bit error rate performances of these two different approaches are nearly identical. This paper explains this phenomenon by proving that as the minimum check node degree $d_c$ becomes sufficiently large, the performance discrepancy of the linear and the coset LDPC codes is theoretically indistinguishable. This typicality of linear codes among the LDPC coset code ensemble provides insight into the concentration theorem of LDPC coset codes.
The activated torsion oscillation magnetometer exploits the mechanical resonance of a cantilever beam, driven by the torque exerted on the sample by an ac field applied perpendicularly to the film plane. We describe a model for the cantilever dynamic
s which leads to the calculation of the cantilever dynamic profile and allows the mechanical sensitivity of the instrument to be expressed in terms of the minimum electronically detectable displacement. We have developed a capacitance detector of small oscillations which is able to detect displacements of the order of 0.1 nm. We show that sensitivities of the order of 0.5(10-11 Am2 can be in principle achieved. We will subsequently describe the main features of the ATOM prototype which we have built and tested, with particular attention to the design solutions which have been adopted in order to reduce the effects of parasitic vibrations due either to acoustic noise, originating from the ac field coil, or to eddy currents in the capacitor electrodes. The instrument is mounted in a continuous flow cryostat and can work in the 4.2-300 K temperature range. Finally, we will show that our experimental set-up has a second mode of operation, named Torsion Induction Magnetometer (TIM).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
