[{"date_created":"2024-01-07T20:09:32Z","status":"public","publication":"arXiv:2401.01633","author":[{"last_name":"Agarwal","full_name":"Agarwal, Avantika","first_name":"Avantika"},{"orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag","first_name":"Sevag","id":"71541","last_name":"Gharibian"},{"last_name":"Koppula","first_name":"Venkata","full_name":"Koppula, Venkata"},{"full_name":"Rudolph, Dorian","first_name":"Dorian","last_name":"Rudolph"}],"title":"Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds","user_id":"71541","external_id":{"arxiv":["2401.01633"]},"abstract":[{"text":"The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity theory, with applications spanning randomized computation to circuit\r\nlower bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly, however, despite the fact that at least \\emph{four} definitions of\r\nquantum $\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$) and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs. We first resolve several open problems from\r\n[GSSSY22], including a collapse theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class $\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$, as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$, namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$.","lang":"eng"}],"year":"2024","type":"preprint","citation":{"apa":"Agarwal, A., Gharibian, S., Koppula, V., & Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds. In arXiv:2401.01633.","ama":"Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds. arXiv:240101633. Published online 2024.","chicago":"Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds.” ArXiv:2401.01633, 2024.","bibtex":"@article{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds}, journal={arXiv:2401.01633}, author={Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024} }","mla":"Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds.” ArXiv:2401.01633, 2024.","short":"A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, ArXiv:2401.01633 (2024).","ieee":"A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds,” arXiv:2401.01633. 2024."},"language":[{"iso":"eng"}],"date_updated":"2024-01-07T20:09:58Z","_id":"50273"},{"type":"journal_article","year":"2024","citation":{"short":"R. Becker, Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“ 35 (n.d.).","ieee":"R. Becker, “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),” Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“, vol. 35, no. 1.","chicago":"Becker, Rieke. “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).” Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“ 35, no. 1 (n.d.).","apa":"Becker, R. (n.d.). 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). Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“, 35(1).","ama":"Becker R. 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). Österreichische Zeitschrift für Geschichtswissenschaften Themenband „New Diplomatic History“. 35(1).","bibtex":"@article{Becker, title={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)}, volume={35}, number={1}, journal={Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“}, author={Becker, Rieke} }","mla":"Becker, Rieke. “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).” Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“, vol. 35, no. 1."},"language":[{"iso":"ger"}],"issue":"1","_id":"36466","date_updated":"2024-01-08T10:20:28Z","intvolume":" 35","volume":35,"publication_status":"accepted","date_created":"2023-01-12T14:01:25Z","status":"public","keyword":["New Diplomatic History","Neue Diplomatiegeschichte"],"department":[{"_id":"446"}],"publication":"Österreichische Zeitschrift für Geschichtswissenschaften. Themenband „New Diplomatic History“","quality_controlled":"1","author":[{"orcid":"0009-0006-9924-6984","full_name":"Becker, Rieke","first_name":"Rieke","id":"33229","last_name":"Becker"}],"title":"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)","user_id":"33229"},{"user_id":"55603","title":"The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers","status":"public","date_created":"2024-01-08T13:05:03Z","author":[{"first_name":"Simon","full_name":"Hemmrich, Simon","last_name":"Hemmrich","id":"83557"},{"last_name":"Schäfer","full_name":"Schäfer, Jannika Marie","first_name":"Jannika Marie"},{"full_name":"Hansmeier, Philipp","first_name":"Philipp","id":"55603","last_name":"Hansmeier"},{"last_name":"Beverungen","id":"59677","first_name":"Daniel","full_name":"Beverungen, Daniel"}],"publication":"Proceedings of the 57th Hawaii International Conference on System Sciences","date_updated":"2024-01-08T13:10:49Z","_id":"50296","conference":{"location":"Honolulu"},"language":[{"iso":"eng"}],"year":"2024","citation":{"ama":"Hemmrich S, Schäfer JM, Hansmeier P, Beverungen D. The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers. In: Proceedings of the 57th Hawaii International Conference on System Sciences. ; 2024.","apa":"Hemmrich, S., Schäfer, J. M., Hansmeier, P., & Beverungen, D. (2024). The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers. Proceedings of the 57th Hawaii International Conference on System Sciences.","chicago":"Hemmrich, Simon, Jannika Marie Schäfer, Philipp Hansmeier, and Daniel Beverungen. “The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers.” In Proceedings of the 57th Hawaii International Conference on System Sciences, 2024.","bibtex":"@inproceedings{Hemmrich_Schäfer_Hansmeier_Beverungen_2024, title={The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers}, booktitle={Proceedings of the 57th Hawaii International Conference on System Sciences}, author={Hemmrich, Simon and Schäfer, Jannika Marie and Hansmeier, Philipp and Beverungen, Daniel}, year={2024} }","mla":"Hemmrich, Simon, et al. “The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers.” Proceedings of the 57th Hawaii International Conference on System Sciences, 2024.","short":"S. Hemmrich, J.M. Schäfer, P. Hansmeier, D. Beverungen, in: Proceedings of the 57th Hawaii International Conference on System Sciences, 2024.","ieee":"S. Hemmrich, J. M. Schäfer, P. Hansmeier, and D. Beverungen, “The Value of Reputation Systems in Business Contexts – A Qualitative Study Taking the View of Buyers,” Honolulu, 2024."},"type":"conference"},{"place":"Duisburg","title":"Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System using Nyquist Pulses","related_material":{"link":[{"relation":"confirmation","url":"https://gemic2024.org/"}]},"user_id":"15931","department":[{"_id":"58"}],"publication":"German Microwave Conference (GeMiC) ","author":[{"first_name":"Stephan","full_name":"Kruse, Stephan","last_name":"Kruse","id":"38254"},{"id":"39217","last_name":"Schwabe","full_name":"Schwabe, Tobias","first_name":"Tobias"},{"id":"47367","last_name":"Kneuper","full_name":"Kneuper, Pascal","first_name":"Pascal"},{"last_name":"Kurz","first_name":"Heiko G.","full_name":"Kurz, Heiko G."},{"full_name":"Meinecke, March-Michael","first_name":"March-Michael","last_name":"Meinecke"},{"last_name":"Scheytt","id":"37144","first_name":"Christoph","full_name":"Scheytt, Christoph","orcid":"0000-0002-5950-6618 "}],"date_created":"2024-01-09T08:12:04Z","status":"public","conference":{"start_date":"2024.03.11","end_date":"2024.03.13"},"_id":"50287","date_updated":"2024-01-09T08:12:17Z","year":"2024","type":"conference","citation":{"short":"S. Kruse, T. Schwabe, P. Kneuper, H.G. Kurz, M.-M. Meinecke, C. Scheytt, in: German Microwave Conference (GeMiC) , Duisburg, 2024.","ieee":"S. Kruse, T. Schwabe, P. Kneuper, H. G. Kurz, M.-M. Meinecke, and C. Scheytt, “Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System using Nyquist Pulses,” 2024.","chicago":"Kruse, Stephan, Tobias Schwabe, Pascal Kneuper, Heiko G. Kurz, March-Michael Meinecke, and Christoph Scheytt. “Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System Using Nyquist Pulses.” In German Microwave Conference (GeMiC) . Duisburg, 2024.","ama":"Kruse S, Schwabe T, Kneuper P, Kurz HG, Meinecke M-M, Scheytt C. Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System using Nyquist Pulses. In: German Microwave Conference (GeMiC) . ; 2024.","apa":"Kruse, S., Schwabe, T., Kneuper, P., Kurz, H. G., Meinecke, M.-M., & Scheytt, C. (2024). Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System using Nyquist Pulses. German Microwave Conference (GeMiC) .","bibtex":"@inproceedings{Kruse_Schwabe_Kneuper_Kurz_Meinecke_Scheytt_2024, place={Duisburg}, title={Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System using Nyquist Pulses}, booktitle={German Microwave Conference (GeMiC) }, author={Kruse, Stephan and Schwabe, Tobias and Kneuper, Pascal and Kurz, Heiko G. and Meinecke, March-Michael and Scheytt, Christoph}, year={2024} }","mla":"Kruse, Stephan, et al. “Analysis and Simulation of a Photonic Multiband FMCW Radar Sensor System Using Nyquist Pulses.” German Microwave Conference (GeMiC) , 2024."},"language":[{"iso":"eng"}]},{"_id":"50301","date_updated":"2024-01-09T10:40:55Z","oa":"1","year":"2024","citation":{"bibtex":"@article{Schryen_2024, title={Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis}, journal={Journal of Parallel and Distributed Computing}, author={Schryen, Guido}, year={2024} }","mla":"Schryen, Guido. “Speedup and Efficiency of Computational Parallelization: A Unifying Approach and Asymptotic Analysis.” Journal of Parallel and Distributed Computing, 2024.","chicago":"Schryen, Guido. “Speedup and Efficiency of Computational Parallelization: A Unifying Approach and Asymptotic Analysis.” Journal of Parallel and Distributed Computing, 2024.","ama":"Schryen G. Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis. Journal of Parallel and Distributed Computing. Published online 2024.","apa":"Schryen, G. (2024). Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis. Journal of Parallel and Distributed Computing.","ieee":"G. Schryen, “Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis,” Journal of Parallel and Distributed Computing, 2024.","short":"G. Schryen, Journal of Parallel and Distributed Computing (2024)."},"type":"journal_article","language":[{"iso":"eng"}],"title":"Speedup and efficiency of computational parallelization: A unifying approach and asymptotic analysis","ddc":["000"],"user_id":"51811","department":[{"_id":"277"}],"publication":"Journal of Parallel and Distributed Computing","file_date_updated":"2024-01-09T10:39:33Z","author":[{"last_name":"Schryen","first_name":"Guido","full_name":"Schryen, Guido"}],"file":[{"file_name":"ParallelScalabilityAnalysis__Preprint.pdf","date_created":"2024-01-09T10:39:33Z","access_level":"open_access","creator":"mateskam","file_id":"50375","file_size":989773,"relation":"main_file","date_updated":"2024-01-09T10:39:33Z","content_type":"application/pdf"}],"date_created":"2024-01-09T10:40:44Z","has_accepted_license":"1","status":"public"},{"department":[{"_id":"636"}],"publication_identifier":{"issn":["1054-1500"]},"publication_status":"published","external_id":{"arxiv":["2308.05082 "]},"related_material":{"link":[{"description":"GitHub","relation":"software","url":"https://github.com/Christian-Offen/DLNN_pde"}]},"title":"Learning of discrete models of variational PDEs from data","language":[{"iso":"eng"}],"date_updated":"2024-01-09T11:29:06Z","oa":"1","doi":"10.1063/5.0172287","file":[{"access_level":"open_access","date_created":"2024-01-09T10:48:38Z","file_name":"Accepted manuscript with AIP banner CHA23-AR-01370.pdf","date_updated":"2024-01-09T10:48:38Z","content_type":"application/pdf","relation":"main_file","file_size":13222105,"file_id":"50376","creator":"coffen","title":"Accepted Manuscript Chaos"},{"file_size":12960884,"file_id":"50390","creator":"coffen","title":"Learning of discrete models of variational PDEs from data","content_type":"application/pdf","date_updated":"2024-01-09T11:19:49Z","relation":"main_file","description":"We show how to learn discrete field theories from observational data of fields on a space-time lattice. For this, we train\na neural network model of a discrete Lagrangian density such that the discrete Euler–Lagrange equations are consistent\nwith the given training data. We, thus, obtain a structure-preserving machine learning architecture. Lagrangian\ndensities are not uniquely defined by the solutions of a field theory. We introduce a technique to derive regularisers for\nthe training process which optimise numerical regularity of the discrete field theory. Minimisation of the regularisers\nguarantees that close to the training data the discrete field theory behaves robust and efficient when used in numerical\nsimulations. Further, we show how to identify structurally simple solutions of the underlying continuous field theory\nsuch as travelling waves. This is possible even when travelling waves are not present in the training data. This is\ncompared to data-driven model order reduction based approaches, which struggle to identify suitable latent spaces\ncontaining structurally simple solutions when these are not present in the training data. Ideas are demonstrated on\nexamples based on the wave equation and the Schrödinger equation.","file_name":"LDensityPDE_AIP.pdf","date_created":"2024-01-09T11:19:49Z","access_level":"open_access"}],"publisher":"AIP Publishing","author":[{"last_name":"Offen","id":"85279","first_name":"Christian","orcid":"0000-0002-5940-8057","full_name":"Offen, Christian"},{"full_name":"Ober-Blöbaum, Sina","first_name":"Sina","id":"16494","last_name":"Ober-Blöbaum"}],"quality_controlled":"1","publication":"Chaos","file_date_updated":"2024-01-09T11:19:49Z","has_accepted_license":"1","status":"public","date_created":"2023-08-10T08:24:48Z","volume":34,"article_type":"original","abstract":[{"lang":"eng","text":"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. "}],"user_id":"85279","ddc":["510"],"type":"journal_article","year":"2024","citation":{"chicago":"Offen, Christian, and Sina Ober-Blöbaum. “Learning of Discrete Models of Variational PDEs from Data.” Chaos 34, no. 1 (2024). https://doi.org/10.1063/5.0172287.","apa":"Offen, C., & Ober-Blöbaum, S. (2024). Learning of discrete models of variational PDEs from data. Chaos, 34(1), Article 013104. https://doi.org/10.1063/5.0172287","ama":"Offen C, Ober-Blöbaum S. Learning of discrete models of variational PDEs from data. Chaos. 2024;34(1). doi:10.1063/5.0172287","bibtex":"@article{Offen_Ober-Blöbaum_2024, title={Learning of discrete models of variational PDEs from data}, volume={34}, DOI={10.1063/5.0172287}, number={1013104}, journal={Chaos}, publisher={AIP Publishing}, author={Offen, Christian and Ober-Blöbaum, Sina}, year={2024} }","mla":"Offen, Christian, and Sina Ober-Blöbaum. “Learning of Discrete Models of Variational PDEs from Data.” Chaos, vol. 34, no. 1, 013104, AIP Publishing, 2024, doi:10.1063/5.0172287.","short":"C. Offen, S. Ober-Blöbaum, Chaos 34 (2024).","ieee":"C. Offen and S. Ober-Blöbaum, “Learning of discrete models of variational PDEs from data,” Chaos, vol. 34, no. 1, Art. no. 013104, 2024, doi: 10.1063/5.0172287."},"intvolume":" 34","_id":"46469","issue":"1","article_number":"013104"},{"user_id":"22501","abstract":[{"text":"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.","lang":"eng"}],"article_type":"original","volume":63,"date_created":"2023-12-15T07:32:38Z","status":"public","keyword":["Atomic and Molecular Physics","and Optics","Engineering (miscellaneous)","Electrical and Electronic Engineering"],"publication":"Applied Optics","publisher":"Optica Publishing Group","quality_controlled":"1","author":[{"first_name":"Franz","full_name":"Hempel, Franz","last_name":"Hempel"},{"last_name":"Vernuccio","full_name":"Vernuccio, Federico","first_name":"Federico"},{"first_name":"Lukas","full_name":"König, Lukas","last_name":"König"},{"full_name":"Buschbeck, Robin","first_name":"Robin","last_name":"Buschbeck"},{"id":"22501","last_name":"Rüsing","orcid":"0000-0003-4682-4577","full_name":"Rüsing, Michael","first_name":"Michael"},{"last_name":"Cerullo","full_name":"Cerullo, Giulio","first_name":"Giulio"},{"first_name":"Dario","full_name":"Polli, Dario","last_name":"Polli"},{"full_name":"Eng, Lukas M.","first_name":"Lukas M.","last_name":"Eng"}],"article_number":"112","issue":"1","_id":"49652","intvolume":" 63","type":"journal_article","citation":{"short":"F. Hempel, F. Vernuccio, L. König, R. Buschbeck, M. Rüsing, G. Cerullo, D. Polli, L.M. Eng, Applied Optics 63 (2024).","ieee":"F. Hempel et al., “Comparing transmission- and epi-BCARS: a round robin on solid-state materials,” Applied Optics, vol. 63, no. 1, Art. no. 112, 2024, doi: 10.1364/ao.505374.","chicago":"Hempel, Franz, Federico Vernuccio, Lukas König, Robin Buschbeck, Michael Rüsing, Giulio Cerullo, Dario Polli, and Lukas M. Eng. “Comparing Transmission- and Epi-BCARS: A Round Robin on Solid-State Materials.” Applied Optics 63, no. 1 (2024). https://doi.org/10.1364/ao.505374.","apa":"Hempel, F., Vernuccio, F., König, L., Buschbeck, R., Rüsing, M., Cerullo, G., Polli, D., & Eng, L. M. (2024). Comparing transmission- and epi-BCARS: a round robin on solid-state materials. Applied Optics, 63(1), Article 112. https://doi.org/10.1364/ao.505374","ama":"Hempel F, Vernuccio F, König L, et al. Comparing transmission- and epi-BCARS: a round robin on solid-state materials. Applied Optics. 2024;63(1). doi:10.1364/ao.505374","mla":"Hempel, Franz, et al. “Comparing Transmission- and Epi-BCARS: A Round Robin on Solid-State Materials.” Applied Optics, vol. 63, no. 1, 112, Optica Publishing Group, 2024, doi:10.1364/ao.505374.","bibtex":"@article{Hempel_Vernuccio_König_Buschbeck_Rüsing_Cerullo_Polli_Eng_2024, title={Comparing transmission- and epi-BCARS: a round robin on solid-state materials}, volume={63}, DOI={10.1364/ao.505374}, number={1112}, journal={Applied Optics}, publisher={Optica Publishing Group}, author={Hempel, Franz and Vernuccio, Federico and König, Lukas and Buschbeck, Robin and Rüsing, Michael and Cerullo, Giulio and Polli, Dario and Eng, Lukas M.}, year={2024} }"},"year":"2024","main_file_link":[{"url":"https://arxiv.org/pdf/2306.09701.pdf","open_access":"1"}],"title":"Comparing transmission- and epi-BCARS: a round robin on solid-state materials","related_material":{"link":[{"relation":"confirmation","url":"https://arxiv.org/abs/2306.09701"}]},"publication_status":"published","publication_identifier":{"issn":["1559-128X","2155-3165"]},"department":[{"_id":"15"}],"doi":"10.1364/ao.505374","oa":"1","date_updated":"2024-01-09T15:05:52Z","language":[{"iso":"eng"}]},{"title":"Personalizing real‐world problems: Posing own problems increases self‐efficacy expectations, intrinsic value, attainment value, and utility value","user_id":"99409","abstract":[{"lang":"eng","text":"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."}],"publication_identifier":{"issn":["0007-0998","2044-8279"]},"publication_status":"published","status":"public","date_created":"2024-01-10T08:23:49Z","publisher":"Wiley","author":[{"first_name":"Johanna","full_name":"Schoenherr, Johanna","last_name":"Schoenherr"}],"keyword":["Developmental and Educational Psychology","Education"],"publication":"British Journal of Educational Psychology","doi":"10.1111/bjep.12653","date_updated":"2024-01-10T08:25:03Z","_id":"50409","type":"journal_article","year":"2024","citation":{"short":"J. Schoenherr, British Journal of Educational Psychology (2024).","ieee":"J. Schoenherr, “Personalizing real‐world problems: Posing own problems increases self‐efficacy expectations, intrinsic value, attainment value, and utility value,” British Journal of Educational Psychology, 2024, doi: 10.1111/bjep.12653.","ama":"Schoenherr J. Personalizing real‐world problems: Posing own problems increases self‐efficacy expectations, intrinsic value, attainment value, and utility value. British Journal of Educational Psychology. Published online 2024. doi:10.1111/bjep.12653","apa":"Schoenherr, J. (2024). Personalizing real‐world problems: Posing own problems increases self‐efficacy expectations, intrinsic value, attainment value, and utility value. British Journal of Educational Psychology. https://doi.org/10.1111/bjep.12653","chicago":"Schoenherr, Johanna. “Personalizing Real‐world Problems: Posing Own Problems Increases Self‐efficacy Expectations, Intrinsic Value, Attainment Value, and Utility Value.” British Journal of Educational Psychology, 2024. https://doi.org/10.1111/bjep.12653.","mla":"Schoenherr, Johanna. “Personalizing Real‐world Problems: Posing Own Problems Increases Self‐efficacy Expectations, Intrinsic Value, Attainment Value, and Utility Value.” British Journal of Educational Psychology, Wiley, 2024, doi:10.1111/bjep.12653.","bibtex":"@article{Schoenherr_2024, title={Personalizing real‐world problems: Posing own problems increases self‐efficacy expectations, intrinsic value, attainment value, and utility value}, DOI={10.1111/bjep.12653}, journal={British Journal of Educational Psychology}, publisher={Wiley}, author={Schoenherr, Johanna}, year={2024} }"},"language":[{"iso":"eng"}]},{"title":"BQP, meet NP: Search-to-decision reductions and approximate counting","user_id":"71541","abstract":[{"text":"What is the power of polynomial-time quantum computation with access to an NP\r\noracle? In this work, we focus on two fundamental tasks from the study of\r\nBoolean satisfiability (SAT) problems: search-to-decision reductions, and\r\napproximate counting. We first show that, in strong contrast to the classical\r\nsetting where a poly-time Turing machine requires $\\Theta(n)$ queries to an NP\r\noracle to compute a witness to a given SAT formula, quantumly $\\Theta(\\log n)$\r\nqueries suffice. We then show this is tight in the black-box model - any\r\nquantum algorithm with \"NP-like\" query access to a formula requires\r\n$\\Omega(\\log n)$ queries to extract a solution with constant probability.\r\nMoving to approximate counting of SAT solutions, by exploiting a quantum link\r\nbetween search-to-decision reductions and approximate counting, we show that\r\nexisting classical approximate counting algorithms are likely optimal. First,\r\nwe give a lower bound in the \"NP-like\" black-box query setting: Approximate\r\ncounting requires $\\Omega(\\log n)$ queries, even on a quantum computer. We then\r\ngive a \"white-box\" lower bound (i.e. where the input formula is not hidden in\r\nthe oracle) - if there exists a randomized poly-time classical or quantum\r\nalgorithm for approximate counting making $o(log n)$ NP queries, then\r\n$\\text{BPP}^{\\text{NP}[o(n)]}$ contains a $\\text{P}^{\\text{NP}}$-complete\r\nproblem if the algorithm is classical and $\\text{FBQP}^{\\text{NP}[o(n)]}$\r\ncontains an $\\text{FP}^{\\text{NP}}$-complete problem if the algorithm is\r\nquantum.","lang":"eng"}],"external_id":{"arxiv":["2401.03943"]},"date_created":"2024-01-09T13:59:44Z","status":"public","publication":"arXiv:2401.03943","author":[{"first_name":"Sevag","orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag","last_name":"Gharibian","id":"71541"},{"last_name":"Kamminga","first_name":"Jonas","full_name":"Kamminga, Jonas"}],"date_updated":"2024-01-09T13:59:52Z","_id":"50406","citation":{"mla":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” ArXiv:2401.03943, 2024.","bibtex":"@article{Gharibian_Kamminga_2024, title={BQP, meet NP: Search-to-decision reductions and approximate counting}, journal={arXiv:2401.03943}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2024} }","apa":"Gharibian, S., & Kamminga, J. (2024). BQP, meet NP: Search-to-decision reductions and approximate counting. In arXiv:2401.03943.","ama":"Gharibian S, Kamminga J. BQP, meet NP: Search-to-decision reductions and approximate counting. arXiv:240103943. Published online 2024.","chicago":"Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” ArXiv:2401.03943, 2024.","ieee":"S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions and approximate counting,” arXiv:2401.03943. 2024.","short":"S. Gharibian, J. Kamminga, ArXiv:2401.03943 (2024)."},"type":"preprint","year":"2024","language":[{"iso":"eng"}]},{"type":"journal_article","citation":{"mla":"Ackermann, Domenik. “New Quick And Easy Publication - Will Be Edited by LibreCat Team.” Quick And Easy Journal Title, 2024.","bibtex":"@article{Ackermann_2024, title={New Quick And Easy Publication - Will be edited by LibreCat team}, journal={Quick And Easy Journal Title}, author={Ackermann, Domenik}, year={2024} }","chicago":"Ackermann, Domenik. “New Quick And Easy Publication - Will Be Edited by LibreCat Team.” Quick And Easy Journal Title, 2024.","ama":"Ackermann D. New Quick And Easy Publication - Will be edited by LibreCat team. Quick And Easy Journal Title. Published online 2024.","apa":"Ackermann, D. (2024). New Quick And Easy Publication - Will be edited by LibreCat team. Quick And Easy Journal Title.","ieee":"D. Ackermann, “New Quick And Easy Publication - Will be edited by LibreCat team,” Quick And Easy Journal Title, 2024.","short":"D. Ackermann, Quick And Easy Journal Title (2024)."},"year":"2024","date_updated":"2024-01-10T14:21:10Z","_id":"50101","oa":"1","file":[{"creator":"doac","file_id":"50102","file_size":156111,"relation":"main_file","date_updated":"2024-01-03T00:54:25Z","content_type":"application/pdf","date_created":"2024-01-03T00:54:25Z","file_name":"643-Article Text-2497-1-10-20220327.pdf","access_level":"open_access"}],"publication":"Quick And Easy Journal Title","file_date_updated":"2024-01-03T00:54:25Z","author":[{"first_name":"Domenik","orcid":"https://orcid.org/0000-0002-3453-4989","full_name":"Domenik Ackermann","last_name":"Ackermann","id":"103893"}],"date_created":"2024-01-03T00:54:39Z","has_accepted_license":1,"status":"public","user_id":"103893","title":"New Quick And Easy Publication - Will be edited by LibreCat team"}]