The Single Histogram Method and the Quantum Harmonic Oscillator Accuracy Limits

合集下载

高三英语学术研究方法创新不断探索单选题30题

高三英语学术研究方法创新不断探索单选题30题

高三英语学术研究方法创新不断探索单选题30题1. In academic research, a hypothesis is a ______ that is tested through experiments and observations.A. predictionB. conclusionC. theoryD. assumption答案:D。

本题考查学术研究中“假说”相关的基本概念。

选项A“prediction”意为“预测”,通常是基于现有信息对未来的估计;选项B“conclusion”指“结论”,是在研究后得出的最终判断;选项C“theory”是“理论”,是经过大量研究和验证形成的体系;选项D“assumption”表示“假定、设想”,更符合“假说”的含义,即在研究初期未经充分验证的设想。

2. The main purpose of conducting academic research is to ______ new knowledge and understanding.A. discoverB. createC. inventD. produce答案:A。

此题考查学术研究目的相关的词汇。

选项A“discover”意思是“发现”,强调找到原本存在但未被知晓的事物;选项B“create”意为“创造”,侧重于从无到有地造出新的东西;选项C“invent”指“发明”,通常指创造出新的工具、设备等;选项D“produce”有“生产、产生”的意思,比较宽泛。

在学术研究中,主要是“发现”新知识和理解,所以选A。

3. A reliable academic research should be based on ______ data and methods.A. accurateB. preciseC. correctD. valid答案:D。

本题关于可靠学术研究的基础。

选项A“accurate”侧重于“准确无误”,强调与事实完全相符;选项B“precise”意为“精确的、明确的”,更强调细节的清晰和明确;选项C“correct”指“正确的”;选项D“valid”表示“有效的、有根据的”,强调数据和方法具有合理性和可靠性。

Exact Solution of the Statistical Multifragmentation Model and Liquid-Gas Phase Transition

Exact Solution of the Statistical Multifragmentation Model and Liquid-Gas Phase Transition

a r X i v :nu cl-t h /0007062v 1 27 J u l 2000Exact Solution of the Statistical Multifragmentation Modeland Liquid-Gas Phase Transition in Nuclear MatterK.A.Bugaev 1,2,M.I.Gorenstein 1,2,I.N.Mishustin 1,3,4and W.Greiner 11Institut f¨u r Theoretische Physik,Universit¨a t Frankfurt,Germany 2Bogolyubov Institute for Theoretical Physics,Kyiv,Ukraine 3The Kurchatov Institute,Russian Research Center,Moscow,Russia 4The Niels Bohr Institute,University of Copenhagen,Denmark(February 8,2008)An exact analytical solution of the statistical multifragmentation model is found in thermody-namic limit.The system of nuclear fragments exhibits a 1-st order liquid-gas phase transition.The peculiar thermodynamic properties of the model near the boundary between the mixed phase and the pure gaseous phase are studied.Key words:Nuclear matter,1-st order liquid-gas phase transition,mixed phase thermo-dynamics21.65.+f,24.10.Pa,25.70.PqNuclear multifragmentation is one of the most inter-esting and widely discussed phenomena in intermediate energy nuclear reactions.The statistical multifragmenta-tion model (SMM)(see [1,2]and references therein)was recently applied to study the relationship of this phe-nomenon to the liquid-gas phase transition in nuclear matter [3–5].Numerical calculations within the canon-ical ensemble exhibited many intriguing peculiarities of the finite multifragment systems.However,the inves-tigation of the system’s behavior in the thermodynamic limit is still missing.Therefore,there is no rigorous proof of the phase transition existence,and the phase diagram structure of the SMM is unknown yet.In the present paper an exact analytical solution of the SMM is found within the grand canonical ensemble.The self-consistent treatment of the excluded volume effects is an important part of our study.The system states in the SMM are specified by the multiplicity sets {n k }(n k =0,1,2,...)of k -nucleon frag-ments.The partition function of a single fragment withk nucleons is [1]:ωk =V (mT k/2π)3/2z k ,where k =1,2,...,A (A is the total number of nucleons in the system),V and T are,respectively,the volume and the temperature of the system,m is the nucleon mass.The first two factors in ωk originate from the non-relativistic thermal motion and the last factor,z k ,represents the intrinsic partition function of the k -fragment.For k =1(nucleon)we take z 1=4(4internal spin-isospin states)and for fragments with k >1we use the expres-sion motivated by the liquid drop model (see details in Ref.[1]):z k =exp(−f k /T ),with fragment free energy f k ≡−[W o +T 2/ǫo ]k +σ(T )k 2/3.Here W o =16MeV is the bulk binding energy per nucleon,T 2/ǫo is the con-tribution of the excited states taken in the Fermi-gas approximation (ǫo =16MeV)and σ(T )is the surfacetension which is parameterized in the following form:σ(T )=σo [(T 2c −T 2)/(T 2c +T 2)]5/4,with σo =18MeV and T c =18MeV (σ=0at T ≥T c ).The canonical par-tition function (CPF)of nuclear fragments in the SMM has the following form:Z id A (V,T )={n k }A k =1ωn k kTZ A (V,T )Θ(V −bA ),(2)where chemical potential µis introduced.The calcu-lation of Z is still rather difficult.The summation over {n k }sets in Z A cannot be performed analytically because of additional A -dependence in the free volume V f and the restriction V f >0.The problem can be solved [6]by in-1troducing the so-called isobaric partition function (IPF)which is calculated in a straightforward way:ˆZ (s,T,µ)≡ ∞dV exp(−sV )Z (V,T,µ)=12π3/2z 1expµ−sbTT,(4)with ν≡µ+W o +T 2/ǫo .In the thermodynamic limitV →∞the pressure of the system is defined by thefarthest-rightsingularity,s ∗(T,µ),of the IPF ˆZ(s,T,µ)(see Ref.[7]for details):p (T,µ)≡TlimV →∞ln Z (V,T,µ)2π3/2 z 1expµ−bp gT.(6)A similar expression for ρg within the excluded volume model for the pure nucleon gas was obtained in Ref.[8].The phase transition line µ∗(T )in the (T,µ)-plane cor-responds to the mixed liquid and gas states.This line is transformed into the finite mixed-phase region in the (T,ρ)-plane shown in Fig. 1.The baryonic density in the mixed phase is a superposition of the liquid and gas baryonic densities:ρ=λρl +(1−λ)ρg ,where λ(0<λ<1)is a fraction of the system’s volume occu-pied by the liquid inside the mixed phase.Similar lin-ear combinations are also valid for the entropy density s and the energy density εwith (i =l,g )s i =(∂p i /∂T )µ,εi =T (∂p i /∂T )µ+µ(∂p i /∂µ)T −p i .Inside the mixed phase at constant density ρthe pa-rameter λhas a specific temperature dependence shown in Fig.2:from an approximately constant value ρ/ρo at small T the function λ(T )drops to zero in a nar-row vicinity of the boundary separating the mixed phase and the pure gaseous phase.Such an abrupt decrease of λ(T )near this boundary causes a strong increase of the energy density as a function of temperature.This is evident from Fig.3which shows the caloric curves at dif-ferent baryonic densities.One can clearly see a plateau-like behavior.As a consequence this leads to a sharp peak in the specific heat per nucleon at constant density,2c ρ(T )≡(∂ε/∂T )ρ/ρ,shown in Fig.4.246810T (MeV)0.20.40.60.81λFIG.2.Volume fraction λ(T )of the liquid inside the mixed phase is shown as a function of temperature for fixed nucleon densities ρ/ρo =1/6,1/3,1/2,2/3,5/6(from bottom to top).The peculiar thermodynamic property of the consid-ered model is a finite discontinuity of c ρ(T )at the bound-ary of the mixed and gaseous phases seen in Fig.4.This finite discontinuity is due to the fact that λ(T )=0,but (∂λ/∂T )ρ=0at this boundary inside the mixed phase (see Fig.2).It should be emphasized that the energy density is continuous at the boundary of the mixed phase and the gaseous phase,hence the sharpness of the peak in c ρis entirely due to the strong temperature depen-dence of λ(T )near this boundary.Therefore,in contrast to the expectation in Refs.[4,5],the maximum value of c ρremains finite and the peak width in c ρ(T )is not zero in the thermodynamic limit considered in our study.51015202530ε/ρ + W 0 (MeV)051015T (M e V )MIXED PHASEGAS2/31/21/31/6FIG.3.Temperature as a function of energy density per nucleon (caloric curve)is shown for fixed nucleon densities ρ/ρo =1/6,1/3,1/2,2/3.51015T (MeV)510152025c ρMIXED PHASE GASρ/ρ = 1/30FIG.4.Specific heat per nucleon as a function of temper-ature at fixed nucleon density ρ/ρo =1/3.The dashed line shows the finite discontinuity of c ρ(T )at the boundary of the mixed and gaseous phases.In conclusion,the simplified version of the SMM is solved analytically in the grand canonical ensemble.The progress is achieved by reducing the description of phase transitions to the investigation of the isobaric parti-tion function singularities.The model clearly demon-strates a 1-st order phase transition of the liquid-gas type.The considered system has peculiar properties near the boundary of the mixed and gaseous phases seen in the behavior of the specific heat.Acknowledgments.The authors are thankful to A.S.Botvina,Ph.Chomaz,D.H.E.Gross,A.D.Jackson and J.Randrup for useful discussions.We are thankful to the Alexander von Humboldt Foundation and DFG,Ger-many for the financial support.The research described in this publication was made possible in part by Award No.UP1-2119of the U.S.Civilian Research &Development Foundation for the Independent States of the Former So-viet Union (CRDF).。

Methods Dissociation and isolation of antigen and antibody from immune complexes

Methods Dissociation and isolation of antigen and antibody from immune complexes

52 overcome by specifically measuring the antigen moiety involved in the formation of ICs, but most methods currently in use are antigen-non-specific quantifying either the antibody or the complement components attached to the ICs. In order to develop antigen-specific IC assays, several attempts have been made to isolate and characterize ICs (reviewed by Jones and Orlans, 1981) including: (a) the dissociation of antigen and antibody by acid, alkaline or high-molar salt solutions followed by filtration methods (Kabat and Mayer, 1961: Givol et al., 1962: Slobin and Sela, 1965); (b) the generation in immunoglobulin-tolerant rabbits of antibodies against the antigen moiety of ICs bound to Raji cells (Theofilopoulos et al., 1978; Koestler et al., 1981); and (c) the separation of antigens from antibodies by isoelectric focusing (Maidment et al., 1980, 1981). The experiments described here were undertaken to evaluate the applicability of ion-exchange chromatography or isoelectric focusing to the isolation of antigens involved in IC formation. It was found that ICs were dissociated readily by high-molar solutions of urea at neutral pH or by acid citrate buffer as well as by electrofocusing. In addition, the antigen component could be recovered by preparative isoelectric focusing or ion-exchange chromatography and the antibody moiety isolated by ion-exchange chromatography.

Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the P

Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the P

ASYMPTOTIC QUANTUM SEARCH AND A QUANTUM ALGORITHM FOR CALCULATION OF A LOWER BOUND OF THE PROBABILITY OF FINDING A DIOPHANTINE EQUATIONTHAT ACCEPTS INTEGER SOLUTIONSR. V. Ramos and J. L. de Oliveirarubens@deti.ufc.br jluzeilton@deti.ufc.brDepartment of Teleinformatic Engineering, Federal University of CearaCampus do Pici, C. P. 6007, 60455-740, Fortaleza, Brazil.Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposed and all of them use the quantum search algorithm as a subroutine and several intermediate measurements are realized. In this work, it is proposed a new quantum algorithm for finding the minimum of a function in which quantum search is not used as a subroutine and only one measurement is needed. This is also named asymptotic quantum search. As an example, we propose a quantum algorithm based on asymptotic quantum search and quantum counting able to calculate a lower bound of the probability of finding a Diophantine equation with integer solution.Keywords:Quantum algorithms, quantum search, optimization, Diophantine equations.1. IntroductionThe Grover’s quantum search algorithm is an important result in quantum computation that proves that quantum superposition can speed-up the task of finding a specific value within an unordered database. The quantum search is proved to use O(N1/2) operations of the oracle (in comparison with the O(N) operations of the best classical algorithm), indicating a quadratic speed-up [1-3]. Several mathematical problems can be modeled as a search, like the problem of finding the minimum (or the maximum) of a function. Thus, some algorithms for finding the minimum or maximum using quantum search have been proposed [4,5], using the generalization of the quantum search proposed in [6] as a subroutine that is called several times. Every time the quantum search is called, at the end a measurement is realized. The number of measurements in the algorithm proposed in [4] is (log2N), where N is the number of elements in the database [7]. Aiming to reduce the number of measurements, Kowada at al [7] proposed a new quantum algorithm for finding the minimum of a function that realizes O(log N) measurements. Here, we go beyond, proposing a quantum algorithm for finding the minimum that realizes only one measurement, at the final of the algorithm. Furthermore, conversely the already proposed quantum algorithms for finding the minimum, the quantum search in the proposed algorithm is not used as a subroutine, indeed it is a part of the algorithm as any other quantum gate. In this work, as an example, we apply asymptotic quantum search together with quantum counting algorithm [3,8] in order to create a quantum algorithm able to calculate a lower bound of the probability of finding a Diophantine equation that accepts integer solutions. We are going to call this number by D.(1)(2) (3)2. Quantum algorithm for finding the minimum of a functionThe circuit for the proposed quantum algorithm is shown in Fig. 1.Fig. 1- Circuit for asymptotic quantum search.In Fig. 1, U f is the quantum gate that implements the function f , U f x 0 = x f (x ) , the gate QBSC is a quantum bit string comparator [9], QBSC x y 0 = x y b , where b =0 if x >y and b =1 if x y . At last, the oracle in the amplitude amplification recognizes if the quantum registers 4 and 5 are in the total state 0 N 0 . In order to understand the quantum circuit in Fig. 1, we firstly show the operation of the quantum circuit U , following the states in the marked positions, as shown below:1152432151452243331451452233000000000000NNNx xNN NNNx f x x xy Nx f x xy x y c xc U x Hc xf x c xf x yc x f x f y(4.a)(4.b)(5)(6.a)41451452323, ,415243 212431101 N x y x yf x f y f x f y n x x jj xj f x f y n x x jj j xf x yf y f x yf y c x f x f y c x f x f y50xf x f y.In (1)-(4.b), N is the number of qubits, hence, there are 2N elements in the database. In (4.b), 1 n (x ) 2N is the number of elements that obey f (x ) f (y ) for a given x and all y ’s. Thus, the better the solution the larger is the value of n (x ). At last, y i can assume any y value.min 515243 215243 16min min 101 00Nn x N x j x j f x f y n x N x j xj f x f y x c x f x c x f x c x f xminmin 1522443321423 10001 0Nn x N N N N x j xj x x f x f y n x N Nx kxk x x f x f y c x fx y c xf x H y5(6.b)(7)(8)min minmin 6min min 115224343 154231 021421002001001N j NNNN NNx x xx x n x NN Nx j x j x x H y f x f y n x N x kk c x f x c n x xf x c x y c x f x H ymin53 00N x x x f x f y.Finallymin 71515243243 15423 1 0214210000200000000N N j NN NN NNNx x xxf x f y n xNNNx j xj x x H y f x f y NN x k k U c xc n x x c x y c x y53 01Nn x N xf x f yThe worse the solution the lower is the value of n (x ) and the faster is the decay. Now, using k -times the gate U together with the multi-controlled CNOTs, the quantum state just before the quantum amplification is:min 15243 1154231 1 021142120000200020N j N k N N N Nx x f x f y n x k r N N NN x j r x j x x H y f x f y n r N N Nx k k c n x x c n x x H y c n x x H y31 501x k N r x f x f y(9)At the amplitude amplification, the oracle recognizes the state 0 N 0 in the fourth and fifth quantum registers. Therefore, only the first term in (8) will have their amplitudes amplified. Looking closer the first term in (8), one sees that the amplitude of the searched answer is min x c , since n (x )=2N for x =x min . The second term with largest amplitude has n (x )=2N -1, hence, after the k -th application of U its amplitude will be c x /2k . Thus, if k is large enough only the term corresponding to the searched answer will have considerable amplitude and, after amplitude amplification, the searched answer will be obtained with high probability ina single set of measurements. For example, choosing x c for all x , the largest amplitude after kusage of U(before amplitude amplification) is min x c while the second largest amplitude will bemin 2k x x c c . The oracle in the amplitude amplification is applied /(4 ) times, where [9]sin k.If k is large enough, then 2Ngood p . Obviously, the efficiency of the proposed algorithm is equal to theefficiency of the amplitude amplification.3. Quantum algorithm for finding a lower bound of DA Diophantine equation is a polynomial equation with any number of unknowns and with integercoefficients. For example, (x +1)n +(y +2)n +(z +3)n -Cxyz =0, where C and n . Since there is not a universal process to determine whether any Diophantine equation accepts or not integer solutions, the best that one can do is to use a brute-force method. In this case, one can not determine the probability of finding a Diophantine equation that accepts integer solutions, D , exactly, but it is possible to determine a lower bound for it. In this direction, the quantum algorithm proposed can be used to implement a brute-force attack (using the intrinsic quantum parallelism) and the accuracy of the answer obtained is limited by the amount of qubits used, the larger the amount of qubits used the closer to D is the obtained answer. Since only a finite amount of qubits can be used, the answer obtained is simply a lower bound of D . Since the (infinite) set of Diophantine equations considered is enumerable, we will use integer numbers to enumerate the Diophantine equations. The quantum circuit for the proposed quantum algorithm is shown in Fig. 2. In this quantum circuit, we assume that the set of Diophantine equations considered has only three unknowns (x ,y ,z ), however, the extension to a larger number of unknowns is straightforward.(10)(11)(12)(13)(15)(16)(14)(17)31126354,,32126543,,3125643,,,,,,0000,,,,000,,,,,,00lM lxyz px y z Ml xyz p px y z lxyz p px y zx y z p c x y z c x y z D x y z p c x y z D x y z y z4125634,,,,51126534,, ,,,,,,,,,,,,,,0,,,,,,,,1p p i j mxyz p p px y z x y z xyzp i j mp i j mpx y zi j mD x y z D x y z c x y z D x y z y z D x y z cx y zD x y z y z D x y z !62126543,, ,,,,,,352317132,,,,,,01,,,,0,,2,,,,p p i j mpp s s s s s s opts lxyzp i j mpx y zi j mD x y z D x y z t p p p p p pM opt opt opt p opt opt opt xyz s M xyz p pcx y zD x y z y z c x y z D x y z c n x y z x y z D x y !4634353,,,,,,010p p popt opt opt l Mpx y z x y z x y z z !!Finally38126354,,2133163542 ,,,,,,,,0000,,0000,,2,,pps s s opt sp p popt opt opt lM lxyz px y zt p p popt opt opt xyz s l MlM pxyz x y zx y z x y z U c x y z c x y z p c n x y z x y z !In (17), 1 n (x ,y ,z ) 23M is the number of elements that obey |D p (x,y,z )| |D p (x’,y’,z’)| for a given x ,y ,z and all x’,y’,z’. Thus, the better the solution the larger is the value of n (x ,y ,z ). We assume that, for the Diophantine equation number p there are t p minimums. Moreover3,,2s s sp p pMopt opt opt n x y z for s =1,2,…,t p . Thestates !i i =1,2,3,4 and ! are states with undesired terms. Now, using k -times the gate U together with the multi-controlled CNOT gates, the quantum state just before the quantum amplification is:(20)(19)(18)3312635421 ,,,,,,,,,,2,,0000p p s s s opt sp p popt opt optt kp p p M l Mlopt opt optxyz xyz ps x y zx y z x y z p c x y z c n x y z x y z"The state " represents the uninteresting terms. At the amplitude amplification, the oracle recognizes the state 0 3M 0 in the fifth and sixth quantum registers. Therefore, only the first term in (18) will have their amplitudes amplified. Looking closer the first term in (18), one sees that the amplitude of one of the searched answers is p opt sxyz c (comparing to the single variable case in Section 2, we have n (x,y,z )=23M for,,,,p p popt opt opt x y z x y z ). The second term with largest amplitude has n (x ,y ,z )=23M -1, hence, after the k -thapplication of U its amplitude will be c xyz /2k . Thus, if k is large enough only the term corresponding to the searched answer will have considerable amplitude and, after amplitude amplification, it will be obtained with high probability in a single measurement. For example,choosing xyz c for all xyz , thelargest amplitude after k usage of U (before amplitude amplification)is p opt sxyz c thesecond largest amplitude will be 2popt sk xyz xyz c c . The oracle in the amplitude amplification is applied/(4 ) times, wheresin k.If k is large enough, then 32Mgood p p t . The efficiency of the proposed algorithm is equal to theefficiency of the amplitude amplification. Thus, the final state after the amplitude amplification is1,,,,ps s ss s st p p pp p pend opt opt opt p opt opt opt ps y z D x y z errIn (20) one can see that, for each one of the 2N Diophantine equations, the algorithm calculate the minimums values testing 2M different values for each unknown. Moreover, the term err represents the remained unwanted states due to the non ideal amplitude amplification.In order to calculate the lower bound of D , we use the state (20) as input of a quantum countingalgorithm whose oracle recognizes a zero in the last register of (20), that is,,,0p p pp opt opt optD x y z .The quantum counting algorithm returns the number of elements in the database that pass in the oracle test. Let us name this value by r (N ,M ). Hence,(21),lim ,2N D N M r N M #$and a lower bound for D is simply ,2estND r N M .4. DiscussionsThe problem to decide if a given Diophantine equation has or not integer solutions is, according toChurch-Turing computability thesis, an undecidable problem. In fact, this problem is related to the halting problem for Turing machine: The Diophantine equation problem could be solved if and only if the Turing halting problem could be [10]. Since there is not a universal process to decide if a given program will halt or not a Turing machine, the best that one can do is to run the program and wait for a halt. The point is: one can never know if he/she waited enough time in order to observe the halt. The Diophantine equation problem has a similar statement. Since there is not a universal procedure to decide if a given Diophantine equation accepts an integer solution, the best that one can do in order to check if it accepts or not an integer solution, is to test the integer numbers. The point here is: one can never know the answer because there are infinite integers to be tested. Associated to the halting problem is the Chaitin number , the probability of a given program to halt the Turing machine [11-17]. The number is an incompressible number and it can not be calculated. Similarly, one can define the probability of finding a Diophantine equation with integer solutions, D . Obviously, D is also a number that can not be calculated, because the knowledge of D implies in the knowledge of a way to decide if any given Diophantine equation accepts or not any integer solution that, by its turn, implies in the knowledge of and in the solution of the halting problem. As happens with , it is possible to calculate classically a lower bound for D , however, it must be a brute-force algorithm. Classical algorithms for calculation of D will differ basically in the method that the zeros of the Diophantine equation are obtained. The quantum algorithm here proposed is also a brute-force algorithm but its advantage is the quantum parallelism, since several Diophantine equations are tested simultaneously.4. ConclusionsIt was proposed a new quantum algorithm for finding the minimum of a function that requires only one measurement. This is important since the complete circuit is simplified and measurements of qubits are not noise free. This algorithm is an asymptotic quantum search. As an example of its application, we constructed a quantum algorithm for finding a lower bound for the probability of finding a Diophantine equation that accepts integer solutions. A lower bound can also be calculated using a classical computer,however, our algorithm is more efficient since it can test 2N(for N qubits) Diophantine equations simultaneously. At last, the algorithm proposed requires only one measurement, after the quantum counting stage.AcknowledgeThe authors thank the anonymous reviewer for useful comments.References1.Grover, L. V.: A fast quantum mechanical algorithm for database search, in Proc., 28th Annual ACM Symposium on the Theory of Computing, New York, pp. 212 (1996).2. Grover, L. V.: Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett., 79, pp. 325 (1997).3. M. A. Nielsen, and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge Univ. Press, Cambridge, ch. 4 and 6 (2000).4. Dürr C., and Høyer, P.: A quantum algorithm for finding the minimum, arXive:quant-ph/9607014 (1999).5. Ahuja, A., and Kapoor, S.: A quantum algorithm for finding the maximum, arXive:quant-ph/9911082 (1999).6. Boyer, M., Brassard, G., Høyer, P., and Tapp, A.: Tight bounds on quantum searching, arXive:quant-ph/9605034 (1996).7. Kowada, L. A. B., Lavor, C., Portugal, R., and de Figueiredo, C. M. H.: A new quantum algorithm to solve the minimum searching problem, International Journal of Quantum Information, Vol. 6, no. 3, 427 - 436, 2008.8. Kaye, P., Laflamme, R., and Mosca, M.: An introduction to Quantum Computing, 1st Ed., Oxford University Press, 2007.9. Oliveira, D. S., and Ramos, R. V.: Quantum Bit String Comparator: Circuits and Applications, Quantum Computers and Computing, vol. 7, no. 1, 17-26, 2008.10. T. D. Kieu, Quantum algorithms for Hilbert’s tenth problem, – quant-ph/0110136, 2003.11. C. Calude, Theories of Computational Complexity, North-Holland, Amsterdam, 1998.12. G. Chaitin, Meta Math!: the quest for omega, Pantheon Books, 2005.13. G. Chaitin, Irreducible Complexity in Pure Mathematics, Preprint at (/math.HO/0411091), 2004.14. G. Chaitin, Information-theoretic computational complexity, IEEE Trans. on Inf. Theory, IT-20, 10, 1974.15. C. Calude, Information and Randomness, Spring-Verlag, Berlin, 1994.16. G. Chaitin, Algorithmic Information Theory,1a Ed. Cambridge University Press, 1987.17. G. Markowsky, Introduction to algorithmic information theory, J. of Universal Comp. Science, 2, no. 5, 245, 1996.。

面向数据发布和分析的差分隐私保护

面向数据发布和分析的差分隐私保护

3 主要研究方向
差分隐私作为新兴的隐私保护技术,在理论研 究和实际应用方面具有非常重要的价值。该技术首 先出现在统计数据库领域,然后,又扩展到其它领 域,例如机器学习、安全通信等。数据库领域中差 分隐私保护技术的主要研究方向如表 1 所示。
和强健的保护模型。该保护模型的基本思想是对原 始数据、对原始数据的转换、或者是对统计结果添 加噪音来达到隐私保护效果。该保护方法可以确保 在某一数据集中插入或者删除一条记录的操作不 会影响任何计算的输出结果。另外,该保护模型不 关心攻击者所具有的背景知识,即使攻击者已经掌 握除某一条记录之外的所有记的信息,该记录的隐 私也无法被披露。差分隐私的形式化定义如下: 定义 1[7]. 给定数据集 D 和 D ,二者互之间至 多相差一条记录, 即 | DD | 1 。 给定一个隐私算法 A, Range(A)为 A 的取值范围, 若算法 A 在数据集 D 和 D 上任意输出结果 O (O Range(A))满足下列不 等式,则 A 满足 -差分隐私。
1 引 言
信息技术的飞速发展使得各类数据的发布、采 集、存储和分析变得方便快捷。例如,医院电子病 例记录病人基本信息、疾病信息及药品购买记录; 人口普查记录市民的家庭住址以及收入情况;金融
———————————————
本文得到国家自然科学基金项目(61379050, 91024032, 91224008,91124001, 91324015), 中国人民大学科学研究基金(课题号: 11XNL010)支持, 国家 863计划项目(2012AA011001, 2013AA013204), 高等学校博士学科点专项科研基金资助课题(20130004130001)资助.张啸剑,男,1982年生,博士研 究生,主要研究方向为差分隐私、数据挖掘、图数据管理.孟小峰,男,1964年生,教授,博士生导师,主要研究领域为Web数据管理、移动数据 管理、XML数据管理、云数据管理等.

Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics

Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics
Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics
Nitin Saxena Centrum voor Wiskunde en Informatica P.O. Box 94079, 1090 GB Amsterdam, The Netherlands ns@cwi.nl Simone Severini Institute for Quantum Computing University of Waterloo, N2L 3G1 Waterloo, Canada simoseve@ Igor E. Shparlinski Department of Computing, Macquarie University Sydney, NSW 2109, Australia igor@.au February 1, 2008
1
Introduction
Circulant graphs have a vast number of uses and applications to telecommunication network, VLSI design, parallel and distributed computing (see [6] and the references therein). A graph is integral if all the eigenvalues of its adjacency matrix are integers (see [2] for a survey on integral graphs). Here, we first show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a circulant graph, is periodic if and only if the graph is integral. Then, motivated by this observation, we focus on relevant properties of integral circulant graphs. The intention of the paper is to move a step towards a classification of network topologies which exhibit periodic quantum dynamics. For certain quantum spin systems with fixed nearestneighbour couplings, periodicity is a necessary condition for perfect state transfer, that is, for 1

Exact solution to the Schr{o}dinger equation for the quantum rigid body

Exact solution to the Schr{o}dinger equation for the quantum rigid body
K,ℓx ℓy ℓm ψK,ℓx ℓy (ρ)YK,ℓ (Ω). x ℓy
There is huge degeneracy of the hyperspherical basis, and the matrix elements of the potential have to be calculated between different hyperspherical harmonic states [10], because the interaction in the three-body problem is not hyperspherically symmetric. The quantum rigid body (top) can be thought of as the simplest quantum three-body problem where the internal motion is frozen. To solve exactly the Schr¨ odinger equation for the rigid body is the first step for solving exactly the quantum three-body problems. Wigner first studied the exact solution for the quantum rigid body (see P.214 in [17]) from the group theory. He characterized the position of the rigid body by the three Euler angles α, β , γ of the rotation which brings the rigid body from its normal position into the position in question, and obtained the exact solution for the quantum rigid body, which is nothing but the Wigner D -function. For the quantum

圆柱绕流尾迹对壁湍流相干结构影响的实验研究_姜楠

圆柱绕流尾迹对壁湍流相干结构影响的实验研究_姜楠

第21卷第3期2007年09月实验流体力学Journal of Experiments in Fluid MechanicsVol.21,No.3Sep.,2007文章编号:1672-9897(2007)03-0008-06圆柱绕流尾迹对壁湍流相干结构影响的实验研究X姜楠,李悦雷(天津大学力学系天津市现代工程力学重点实验室,天津300072)摘要:对边界层外区的圆柱尾迹流动结构对边界层近壁区相干结构的影响进行了实验研究。

实验在低湍流度风洞中进行,将圆柱放置于ycU1.1D(D为边界层厚度)处,利用热线风速仪分别测量了沿流向不同位置边界层内的瞬时脉动速度信号,并分别比较了位于x P d=1、2、3、4、5、10、15、20、30,y+=10~1000范围内的壁湍流相干结构条件相位平均波形及其统计特性。

发现圆柱绕流尾迹对平板边界层内相干结构有明显的影响,圆柱绕流尾迹虽然使壁湍流相干结构从喷射向扫掠转变阶段的强度减弱,但壁湍流相干结构的发生概率增加,总体上促进湍流产生,使湍流边界层增厚,壁面摩擦切应力和壁面摩擦速度均增加,从而肯定了湍流边界层外层流动中产生的扰动与近壁区相干结构猝发的生成和发展有直接联系,壁湍流相干结构猝发是外区流动中产生的扰动与湍流边界层内区共同作用产生的这一结论。

关键词:圆柱绕流尾迹;湍流边界层;近壁区域;相干结构;猝发中图分类号:O357文献标识码:AExperimental study on coherent structures in wall turbu lenceinteracting with a circular cylinder wakeJIANG Nan,LI Yue-lei(Tianjin Key Laboratory of Modern Engineering Mechanics,Department of Mechanics,Tianjin University,Tianjin300072,China)Abstract:The experiment is carried out to investigate coherent structures in the near wall region of turbu-lent boundary layer interacting with the wake of a circular cylinder in the outer region of turbulent boundaryla yer.The circular cylinder lies perpendicular to the mean flow direction,parallel to the wall and at the heightof y c U1.1D(where D is the thickness of the boundary layer).Time series of instantaneous velocity at differ-ent locations in normal direction and longitudinal direction in turbulent boundary layer have been finely mea-sured using ho-t wire ane mometer in a wind tunnel.Phase-averaged waveform and statistic character of coherentstructure in the region of x P d=10,20,30and y+=10~1000are acquired using wavelet transformation andconditional sampling method.The result shows that the effect of circular cylinder wake on coherent structure isevident.Although circular cylinder wake weakens the coherent structures.intensity in the course of transitionfrom eject to sweep,the probability of coherent structure generation increases,the turbulent boundary layer isthickened,the skin friction velocity and wall shear stress increase and turbulence production is promoted in general with the interaction of the circular cylinder wake.The direct relationship is further confirmed betweenproduction and evolution of coherent struc ture burst in wall turbulence and the disturbance in the outer regionof turbulent boundary layer.Burst of coherent structure in wall turbulence is the result of interacting betweenX收稿日期:2006-08-24;修订日期:2007-03-26基金项目:教育部新世纪人才基金,国家自然科学基金(10002011)、(10232020)联合资助项目.作者简介:姜楠(1968-),男,河南省封丘县人,天津大学力学系教授,博士生导师.主要从事湍流与实验流体力学研究.E-mail:nanj@tween the outer region disturbance and near -wall re gion of turbulent boundary layer.Key words :circular cylinder wake;turbulent boundary layer;near -wall region;coherent structure;burst0 引 言自从斯坦福大学的Kline 小组(1967)[1]发现了湍流近壁区相干的大尺度快慢条纹结构,有关相干结构的发展与边界层的内层流动条件有关还是与边界层的外层流动条件有关的问题,一直还没有明确的结论。

  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

a r X i v :c o n d -m a t /0410710v 2 [c o n d -m a t .s t a t -m e c h ] 16 A u g 2005The Single Histogram Method and the Quantum Harmonic Oscillator:AccuracyLimitsW.F.Oquendo ∗and J.D.Mu˜n oz †Grupo Simulaci´o n de Sistemas F´ısicos,Departamento de F´ısicaUniversidad Nacional de Colombia,Carrera 30No.45-03,Ed.404,Of.348,Bogot´a ,Colombia.(Dated:2nd February 2008)In a recent work,M.Troyer,F.Alet and S.Wessel [1]proposed a way to extend histogram methods to quantum systems in the World Line Quantum Monte Carlo (WLQMC)formulation.The strategy,also proposed in [2],allows to compute quantum averages on a narrow temperature range from a single Monte Carlo run at fixed temperature.This is achieved by fixing N ,the number of temporal divisions in the Trotter-Suzuki expansion of WLQMC,and by changing ǫ=1/(Nk B T ).In this work we apply this strategy to construct a single histogram Monte Carlo method for a canonical ensemble of one-dimensional quantum harmonic oscillators and we explore its accuracy limits.We obtain that fixing N imposses a limit of minimal temperature to the properly performance of the method,which is T min =1.9(2)N −0.80(6)in our example.This limit is a consequence of the fact that the Trotter-Suzuki expansion fails for large ǫvalues,and,therefore,should be taken into account in all applications of this histogram method for quantum systems.PACS numbers:02.70.Ss,02.70.Tt,02.70.Uu,05.10.-a,05.10.LnKeywords:Quantum Monte Carlo;Histogram Method;Computational PhysicsINTRODUCTIONHistogram Monte Carlo methods [2,3,4]are pow-erful and robust techniques to investigate classical sys-tems,both with discrete or continuous degrees of free-dom.Such methods have many advantages over tradi-tional Monte Carlo ones.For example,one can obtain mean values of thermodynamical quantities over a broad range of temperatures by using data from a single run.Also it is possible to compute thermodynamic potentials,like the free energy,that are not accessible by other me-thods.All these methods bases on defining a density of states,let say g (E ),i.e.the number or states with the same energy.Once obtained,g (E )allows to compute av-erages like the mean energy and the specific heat at any desired temperature.Therefore,the problem of averaging over all states is transformed into a problem of counting to find g (E ).Different histogram methods differ in the way they obtain the density of states.There are histograms methods for analysis and his-tograms methods for sampling.Some examples of the first ones are the Single Histogram Method (SHM),first proposed by Z.W.Salsburg in 1959[5]and populari-zed by A.M.Ferrenberg and R.H.Swendsen in 1988[6];the Broad Histogram Method (BHM)formulated in 1996by P.C.M.de Oliveira,T.J.P.Penna and H.J.Her-mann [7],and the Transition Matrix Monte Carlo me-thod (TMMC)proposed by J.S.Wang,T.K.Tay and R.H.Swendsen in 1998[8,9],which reduces to BHM when a single energy jump is chosen.In the second class we find,for example,the Multicanonical Method,pro-posed by B.A.Berg[10](also formulated by J.Lee as the Entropic Sampling method[11]),the Flat-Histogram method of Wang and Lee [12,13]and the Wang-Landau method [14].These methods take samples uniformly dis-tributed on the energy axis.Recently,M.Troyer,F.Alet and S.Wessel proposed a way to extend histogram Monte Carlo methods to ca-nonical emsembles of quantum systems,in the world line quantum Monte Carlo (WLQMC)formulation [1,15].In contrast with previous proponsals [16,17],this idea,also proposed in [2]resembles the full power of the clasical his-togram methods,since it is able,for instance,to calculate mean values on a narrow temperature range from a sin-gle Monte Carlo run at a fixed temperature (SHM).The idea bases on the observation that interactions in time and space in the equivalent classical system of WLQMC are weighted by the temperature in different ways,as we will illustrate below.Thus,it is useful to define two new quantities,k 1and k 2,which summarize spatial and tem-poral interactions,and also a density of states g (k 1,k 2)on them.Such density can be computed by using any histogram method and allows to obtain averages at dif-ferent temperatures from a single run.This strategy has been used by Troyer,Alet and Wessel to investigate the three-dimensional quantum Heisenberg model [1],with excellent results.In this work we illustrate this strategy by studying a much more simple system:a canonical ensemble of non-coupled one-dimensional quantum harmonic oscillators.By doing so,interesting aspects of the method like its range of accuracy and its dependence on the simulation parameters will be explored.The article is organized as follows.First,the World Line Quantum Monte Carlo me-thod is revised.Next,the quantities k 1,k 2and g (k 1,k 2)for a quantum single-particle system are defined,and it is shown how this density of states allows to compute expectation values for the kinetic,potential and total en-ergy operators at any desired temperature.Then,we im-plement the SHM for the one-dimensional quantum har-2 monic oscillator,and we investigate how the temperaturerange of accuracy is affected by the number of divisionson the axis of imaginary time.Finally,we summarize ourmain results and conclusions.THE WORLD LINE QUANTUM MONTE CARLOMETHODThe World Line Quantum Monte Carlo method(WLQMC)was formulated in1982by J. E.Hirsch,R.L.Sugar,D.J.Scalapino and R.Blankenbecler[18].It has been used to study one particle systems as well asmany particle systems,like interacting bosons and sys-tem of strong correlated fermions.The WLQMC em-ploys path integrals to change the partition function ofa quantum system to the partition function of an equi-valent classical system in one higher dimension[19].Toillustrate the method,let us consider a quantum systemwith a separable HamiltonianˆH=ˆT(ˆP)+ˆV(ˆX)=ˆP2k B T is the imaginary time,ˆH is given by(1)and k B is the Boltzmann constant.SinceˆX andˆP do not commute,the exponential in (2)cannot be separated into a product of exponentials. Therefore,the imaginary timeβis written asβ=Nǫ, and a Trotter–Suzuki approximation is used[21,22,23] to write the partition function(2)asZ=limN→∞ǫ→0Z tr=limN→∞ǫ→0Tr[(e−ǫˆT e−ǫˆV(ˆX))N].(3)To compute(3),the trace is expressed as a sum over a complete set of position eigenstates,and a new complete-ness relation is introduced between each of the N factors in that expression,obtainingZ tr= m2mN−1l=0 x l−x l+1D x exp[−ǫH(x)],(6)ˆT tr=12ǫ2D x(x0−x1)2exp[−ǫH(x)]k B Tk B T= E g(E)Ee−EE g(E)e−E3approximated asg (E )≃V (E )2πǫN/2 dk 1dk 2g (k 1,k 2)e−ǫH (k 1,k 2),(11)ˆVtr =1dk 1dk 2g (k 1,k 2)e −ǫH (k 1,k 2),(12)ˆTtr =12Nǫ2dk 1dk 2g (k 1,k 2)k 2e −ǫH (k 1,k 2)Nexp[ǫH (k 1,k 2)].(14)Once g (k 1,k 2)is computed,averages atdifferenttempe-raturesareobtained bychangingǫin equations (12)–(13).THE SHM FOR THE ONE-DIMENSIONAL QUANTUM HARMONIC OSCILLATORThe system we chose is a canonical ensemble of non-coupled one-dimensional quantum harmonic oscillators.A v e r a g e P o t e n t i a l E n e r g yTemperature0.100.371.00Tsimul = 0.37Tsimul = 0.10Theorical Tsimul = 1.00 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 00.20.40.60.811.21.41.6Figure 1:Average potential energy for the one–dimensional quantum harmonic oscillator at various simulation tempera-tures.A v e r a g e K i n e t i c E n e r g yTemperature0.101.000.37Tsimul = 0.37Tsimul = 0.10Theorical Tsimul = 1.00 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 10.2 0.4 0.6 0.8 1 1.2 1.4 1.6Figure 2:Average kinetic energy for the one–dimensionalquantum harmonic oscillator at various simulation tempera-tures.For this system,k 1takes the form k 1=12+1400.250.10412.294300.090.37312.607100.10 1.00117.5324A v e r a g e T o t a l E n e r g yTemperature0.371.000.10Tsimul = 0.37Tsimul = 0.10Theorical Tsimul = 1.00 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.61.8 00.2 0.40.6 0.8 11.21.41.6Figure 3:Average total energy for the one–dimensional quan-tum harmonic oscillator at various simulation temperatures.temperature by variying ǫ,the errors will be greater for lower temperatures.There is a minimum temperature,T min ,where the simulation results includes the theorical ones between the error bars.Such a T min is a function of N .By looking at the total energy,we found for the SHMT min =1.9(2)N −0.80(6).(16)Following the same procedure for the WLQMC we foundT min =2.0(6)N −0.81(6).(17)This two results are very similar and are plotted in Figure 4.They actually show that the minimum tem-perature in SHM is a consequence of the errors in the Trotter–Suzuki aproximation.This limit is important for the correct performance of the method and should be taken into account for all applications of histogram me-thods for quantum systems in the WLQMC formulation.Increasing N or decreasing ǫgives exacter results at low temperatures,but at price of longer CP U times,just be-cause correlation times increases with decreasing ǫ[19].Nevertheless,the use of SHM spares large amounts of CP U times.For example,it takes 118sec on a Pentium4at 1.6GHz to compute ˆHT over the whole tempe-rature range 0.7≤T ≤1.7,at simulation temperature T sim =1.0,in contrast with the 35sec of a single point by WLQMC.CONCLUSIONSIn this work we have employed the extension of his-togram methods for quantum systems in the WLQMC formulation proposed in [1,2]to the case of a canoni-cal ensemble of one-dimensional quantum harmonic os-cillators.By doing so,we have explored the ranges of accuracy of the method as a function of the number of divisions N in time direction.Actually,since the me-thod fixes N and varies ǫto change T ,the corrections−0.80−0.81NT m i nSHM WLQMC1.9*N2.0*N0.010.1110100Figure 4:T min as a function of N for both SHM and WLQMC in log −log scale.in the Trotter-Suzuki expansion fixes a minimum tem-perature for the correct performance of the SHM.We obtained that the method is accurate for temperatures above T min =1.9(2)N −0.80(6).That is corroborated by direct WLQMC simulations,equation 17.This T min can be lowered by increasing N ,but at cost of larger CP U times,because correlation times grow with decreasing ǫ.Perhaps SHM needs smaller CP U times than WLQMC.The definitions of k 1and k 2and the density of states g (k 1,k 2),expressions (10)and (14),allow to apply any histogram Monte Carlo method to quantum systems in the WLQMC formulation,with all the power and advan-tages that histogram methods have deserve for classical ones.However,the restrictions founded here applies to all of them,because they relies on the fail of the Trotter-Suzuki expansion for lower ǫvalues,and should be always taken into account.Further analysis,like the theoretical study of the errors in this method,are interesting areas of future work.The strategy of extending histogram methods to quan-tum systems in the WLQMC formulation is completely general,and is able to give accurate results for many kinds of systems.We expect that our work will be useful to the right use of the method for many systems in the future.The authors would like to thank very specially R.T.Scalettar for introducing us to Quantum Monte Carlo and F.Alet for useful discussions.Also,J.D.Mu˜n oz thanks A.Muramatsu for creative discus-sions on the extension of histogram Monte Carlo methods for quantum systems.This research has been supported by the Bogota’s Research Division of the National Uni-versity of Colombia (DIB),through the grant 803755.∗email at:woquendo@ †email at:jdmunozc@.co[1]M.Troyer,F.Alet,and S.Wessel,Braz.Jour.of Phy.34,377(2004).5[2]J. D.Mu˜n oz,Ph.D.thesis,Universidad de Stuttgart(2001),published by Logos Verlag,Berlin.[3]K.Binder and D.Herrmann,Monte Carlo Simula-tions in Statistical Physics:An Introduction(Heidelberg, Springer,1997),3rd ed.[4]ndau and K.Binder,A Guide to Monte CarloMethods in Statistical Physics(Cambridge Univ.Press, Cambridge,2000).[5]Z.W.Salsburg,J.D.Jacobson,W.Fickett,and W.W.Wood,J.Chem.Phy.30,65(1959).[6]A.M.Ferrenberg and R.H.Swendsen,Phys.Rev.Lett.61,2635(1988).[7]P.de Oliveira,T.Penna,and H.Herrmann,Braz.J.ofPhysics26,677(1996),also in arxiv:/cond-mat/9610041.[8]J.S.Wang,T.K.Tay,and R.H.Swendsen,Phys.Rev.Lett.82,476(1999),also in arxiv:/cond-mat/9809181Version1.[9]J.S.Wang and R.H.Swendsen,J.Stat.Phys.106,245(2002),also in arxiv:/cond-mat/0104418Version1.[10]B.A.Berg,Int.J.Mod.Phy.C3,311(1992).[11]J.Lee,Phys.Rev.Lett71,211(1993).[12]R.H.Swendsen,B.Diggs,J.S.Wang,S.T.Li,C.Gen-ovese,and J.B.Kadane,Int.J.Mod.Phys.C10,1563 (1999).[13]J.S.Wang and L.W.Lee,mu.127,131(2000).[14]F.Wang and ndau,Phys.Rev.Lett.86,2050(2001).[15]M.Troyer,S.Wessel,and F.Alet,Phys,Rev.Lett.90(2003).[16]C.L.Martin,Phys.Rev.B59,1870(1999),also inarxiv:/cond-mat/9808144Version1.[17]C.Yamaguchi,N.Kawashima,and Y.Okabe,p.6(2003),arxiv:/cond-mat/0312645Version1.[18]J. E.Hirsch,R.L.Sugar, D.J.Scalapino,andR.Blankenbecler,Phys.Rev.B26,5033(1982). [19]R.T.Scalettar,in NATO Science Series,edited by M.P.Nightingale and C.J.Umrigar(Kluwer Academic Pub-lishers,1999),vol.525of C:Mathematical and Physical Sciences.[20]L.E.Reichl,A Modern Course in Statistical Physics(John Wiley&Sons,1998),2nd ed.[21]M.Suzuki,Phy.Lett.113A,209(1985).[22]H.F.Trotter,Proc.Am.Math.Soc.10,545(1959).[23]R.M.Fye,Phy.Rev.B33,6271(1986).[24]F.Reif,Fundamentals of Statistical and Thermal Physics(Mac Graw Hill,1968),2nd ed.。

相关文档
最新文档