TY - JOUR AU - Weich, Tobias AU - Guedes Bonthonneau, Yannick AU - Guillarmou, Colin ID - 32097 JF - Journal of Differential Geometry (to appear) -- arXiv:2103.12127 TI - SRB Measures of Anosov Actions ER - TY - BOOK ED - Verhulst, Pim ED - Mildorf, Jarmila ID - 49720 SN - 978-90-04-54960-9 TI - Word, Sound and Music in Radio Drama VL - 21 ER - TY - CHAP AU - Peckhaus, Volker ED - Pulte, Helmut ED - Nickel, Gregor ID - 44862 T2 - New Perspectives on Neo-Kantianism and the Sciences TI - (Neo-)Kantian Foundation of Foundations: The Göttingen Case ER - TY - CHAP AU - Böttger, Lydia AU - Mischendahl, Anne AU - Niederhaus, Constanze ED - Blumberg, Eva ED - Niederhaus, Constanze ED - Mischendahl, Anne ID - 35902 SN - 978-3-17-037202-3 T2 - Mehrsprachigkeit in der Schule: Sprachbildung im und durch Sachunterricht TI - Konzepte sprachlicher Bildung im Fachunterricht – Gemeinsamkeiten und Unterschiede ER - TY - CHAP AU - Peckhaus, Volker ED - Remenyi, Maria ED - Remmert, Volker ED - Schappacher , Norbert ID - 44861 T2 - Geschichte der Tagungen am MFO, 1944 bis 1960er Jahre TI - Die Neuformierung der Mathematischen Logik im Nachkriegsdeutschland ER - TY - GEN AU - Peckhaus, Volker ID - 37062 T2 - Neue Deutsche Biographie Deutschland Online TI - Fraenkel, Abraham A. ER - TY - CHAP AU - Peckhaus, Volker ED - Hermann, Kay ED - Schwitzer, Boris ID - 44860 T2 - Der Geist der kritischen Schule. Kantisches Denken in der Tradition von Jakob Friedrich Fries und Leonard Nelson im 20. Jahrhundert: Wirkungen und Aktualität TI - Kritische Mathematik und die Axiomatik Hilberts ER - TY - CHAP AU - Kißling, Magdalena AU - Seidel, Nadine ED - Hodaie, Nazli ED - Hofmann, Michael ID - 33429 T2 - Literatur der Postmigration: Grundzüge, Formen und Vertreter_innen TI - Vexierbilder als gegenhegemoniales Moment. Strategien postmigrantischen Erzählens bei Andrea Karimé ER - TY - GEN AB - Despite the fundamental role the Quantum Satisfiability (QSAT) problem has played in quantum complexity theory, a central question remains open: At which local dimension does the complexity of QSAT transition from "easy" to "hard"? Here, we study QSAT with each constraint acting on a $k$-dimensional and $l$-dimensional qudit pair, denoted $(k,l)$-QSAT. Our first main result shows that, surprisingly, QSAT on qubits can remain $\mathsf{QMA}_1$-hard, in that $(2,5)$-QSAT is $\mathsf{QMA}_1$-complete. In contrast, $2$-SAT on qubits is well-known to be poly-time solvable [Bravyi, 2006]. Our second main result proves that $(3,d)$-QSAT on the 1D line with $d\in O(1)$ is also $\mathsf{QMA}_1$-hard. Finally, we initiate the study of 1D $(2,d)$-QSAT by giving a frustration-free 1D Hamiltonian with a unique, entangled ground state. Our first result uses a direct embedding, combining a novel clock construction with the 2D circuit-to-Hamiltonian construction of [Gosset, Nagaj, 2013]. Of note is a new simplified and analytic proof for the latter (as opposed to a partially numeric proof in [GN13]). This exploits Unitary Labelled Graphs [Bausch, Cubitt, Ozols, 2017] together with a new "Nullspace Connection Lemma", allowing us to break low energy analyses into small patches of projectors, and to improve the soundness analysis of [GN13] from $\Omega(1/T^6)$ to $\Omega(1/T^2)$, for $T$ the number of gates. Our second result goes via black-box reduction: Given an arbitrary 1D Hamiltonian $H$ on $d'$-dimensional qudits, we show how to embed it into an effective null-space of a 1D $(3,d)$-QSAT instance, for $d\in O(1)$. Our approach may be viewed as a weaker notion of "simulation" (\`a la [Bravyi, Hastings 2017], [Cubitt, Montanaro, Piddock 2018]). As far as we are aware, this gives the first "black-box simulation"-based $\mathsf{QMA}_1$-hardness result, i.e. for frustration-free Hamiltonians. AU - Rudolph, Dorian AU - Gharibian, Sevag AU - Nagaj, Daniel ID - 50272 T2 - arXiv:2401.02368 TI - Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation ER - TY - JOUR AB - When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell far from the tree of NP. Two decades since the first definitions of quantum NP started rolling in, quantum complexity theorists face a stark reality: There's QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical computer science audience, I survey these various definitions of quantum NP, their strengths and weaknesses, and why most of them, for better or worse, actually appear to fit naturally into the complexity zoo. AU - Gharibian, Sevag ID - 48544 IS - 4 JF - ACM SIGACT News TI - Guest Column: The 7 faces of quantum NP VL - 54 ER - TY - GEN AB - The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers. Quantumly, however, despite the fact that at least \emph{four} definitions of quantum $\mathsf{PH}$ exist, it has been challenging to prove analogues for these of even basic facts from $\mathsf{PH}$. This work studies three quantum-verifier based generalizations of $\mathsf{PH}$, two of which are from [Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings ($\mathsf{QCPH}$) and quantum mixed states ($\mathsf{QPH}$) as proofs, and one of which is new to this work, utilizing quantum pure states ($\mathsf{pureQPH}$) as proofs. We first resolve several open problems from [GSSSY22], including a collapse theorem and a Karp-Lipton theorem for $\mathsf{QCPH}$. Then, for our new class $\mathsf{pureQPH}$, we show one-sided error reduction for $\mathsf{pureQPH}$, as well as the first bounds relating these quantum variants of $\mathsf{PH}$, namely $\mathsf{QCPH}\subseteq \mathsf{pureQPH} \subseteq \mathsf{EXP}^{\mathsf{PP}}$. AU - Agarwal, Avantika AU - Gharibian, Sevag AU - Koppula, Venkata AU - Rudolph, Dorian ID - 50273 T2 - arXiv:2401.01633 TI - Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds ER - TY - JOUR AU - Becker, Rieke ID - 36466 IS - 1 JF - Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“ KW - New Diplomatic History KW - Neue Diplomatiegeschichte TI - Hilfst du mir, so hilfst du dir. Diplomatische Überzeugungsstrategien der Regentin Christine Charlotte von Ostfriesland gegenüber Kaiser Leopold I. im 17. Jahrhundert (erscheint 2024) VL - 35 ER - TY - CONF AU - Hemmrich, Simon AU - Schäfer, Jannika Marie AU - Hansmeier, Philipp AU - Beverungen, Daniel ID - 50296 T2 - Proceedings of the 57th Hawaii International Conference on System Sciences TI - The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers ER - TY - CONF AU - Kruse, Stephan AU - Schwabe, Tobias AU - Kneuper, Pascal AU - Kurz, Heiko G. AU - Meinecke, March-Michael AU - Scheytt, Christoph ID - 50287 T2 - German Microwave Conference (GeMiC) TI - Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System using Nyquist Pulses ER - TY - JOUR AU - Schryen, Guido ID - 50301 JF - Journal of Parallel and Distributed Computing TI - Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis ER - TY - JOUR AB - We show how to learn discrete field theories from observational data of fields on a space-time lattice. For this, we train a neural network model of a discrete Lagrangian density such that the discrete Euler--Lagrange equations are consistent with the given training data. We, thus, obtain a structure-preserving machine learning architecture. Lagrangian densities are not uniquely defined by the solutions of a field theory. We introduce a technique to derive regularisers for the training process which optimise numerical regularity of the discrete field theory. Minimisation of the regularisers guarantees that close to the training data the discrete field theory behaves robust and efficient when used in numerical simulations. Further, we show how to identify structurally simple solutions of the underlying continuous field theory such as travelling waves. This is possible even when travelling waves are not present in the training data. This is compared to data-driven model order reduction based approaches, which struggle to identify suitable latent spaces containing structurally simple solutions when these are not present in the training data. Ideas are demonstrated on examples based on the wave equation and the Schrödinger equation. AU - Offen, Christian AU - Ober-Blöbaum, Sina ID - 46469 IS - 1 JF - Chaos SN - 1054-1500 TI - Learning of discrete models of variational PDEs from data VL - 34 ER - TY - JOUR AB - Broadband coherent anti-Stokes Raman scattering (BCARS) is a powerful spectroscopy method combining high signal intensity with spectral sensitivity, enabling rapid imaging of heterogeneous samples in biomedical research and, more recently, in crystalline materials. However, BCARS encounters spectral distortion due to a setup-dependent non-resonant background (NRB). This study assesses BCARS reproducibility through a round robin experiment using two distinct BCARS setups and crystalline materials with varying structural complexity, including diamond, 6H-SiC, KDP, and KTP. The analysis compares setup-specific NRB correction procedures, detected and NRB-removed spectra, and mode assignment. We determine the influence of BCARS setup parameters like pump wavelength, pulse width, and detection geometry and provide a practical guide for optimizing BCARS setups for solid-state applications. AU - Hempel, Franz AU - Vernuccio, Federico AU - König, Lukas AU - Buschbeck, Robin AU - Rüsing, Michael AU - Cerullo, Giulio AU - Polli, Dario AU - Eng, Lukas M. ID - 49652 IS - 1 JF - Applied Optics KW - Atomic and Molecular Physics KW - and Optics KW - Engineering (miscellaneous) KW - Electrical and Electronic Engineering SN - 1559-128X TI - Comparing transmission- and epi-BCARS: a round robin on solid-state materials VL - 63 ER - TY - JOUR AB - AbstractBackgroundReal‐world problems are important in math instruction, but they do not necessarily trigger students' task motivation. Personalizing real‐world problems by (1) matching problems to students' shared living environment (context personalization) and (2) asking students to pose their own problems (active personalization) might be two interventions to increase students' task motivation.AimIn the current study, we investigated the effects of context personalization and active personalization on students' self‐efficacy expectations, intrinsic value, attainment value, utility value, and cost.SampleThe participants were 28 fifth‐ and sixth‐grade students who voluntarily took part in a six‐month afterschool program in which they posed problems with the aim of creating a math walk in their hometown.MethodUsing a within‐subjects design, at the end of the afterschool program, the students rated their self‐efficacy expectations and task values for four self‐developed problems associated with their hometown, four peer‐developed problems associated with their hometown, and four instructor‐provided problems associated with unfamiliar locations.ResultsStudents reported higher self‐efficacy expectations, intrinsic value, attainment value, and utility value for active‐personalized than non‐personalized problems. To a lesser extent, context personalization promoted intrinsic value and attainment value. No effect was found for cost.ConclusionsActive personalization (i.e. asking students to pose their own real‐world problems) is suited to enhance students' task motivation, specifically their self‐efficacy expectations, intrinsic value, attainment value, and utility value. Context personalization still boosts students' intrinsic value and attainment value. Implementation in classroom instruction is discussed. AU - Schoenherr, Johanna ID - 50409 JF - British Journal of Educational Psychology KW - Developmental and Educational Psychology KW - Education SN - 0007-0998 TI - Personalizing real‐world problems: Posing own problems increases self‐efficacy expectations, intrinsic value, attainment value, and utility value ER - TY - GEN AB - What is the power of polynomial-time quantum computation with access to an NP oracle? In this work, we focus on two fundamental tasks from the study of Boolean satisfiability (SAT) problems: search-to-decision reductions, and approximate counting. We first show that, in strong contrast to the classical setting where a poly-time Turing machine requires $\Theta(n)$ queries to an NP oracle to compute a witness to a given SAT formula, quantumly $\Theta(\log n)$ queries suffice. We then show this is tight in the black-box model - any quantum algorithm with "NP-like" query access to a formula requires $\Omega(\log n)$ queries to extract a solution with constant probability. Moving to approximate counting of SAT solutions, by exploiting a quantum link between search-to-decision reductions and approximate counting, we show that existing classical approximate counting algorithms are likely optimal. First, we give a lower bound in the "NP-like" black-box query setting: Approximate counting requires $\Omega(\log n)$ queries, even on a quantum computer. We then give a "white-box" lower bound (i.e. where the input formula is not hidden in the oracle) - if there exists a randomized poly-time classical or quantum algorithm for approximate counting making $o(log n)$ NP queries, then $\text{BPP}^{\text{NP}[o(n)]}$ contains a $\text{P}^{\text{NP}}$-complete problem if the algorithm is classical and $\text{FBQP}^{\text{NP}[o(n)]}$ contains an $\text{FP}^{\text{NP}}$-complete problem if the algorithm is quantum. AU - Gharibian, Sevag AU - Kamminga, Jonas ID - 50406 T2 - arXiv:2401.03943 TI - BQP, meet NP: Search-to-decision reductions and approximate counting ER - TY - JOUR AU - Domenik Ackermann ID - 50101 JF - Quick And Easy Journal Title TI - New Quick And Easy Publication - Will be edited by LibreCat team ER -