{"title":"QUANTUM TELEPORTATION: VALUABLE MAGIC","authors":"M. Kim","doi":"10.1142/S0219607706000158","DOIUrl":"https://doi.org/10.1142/S0219607706000158","url":null,"abstract":"Quantum teleportation is one of the most important manifestations of nonlocal nature. The basic theory and experiment are explained and reviewed for a qubit system and a continuous-variable system.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"39 1","pages":"49-60"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74342757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QUANTUM INFORMATION, ENTANGLEMENT AND RELATIONSHIPS","authors":"T. Durt","doi":"10.1142/S0219607706000146","DOIUrl":"https://doi.org/10.1142/S0219607706000146","url":null,"abstract":"We present several physical applications that were generated in the framework of quantum information science. We emphasize the crucial role played, in this approach, by a group of unitary transformations, the generalized Pauli or Heisenberg–Weyl group, and by a non-classical property, called entanglement, which appears to be a basic ingredient in Quantum Information Theory. We sketch the links between entanglement and non-locality, and discuss an analogy between entanglement and (human) relationships.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"41 1","pages":"21-48"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83184922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QUANTUM COMPUTING, GROVER'S SEARCH ALGORITHM AND ITS APPLICATIONS IN BIOINFORMATICS","authors":"K. W. Choo","doi":"10.1142/S0219607706000171","DOIUrl":"https://doi.org/10.1142/S0219607706000171","url":null,"abstract":"This article reviews quantum computing and quantum algorithms. Some insights into its potential in speeding up computations are covered, with emphasis on the use of Grover's Search. In the last section, we discuss applications of quantum algorithm to bioinformatics. In particular, the extension of quantum counting algorithm to protein mass spectra counting is proposed.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"43 1","pages":"71-80"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73708747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QUANTA, CIPHERS AND COMPUTERS","authors":"A. Ekert, L. Kwek, A. L. Linares","doi":"10.1142/S0219607706000134","DOIUrl":"https://doi.org/10.1142/S0219607706000134","url":null,"abstract":"On the atomic scale, matter obeys the rules of quantum mechanics which are quite different from the classical rules that determine the properties of conventional computers. Today's advanced lithographic techniques can etch logic gates and wires less than a micron across onto the surfaces of silicon chips. Soon they will yield even smaller parts and inevitably reach a point where logic gates are so small that they are made out of only a handful of atoms. So, if computers are to become smaller in the future, new, quantum technology must replace or supplement what we have now. This article provides a grand overview of quantum information theory from the concept of quantum bits (qubits) to entanglement to quantum computation to quantum cryptography.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"1 1","pages":"1-20"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91088383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QUANTUM COMPUTER: HOW FEASIBLE IS THE IDEA?","authors":"L. Kwek, A. Ekert","doi":"10.1142/S0219607706000195","DOIUrl":"https://doi.org/10.1142/S0219607706000195","url":null,"abstract":"The need for increased memory space and higher speed in computers has fueled the demand for smaller and faster computers. However, as the computer chips miniaturize, it becomes inevitable that we need to look at the possibility of manipulating and addressing atoms and molecules individually. One such possibility is a feasibility study of a quantum computer. In this report, we summarize some of the progress made in experimental realization of quantum computer in the last few years.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"102 1","pages":"101-110"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72882703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PARTICLE STATISTICS: A RESOURCE FOR QUANTUM INFORMATION PROCESSING","authors":"Y. Omar","doi":"10.1142/S021960770600016X","DOIUrl":"https://doi.org/10.1142/S021960770600016X","url":null,"abstract":"In this article, we will show how particle statistics can be used as a resource for quantum information processing. After introducing this fundamental aspect of quantum physics, we will present several examples showing how it is possible to perform both useful and efficient quantum information processing relying only on the effects of the indistinguishability of identical particles. All the proposed schemes can be implemented with current technology.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"54 1","pages":"61-70"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74616985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GEOMETRIC PHASES OF PURE AND MIXED STATES","authors":"R. Ravishankar, J. Du","doi":"10.1142/S0219607706000183","DOIUrl":"https://doi.org/10.1142/S0219607706000183","url":null,"abstract":"The purpose of this article is to review the literature for pure and mixed state geometric phase and also the experimental measurement of the phase using NMR.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"1 1","pages":"81-100"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89721939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"LOUIS HSIAO-YUN CHEN: EPITOME OF RARE EVENTS","authors":"Leong Yu Kiang, Lee Seng Luan, Yeneng Sun","doi":"10.1142/S0219607705000127","DOIUrl":"https://doi.org/10.1142/S0219607705000127","url":null,"abstract":"When Louis Chen Hsiao Yun turned 60 in 2000, Lee Seng Luan, who succeeded him as head of the Department of Mathematics of the National University of Singapore (NUS) in July 2000, discussed with some colleagues and friends in the department and in the Singapore Mathematical Society how they could intellectually honor a local mathematician who has established an international mathematical reputation and made significant educational contributions to the nation. We succeeded an eminent line of expatriate mathematicians without inheriting a tradition of formally or routinely cherishing the scholarship of our predecessors. There was no local precedent since Louis was among the first batch of local scholars who returned home to carve a niche for himself soon after his doctorate in the United States. This deficiency in tradition and Louis’ modesty made it a non-trivial effort for us to go ahead with even a simple symposium of celebration — something which was also mooted at that time by his friends, Bai Zhidong, He Xuming, Hu Feifang and Hwang Chii-Ruey. Eventually, with Louis’ blessings and on the condition that it be a low-key event and a small gathering confined to a few close friends, it was organised with the kind efforts of Cheng Kai Nah, Choi Kwok Pui, Hsing Tailen, Bai Zhidong, Manjeet Kaur and Stella Pang. So was that it a one-day symposium was held on 15 December 2000, within a neighbourhood of the auspicious day. The symposium was mathematically","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"145 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2005-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80483125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TESTING FOR EVOLUTIONARY RELATIONSHIP: AN APPLICATION OF MATHEMATICS IN MOLECULAR BIOLOGY","authors":"A. Barbour","doi":"10.1142/S0219607705000036","DOIUrl":"https://doi.org/10.1142/S0219607705000036","url":null,"abstract":"The paper illustrates some mathematical problems that are motivated by molecular biological applications and the techniques that are used to address them. The context is that of detecting evolutionary relationship on the basis of molecular sequence data and of measuring its strength. The Stein–Chen method is shown to play a central role in the theoretical analysis of many of the procedures used in practice.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"49 1","pages":"29-45"},"PeriodicalIF":0.0,"publicationDate":"2005-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79926294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ACCELERATING MONTE CARLO MARKOV PROCESSES","authors":"C. Hwang","doi":"10.1142/S0219607705000085","DOIUrl":"https://doi.org/10.1142/S0219607705000085","url":null,"abstract":"Let π be a probability density proportional to exp - U(x) in S. A convergent Markov process to π(x) may be regarded as a \"conceptual\" algorithm. Assume that S is a finite set. Let X0,X1,…,Xn,… be a Markov chain with transition matrix P and invariant probability π. Under suitable condition on P, it is known that converges to π(f) and the corresponding asymptotic variance v(f, P) depends only on f and P. It is natural to consider criteria vw(P) and va(P), defined respectively by maximizing and averaging v(f, P) over f. Two families of transition matrices are considered. There are four problems to be investigated. Some results and conjectures are given. As for the continuum case, to accelerate the convergence a family of diffusions with drift ∇U(x) + C(x) with div(C(x)exp - U(x)) = 0 is considered.","PeriodicalId":80753,"journal":{"name":"Bulletin - Cosmos Club. Cosmos Club (Washington, D.C.)","volume":"54 4","pages":"87-94"},"PeriodicalIF":0.0,"publicationDate":"2005-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S0219607705000085","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72486740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}