7,158 research outputs found

    UMSL Bulletin 2023-2024

    Get PDF
    The 2023-2024 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1088/thumbnail.jp

    Interdisciplinarity in the Scholarly Life Cycle

    Get PDF
    This open access book illustrates how interdisciplinary research develops over the lifetime of a scholar: not in a single project, but as an attitude that trickles down, or spirals up, into research. This book presents how interdisciplinary work has inspired shifts in how the contributors read, value concepts, critically combine methods, cope with knowledge hierarchies, write in style, and collaborate. Drawing on extensive examples from the humanities and social sciences, the editors and chapter authors show how they started, tried to open up, dealt with inconsistencies, had to adapt, and ultimately learned and grew as researchers. The book offers valuable insights into the conditions and complexities present for interdisciplinary research to be successful in an academic setting. This is an open access book

    Quantum Subroutine Composition

    Full text link
    An important tool in algorithm design is the ability to build algorithms from other algorithms that run as subroutines. In the case of quantum algorithms, a subroutine may be called on a superposition of different inputs, which complicates things. For example, a classical algorithm that calls a subroutine QQ times, where the average probability of querying the subroutine on input ii is pip_i, and the cost of the subroutine on input ii is TiT_i, incurs expected cost QipiE[Ti]Q\sum_i p_i E[T_i] from all subroutine queries. While this statement is obvious for classical algorithms, for quantum algorithms, it is much less so, since naively, if we run a quantum subroutine on a superposition of inputs, we need to wait for all branches of the superposition to terminate before we can apply the next operation. We nonetheless show an analogous quantum statement (*): If qiq_i is the average query weight on ii over all queries, the cost from all quantum subroutine queries is QiqiE[Ti]Q\sum_i q_i E[T_i]. Here the query weight on ii for a particular query is the probability of measuring ii in the input register if we were to measure right before the query. We prove this result using the technique of multidimensional quantum walks, recently introduced in arXiv:2208.13492. We present a more general version of their quantum walk edge composition result, which yields variable-time quantum walks, generalizing variable-time quantum search, by, for example, replacing the update cost with u,vπuPu,vE[Tu,v2]\sqrt{\sum_{u,v}\pi_u P_{u,v} E[T_{u,v}^2]}, where Tu,vT_{u,v} is the cost to move from vertex uu to vertex vv. The same technique that allows us to compose quantum subroutines in quantum walks can also be used to compose in any quantum algorithm, which is how we prove (*)

    Voicing Kinship with Machines: Diffractive Empathetic Listening to Synthetic Voices in Performance.

    Get PDF
    This thesis contributes to the field of voice studies by analyzing the design and production of synthetic voices in performance. The work explores six case studies, consisting of different performative experiences of the last decade (2010- 2020) that featured synthetic voice design. It focusses on the political and social impact of synthetic voices, starting from yet challenging the concepts of voice in the machine and voice of the machine. The synthetic voices explored are often playing the role of simulated artificial intelligences, therefore this thesis expands its questions towards technology at large. The analysis of the case studies follows new materialist and posthumanist premises, yet it tries to confute the patriarchal and neoliberal approach towards technological development through feminist and de-colonial approaches, developing a taxonomy for synthetic voices in performance. Chapter 1 introduces terms and explains the taxonomy. Chapter 2 looks at familiar representations of fictional AI. Chapter 3 introduces headphone theatre exploring immersive practices. Chapters 4 and 5 engage with chatbots. Chapter 6 goes in depth exploring Human and Artificial Intelligence interaction, whereas chapter 7 moves slightly towards music production and live art. The body of the thesis includes the work of Pipeline Theatre, Rimini Protokoll, Annie Dorsen, Begüm Erciyas, and Holly Herndon. The analysis is informed by posthumanism, feminism, and performance studies, starting from my own practice as sound designer and singer, looking at aesthetics of reproduction, audience engagement, and voice composition. This thesis has been designed to inspire and provoke practitioners and scholars to explore synthetic voices further, question predominant biases of binarism and acknowledge their importance in redefining technology

    2023-2024 Boise State University Undergraduate Catalog

    Get PDF
    This catalog is primarily for and directed at students. However, it serves many audiences, such as high school counselors, academic advisors, and the public. In this catalog you will find an overview of Boise State University and information on admission, registration, grades, tuition and fees, financial aid, housing, student services, and other important policies and procedures. However, most of this catalog is devoted to describing the various programs and courses offered at Boise State

    Land Use and Land Cover Mapping in a Changing World

    Get PDF
    It is increasingly being recognized that land use and land cover changes driven by anthropogenic pressures are impacting terrestrial and aquatic ecosystems and their services, human society, and human livelihoods and well-being. This Special Issue contains 12 original papers covering various issues related to land use and land use changes in various parts of the world (see references), with the purpose of providing a forum to exchange ideas and progress in related areas. Research topics include land use targets, dynamic modelling and mapping using satellite images, pressures from energy production, deforestation, impacts on ecosystem services, aboveground biomass evaluation, and investigations on libraries of legends and classification systems

    The Complexity of Translationally Invariant Problems Beyond Ground State Energies

    Get PDF
    The physically motivated quantum generalisation of k-SAT, the k-Local Hamiltonian (k-LH) problem, is well-known to be QMA-complete ("quantum NP"-complete). What is surprising, however, is that while the former is easy on 1D Boolean formulae, the latter remains hard on 1D local Hamiltonians, even if all constraints are identical [Gottesman, Irani, FOCS 2009]. Such "translation-invariant" systems are much closer in structure to what one might see in Nature. Moving beyond k-LH, what is often more physically interesting is the computation of properties of the ground space (i.e. "solution space") itself. In this work, we focus on two such recent problems: Simulating local measurements on the ground space (APX-SIM, analogous to computing properties of optimal solutions to MAX-SAT formulae) [Ambainis, CCC 2014], and deciding if the low energy space has an energy barrier (GSCON, analogous to classical reconfiguration problems) [Gharibian, Sikora, ICALP 2015]. These problems are known to be P^{QMA[log]}- and QCMA-complete, respectively, in the general case. Yet, to date, it is not known whether they remain hard in such simple 1D translationally invariant systems. In this work, we show that the 1D translationally invariant versions of both APX-SIM and GSCON are intractable, namely are P^{QMA_{EXP}}- and QCMA^{EXP}-complete ("quantum P^{NEXP}" and "quantum NEXP"), respectively. Each of these results is attained by giving a respective generic "lifting theorem". For APX-SIM we give a framework for lifting any abstract local circuit-to-Hamiltonian mapping H satisfying mild assumptions to hardness of APX-SIM on the family of Hamiltonians produced by H, while preserving the structural properties of H (e.g. translation invariance, geometry, locality, etc). Each result also leverages counterintuitive properties of our constructions: for APX-SIM, we compress the answers to polynomially many parallel queries to a QMA oracle into a single qubit. For GSCON, we show strong robustness, i.e. soundness even against adversaries acting on all but a single qudit in the system

    A survey of universal quantum von Neumann architecture

    Full text link
    The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other features, such as programmability, modularity, scalability, etc. To this end, we study the recently proposed model of quantum von Neumann architecture, by putting it in a practical and broader setting, namely, the hierarchical design of a computer system. We analyze the structures of quantum CPU and quantum control unit, and draw their connections with computational advantages. We also point out that a recent demonstration of our model would require less than 20 qubits.Comment: Special Issue Editorial Board Members' Collection Series on Quantum Entanglemen
    corecore