@inproceedings{41905, author = {{Haffouz, S and Zeuner, K.D and Dalacu, D and Poole, P.J and Lapointe, J and Poitras, D and Mnaymneh, K and Wu, Xing and Couillard, M and Korkusinski, M and Schöll, E and Jöns, Klaus D. and Zwiller, V and Williams, R.L}}, number = {{5}}, pages = {{3047--3052}}, title = {{{Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide}}}, volume = {{18}}, year = {{2018}}, } @unpublished{42048, abstract = {{Long range quantum communication and quantum information processing require the development of light-matter interfaces for distributed quantum networks. Even though photons are ideal candidates for network links to transfer quantum information, the system of choice for the realization of quantum nodes has not been identified yet. Ideally, one strives for a hybrid network architecture, which will consist of different quantum systems, combining the strengths of each system. However, interfacing different quantum systems via photonic channels remains a major challenge because a detailed understanding of the underlying light-matter interaction is missing. Here, we show the coherent manipulation of single photons generated on-demand from a semiconductor quantum dot using a rubidium vapor quantum memory, forming a hybrid quantum network. We demonstrate the engineering of the photons' temporal wave function using four-level atoms and the creation of a new type of electromagnetic induced transparency for quantum dot photons on resonance with rubidium transitions. Given the short lifetime of our quantum dot transition the observed dynamics cannot be explained in the established steady-state picture. Our results play a pivotal role in understanding quantum light-matter interactions at short time scales. These findings demonstrate a fundamental active node to construct future large-scale hybrid quantum networks.}}, author = {{Schweickert, Lucas and Jöns, Klaus D. and Namazi, Mehdi and Cui, Guodong and Lettner, Thomas and Zeuner, Katharina D. and Montaña, Lara Scavuzzo and Silva, Saimon Filipe Covre da and Reindl, Marcus and Huang, Huiying and Trotta, Rinaldo and Rastelli, Armando and Zwiller, Val and Figueroa, Eden}}, booktitle = {{arXiv:1808.05921}}, title = {{{Electromagnetically Induced Transparency of On-demand Single Photons in a Hybrid Quantum Network}}}, year = {{2018}}, } @misc{42162, author = {{Rutkai, Gábor}}, title = {{{Large Scale Thermodynamic Data Generation with Molecular Simulation}}}, year = {{2018}}, } @article{42214, author = {{Mishra, P. K. and Chatterjee, D. and Quevedo, D. E.}}, journal = {{Automatica}}, number = {{1}}, pages = {{40–51}}, title = {{{Sparse and constrained stochastic predictive control for networked systems}}}, volume = {{87}}, year = {{2018}}, } @article{42216, author = {{L\’opez, A. M. and Quevedo, D. E. and Aguilera, R. P. and Geyer, T. and Oikonomou, N.}}, journal = {{Trans. Power Electron.}}, number = {{7}}, pages = {{6292–6303}}, title = {{{Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters}}}, volume = {{33}}, year = {{2018}}, } @article{42219, author = {{Demirel, B. and Ghadimi, E. and Quevedo, D. E. and Johansson, M.}}, journal = {{Trans. Contr. Network Syst.}}, number = {{3}}, pages = {{1275–1286}}, title = {{{Optimal control of linear systems with limited control actions: threshold-based event-triggered control}}}, volume = {{5}}, year = {{2018}}, } @article{42218, author = {{Demirel, B. and Ramaswamy, A. and Quevedo, D. E. and Karl, H.}}, journal = {{IEEE Contr. Syst. Lett.}}, number = {{4}}, pages = {{737–742}}, title = {{{DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}}}, volume = {{2}}, year = {{2018}}, } @article{42217, author = {{Leong, A. and Dey, S. and Quevedo, D. E.}}, journal = {{Automatica}}, number = {{5}}, pages = {{54–60}}, title = {{{Transmission scheduling for remote state estimation and control with an energy harvesting sensor}}}, volume = {{91}}, year = {{2018}}, } @article{42215, author = {{Liu, S. and Xie, L. and Quevedo, D. E.}}, journal = {{Trans. Contr. Network Syst.}}, number = {{1}}, pages = {{167–178}}, title = {{{Event-Triggered Quantized Communication-Based Distributed Convex Optimization}}}, volume = {{5}}, year = {{2018}}, } @book{42334, author = {{Ghaffar, Zishan}}, publisher = {{Brill | Schöningh}}, title = {{{Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung}}}, volume = {{31}}, year = {{2018}}, } @misc{41721, author = {{Foerster, Anne}}, booktitle = {{Sehepunkte}}, title = {{{Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era}}}, volume = {{18}}, year = {{2018}}, } @article{40926, author = {{Foerster, Anne}}, journal = {{Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte}}, pages = {{169--173}}, title = {{{The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh}}}, volume = {{1}}, year = {{2018}}, } @article{40929, author = {{Foerster, Anne}}, journal = {{Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte }}, pages = {{164--168}}, title = {{{Female Rulership: The Case of Seaxburh, Queen of Wessex}}}, volume = {{1}}, year = {{2018}}, } @book{40914, author = {{Foerster, Anne}}, title = {{{Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter}}}, doi = {{0000-0002-3848-3592}}, year = {{2018}}, } @phdthesis{42535, author = {{Grübel, Alexander}}, isbn = {{978-3-18-334918-0}}, issn = {{0178-9457}}, pages = {{138}}, title = {{{Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb}}}, volume = {{349}}, year = {{2018}}, } @phdthesis{42533, author = {{Dibblee, Katharina}}, isbn = {{978-3-18-335018-6}}, issn = {{0178-9457}}, pages = {{180}}, title = {{{3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen}}}, volume = {{350}}, year = {{2018}}, } @article{31655, author = {{Scharlau, Ingrid}}, journal = {{Psychologieunterricht}}, keywords = {{Unterrichtsfach Psychologie}}, pages = {{35 -- 38}}, title = {{{Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.}}}, volume = {{51}}, year = {{2018}}, } @inproceedings{8162, abstract = {{The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.}}, author = {{Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{search complexity, local Hamiltonian, Quantum SAT, algebraic geometry}}, location = {{Liverpool, UK}}, pages = {{38:1--38:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{On Efficiently Solvable Cases of Quantum k-SAT}}}, doi = {{10.4230/LIPIcs.MFCS.2018.38}}, volume = {{117}}, year = {{2018}}, } @inproceedings{8161, abstract = {{The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of "unentanglement"), QMA(2) is strictly contained in NEXP.}}, author = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity}}, location = {{Liverpool, UK}}, pages = {{58:1--58:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}}, doi = {{10.4230/LIPIcs.MFCS.2018.58}}, volume = {{117}}, year = {{2018}}, } @inproceedings{8160, abstract = {{An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a "query validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions.}}, author = {{Gharibian, Sevag and Yirka, Justin}}, booktitle = {{12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}}, editor = {{Wilde, Mark}}, keywords = {{Complexity theory, Quantum Merlin Arthur (QMA), local Hamiltonian, local measurement, spectral gap}}, location = {{Paris, France}}, pages = {{2:1--2:17}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{The Complexity of Simulating Local Measurements on Quantum Systems}}}, doi = {{10.4230/LIPIcs.TQC.2017.2}}, volume = {{73}}, year = {{2018}}, }