Quantum computing is an emerging field that can revolutionize our ability to solve problems and enable breakthroughs in many areas including optimization, machine learning, chemistry, and drug design. With the increasing computational power of quantum computers and the proliferation of quantum development kits, the demand for a skilled workforce in quantum computing increases significantly. The theory of quantum computing lies at the crossroads of quantum physics, mathematics, and computer science. The field of quantum computing has matured and can now be explored by all students. While today, quantum computers and simulators are readily accessible and programmable over the internet, quantum computing education is just ramping up. This paper describes our experiences in organizing and delivering quantum computing workshops for high-school students with little or no experience in the abovementioned fields. We introduce students to the world of quantum computing in innovative ways, such as newly designed “unplugged” activities for teaching basic quantum computing concepts. Overall, we take a programmatic approach and introduce students to the IBM Q Experience using Qiskit and Jupyter notebooks. Our experiences and findings suggest that basic quantum computing concepts are palatable for high-school students, and-due to significant differences between classical and quantum computing-early exposure to quantum computing is a valuable addition to the set of problem-solving and computing skills that high-schoolers obtain before entering university.
2D correlation analysis provides a powerful means of extracting structural and dynamical data from spectroscopic experiments. This has been successfully developed for techniques such as IR absorption spectroscopy, where the correlation has additionally been shown to increase the spectral resolution by observing the differing behavior of overlapping absorption bands in response to an external perturbation. Visible-infrared sum-frequency generation (SFG) spectroscopy combines many of the benefits of IR absorption and Raman scattering spectroscopy, and adds a unique structural perspective due to its surface specificity. Bringing the flexibility of 2D correlation analysis to SFG experiments would therefore further enhance the power and utility of this nonlinear vibrational spectroscopy. However, straightforward application of the correlation algorithms to homodyne SFG intensity data is not ideal as the SFG line shape often masks underlying spectral features, resulting in misleading correlation maps. We show that application of correlation analysis to heterodyne SFG experiments restores the qualitative utility of such analyses. An example is provided for the case of leucine adsorption onto surfaces of varying hydrophobicity.
String distance problems typically ask for a minimum number of permitted operations to transform one string into another. Such problems find application in a wide variety of areas, including error-correcting codes, parsing theory, speech recognition, and computational biology, to name a few. Here we consider a classic string distance problem, the NP-complete String-to-String Correction problem, first studied by Wagner some 35 years ago. In this problem, we are asked whether it is possible to transform string x into string y with at most k operations on x, where permitted operations are single-character deletions and adjacent character exchanges. We prove that String-to-String Correction is fixed-parameter tractable, for parameter k, and present a simple fixed-parameter algorithm that solves the problem in O(2kn) time. We also devise a bounded search tree algorithm, and introduce a bookkeeping technique that we call charge and reduce. This leads to an algorithm whose running time is O(1.6181kn).
The inaugural IEEE Quantum Week hosts a week-long program of 21 workshops that emphasizes the breadth and depth of the burgeoning quantum engineering community. The workshop program has been developed to capture the diversity of topics that represents the field of quantum engineering and its many impacts on quantum information science. This series includes events focused on the development and demonstration of quantum hardware, software, algorithms, and applications as well as the growth and management of the quantum workforce and global quantum ecosystem. These workshops provide accessible opportunities for researchers, practitioners, scientists, engineers, entrepreneurs, developers, students, educators, programmers, and newcomers to exchange and discuss scientific and engineering ideas at an early stage before they have matured to warrant a conference or journal publication. In this manner, the IEEE Quantum Week Workshop program serves as an incubator for a scientific community to form a research roadmap or share a research agenda. Workshops are the key to sustaining, growing and evolving IEEE Quantum Week in the future.
Many properties of a string can be viewed as sets of dependencies between substrings of the string expressed in terms of substring equality. We design a linear-time algorithm which finds a solution to an arbitrary system of such constraints: a generic string satisfying a system of substring equations. This provides a general tool for reconstructing a string from different kinds of repetitions or symmetries present in the string, in particular, from runs or from maximal palindromes. The recursive structure of our algorithm in some aspects resembles the suffix array construction by Kärkkäinen et al. (2006) . This is a full version of a paper presented at WADS 2015 .
DOI : 10.1016/j.tcs.2019.10.027 Anahtar Kelimeler :
String recovery, Minimal spanning tree, Run in a string, Maximal palindromes
ISSN: 0304-3975 Cilt: 812 Sayfa: 174-186