.

This thesis deals with a conformal field theoretical treatment of abelian anyons in (1 + 1)-dimensions and their relation to the integrable Calogero-Sutherland models. We generalize previous work relating anyons to the Calogero-Sutherland model by showing that the correlation function of the anyon field operators corresponds to the eigenfunctions of the deformed Calogero-Sutherland model. Our results suggest a physical application of the deformed Calogero-Sutherland model in the context of the fractional quantum Hall effect (FQHE). A key aspect for this work is the introduction of the dual anyon field operators, which obey a natural generalization of the canonical anti-commutation relation.

The emergence of Multi/Many-core systems signified an increasing need for parallel programming. Transactional Memory (TM) is a promising programming paradigm for creating concurrent applications. At current date, the design of Distributed TM (DTM) tailored for non coherent Manycore architectures is largely unexplored. This thesis addresses this topic by analysing, designing, and implementing a DTM system suitable for low latency message passing platforms. The resulting system, named SC-TM, the Single-Chip Cloud TM, is a fully decentralized and scalable DTM, implemented on Intel’s SCC processor; a 48-core ’concept vehicle’ created by Intel Labs as a platform for Many-core software research. SC-TM is one of the first fully decentralized DTMs that guarantees starvation-freedom and the first to use an actual pluggable Contention Manager (CM) to ensure liveness. Finally, this thesis introduces three completely decentralized CMs; Offset-Greedy, a decentralized version of Greedy, Wholly, which relies on the number of completed transactions, and FairCM, that makes use off the effective transactional time. The evaluation showed the latter outperformed the three.

This dissertation describes the development of automated synthesis algorithms that construct reversible quantum circuits for reversible functions with large number of variables. Specifically, the research area is focused on reversible, permutative and fully specified binary and ternary specifications and the applicability of the resulting circuit to the physical limitations of existing quantum technologies. Automated synthesis of arbitrary reversible specifications is an NP hard, multiobjective optimization problem, where 1) the amount of time and computational resources required to synthesize the specification, 2) the number of primitive quantum gates in the resulting circuit (quantum cost), and 3) the number of ancillary qubits (variables added to hold intermediate calculations) are all minimized while 4) the number of variables is maximized. Some of the existing algorithms in the literature ignored objective 2 by focusing on the synthesis of a single solution without the addition of any ancillary qubits while others attempted to explore every possible solution in the search space in an effort to discover the optimal solution (i.e., sacrificed objective 1 and 4). Other algorithms resorted to adding a huge number of ancillary qubits (counter to objective 3) in an effort minimize the number of primitive gates (objective 2). In this dissertation, I first introduce the MMDSN algorithm that is capable of synthesizing binary specifications up to 30 variables, does not add any ancillary variables, produces better quantum cost (8-50% improvement) than algorithms which limit their search to a single solution and within a minimal amount of time compared to algorithms which perform exhaustive search (seconds vs. hours). The MMDSN algorithm introduces an innovative method of using the Hasse diagram to construct candidate solutions that are guaranteed to be valid and then selects the solution with the minimal quantum cost out of this subset. I then introduce the Covered Set Partitions (CSP) algorithm that expands the search space of valid candidate solutions and allows for exploring solutions outside the range of MMDSN. I show a method of subdividing the expansive search landscape into smaller partitions and demonstrate the benefit of focusing on partition sizes that are around half of the number of variables (15% to 25% improvements, over MMDSN, for functions less than 12 variables, and more than 1000% improvement for functions with 12 and 13 variables). For a function of n variables, the CSP algorithm, theoretically, requires n times more to synthesize; however, by focusing on the middle k (k by MMDSN which typically yields lower quantum cost. I also show that using a Tabu search for selecting the next set of candidate from the CSP subset results in discovering solutions with even lower quantum costs (up to 10% improvement over CSP with random selection). In Chapters 9 and 10 I question the predominant methods of measuring quantum cost and its applicability to physical implementation of quantum gates and circuits. I counter the prevailing literature by introducing a new standard for measuring the performance of quantum synthesis algorithms by enforcing the Linear Nearest Neighbor Model (LNNM) constraint, which is imposed by the today's leading implementations of quantum technology. In addition to enforcing physical constraints, the new LNNM quantum cost (LNNQC) allows for a level comparison amongst all methods of synthesis; specifically, methods which add a large number of ancillary variables to ones that add no additional variables. I show that, when LNNM is enforced, the quantum cost for methods that add a large number of ancillary qubits increases significantly (up to 1200%). I also extend the Hasse based method to the ternary and I demonstrate synthesis of specifications of up to 9 ternary variables (compared to 3 ternary variables that existed in the literature). I introduce the concept of ternary precedence order and its implication on the construction of the Hasse diagram and the construction of valid candidate solutions. I also provide a case study comparing the performance of ternary logic synthesis of large functions using both a CUDA graphic processor with 1024 cores and an Intel i7 processor with 8 cores. In the process of exploring large ternary functions I introduce, to the literature, eight families of ternary benchmark functions along with a Multiple Valued file specification (the Extended Quantum Specification XQS). I also introduce a new composite quantum gate, the multiple valued Swivel gate, which swaps the information of qubits around a centrally located pivot point. In summary, my research objectives are as follows: * Explore and create automated synthesis algorithms for reversible circuits both in binary and ternary logic for large number of variables. * Study the impact of enforcing Linear Nearest Neighbor Model (LNNM) constraint for every interaction between qubits for reversible binary specifications. * Advocate for a revised metric for measuring the cost of a quantum circuit in concordance with LNNM, where, on one hand, such a metric would provide a way for balanced comparison between the various flavors of algorithms, and on the other hand, represents a realistic cost of a quantum circuit with respect to an ion trap implementation. * Establish an open source repository for sharing the results, software code and publications with the scientific community. With the dwindling expectations for a new lifeline on silicon-based technologies, quantum computations have the potential of becoming the future workhorse of computations. Similar to the automated CAD tools of classical logic, my work lays the foundation for creating automated tools for constructing quantum circuits from reversible specifications.

The properties of a physical system are determined by its equation of motion, and every such equation admits one-parameter groups which keep the equation invariant. Thus, for a particular system, if one can find the generator of a one-parameter group which keeps the equation and some further function or functional invariant, then one can change this system into others by changing the parameter, while keeping some properties constant. In this way, one can tell why different systems have some common properties. More importantly, one can use this method to find relationships between the physical properties of different systems. In the next section, we will illustrate the group theoretic approach by applying it to systems of two coupled oscillators and the hydrogen molecular ion. In section III of this thesis, we will investigate the helium atom system, considering both classical and quantum cases. In the quantum case our attention will be concentrated on the Schrodinger equation in matrix form. We will use a finite set of wavefunctions as our basis. Hence the results obtained will be approximate.

No description available.

No description available.

Indiana University-Purdue University Indianapolis (IUPUI) / Industry trends indicate that many-core heterogeneous processors will be the next-generation answer to Moore's law and reduced power consumption. Thus, both academia and industry are focused on the challenges presented by many-core heterogeneous processor designs. In many cases, researchers use discrete event simulators to research and validate new computer architecture innovations. However, there is a lack of dynamically configurable discrete event simulation environments for the testing and development of many-core heterogeneous processors. To fulfill this need we present Mhetero, a retargetable framework for cycle-accurate simulation of heterogeneous many-core processors along with the cycle-accurate simulation of their associated network-on-chip communication infrastructure. Mhetero is the result of research into dynamically configurable and highly flexible simulation tools with which users are free to produce custom instruction sets and communication methods in a highly modular design environment. In this thesis we will discuss our approach to dynamically configurable discrete event simulation and present several experiments performed using the framework to exemplify how Mhetero, and similarly constructed simulators, may be used for future innovations.

Indiana University-Purdue University Indianapolis (IUPUI) / Growth of interest and need for many-core systems have steadily increased over the recent years. Industry trends lead many-core systems to become increasingly larger and more complex. Because of these realities it is important to researchers, academia, and industry that the design of these many-core systems be straightforward and comprehensive. There is a need for a many-core simulator that can be simple to use and learn from for students, dynamic and capable of emulating large systems for researchers, and flexible with fast turnover for industry designers. At the same time, as many-core systems have been becoming popular and complex, and hence their design, the long standing field of Cloud Computing has become more prevalent and feasible to use. Such cloud computing platforms as Windows Azure allow for the easy access and use of resources that in the past were simply not available to ordinary users. Large tasks can be performed in SaaS Cloud Computing models and be accessible from a small, lightweight device using nothing more than a web browser. As a solution to the needs for designing future many-core systems, we present a Many-Core Simulator on Azure Cloud Computing Platform called M3C Simulator. This is targeted at teaching, research, and industry and as such needs to be easy to use, flexible, and powerful. The Could Computing service model meets all these needs. This thesis discusses overall design of the M3C Simulator and how it leverages Cloud Computing resources, the simple-to-use and understand Interface layout, and the software design including program flow and dynamic compilation.

We are developing theoretical and computational methods to study two related three-body processes in ultracold quantum gases: three-body resonances and three-body recombination. Three-body recombination causes the ultracold gas to heat up and atoms to leave the trap where they are confined. Therefore, it is an undesirable effect in the process of forming ultracold quantum gases. Metastable three-body states (resonances) are formed in the ultracold gas. When decaying they also give additional kinetic energy to the gas, that leads to the heating too. In addition, a reliable method to obtain three-body resonances would be useful in a number of problems in other fields of physics, for example, in models of metastable nuclei or to study dissociative recombination of H3 +. Our project consists of employing computer modeling to develop a method to obtain three-body resonances. The method uses a novel two-step diagonalization approach to solve the three-body Schrödinger equation. The approach employs the SVD method of Tolstikhin et al. coupled with a complex absorbing potential. We tested this method on a model system of three identical bosons with nucleon mass and compared it to the results of a previous study. This model can be employed to understand the 3He nucleus . We found one three-body bound state and four resonances. We are also studying Efimov resonances using a 4He-based model. In a system of identical spinless bosons, Efimov states are a series of loosely bound three-body states which begin to appear as the energy of the two-body bound state approaches zero . Although they were predicted 35 years ago, recent evidence of Efimov states found by Kraemer et al. in a gas of ultracold Cs atoms has sparked great interest by theorists and experimentalists. Efimov resonances are a kind of pre-dissociated Efimov trimer. To search for Efimov resonances we tune the diatom interaction potential, V(r): V(r) → λV(r) as Esry et al. did . We calculated the first two values of λ for which there is a "condensation" (infinite number) of Efimov states. They are λEfimov1 = 0.9765 and λEfimov2 = 6.834. We performed calculations for λ = 2.4, but found no evidence of Efimov resonances. For future work we plan to work with λ ≈ 4 and λ ≈ λEfimov2 where we might see d-wave and higher l-wave Efimov resonances. There is also a many-body project that forms part of this thesis and consists of a direct diagonalization of the Bogolyubov Hamiltonian, which describes elementary excitations of a gas of bosons interacting through a pairwise interaction. We would like to reproduce the corresponding energy spectrum. So far we have performed several convergence tests, but have not observed the desired energy spectrum. We show preliminary results.