[{"issue":"5","publication_status":"published","page":"3047-3052","intvolume":"        18","citation":{"ieee":"S. Haffouz <i>et al.</i>, “Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide,” vol. 18, no. 5. pp. 3047–3052, 2018.","chicago":"Haffouz, S, K.D  Zeuner, D Dalacu, P.J Poole, J Lapointe, D Poitras, K Mnaymneh, et al. “Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide.” Nano Lett., 2018.","ama":"Haffouz S,  Zeuner KD, Dalacu D, et al. Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide. 2018;18(5):3047-3052.","mla":"Haffouz, S., et al. <i>Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide</i>. no. 5, 2018, pp. 3047–52.","short":"S. Haffouz, K.D.  Zeuner, D. Dalacu, P.J. Poole, J. Lapointe, D. Poitras, K. Mnaymneh, X. Wu, M. Couillard, M. Korkusinski, E.  Schöll, K.D. Jöns, V.  Zwiller, R.L.  Williams, 18 (2018) 3047–3052.","bibtex":"@article{Haffouz_ Zeuner_Dalacu_Poole_Lapointe_Poitras_Mnaymneh_Wu_Couillard_Korkusinski_et al._2018, series={Nano Lett.}, title={Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide}, volume={18}, number={5}, 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 et al.}, year={2018}, pages={3047–3052}, collection={Nano Lett.} }","apa":"Haffouz, S.,  Zeuner, K. D., Dalacu, D., Poole, P. J., Lapointe, J., Poitras, D., Mnaymneh, K., Wu, X., Couillard, M., Korkusinski, M.,  Schöll, E., Jöns, K. D.,  Zwiller, V., &#38;  Williams, R. L. (2018). <i>Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide</i> (Vol. 18, Issue 5, pp. 3047–3052)."},"year":"2018","volume":18,"date_created":"2023-02-08T05:29:08Z","author":[{"full_name":"Haffouz, S","last_name":"Haffouz","first_name":"S"},{"last_name":" Zeuner","full_name":" Zeuner, K.D","first_name":"K.D"},{"last_name":"Dalacu","full_name":"Dalacu, D","first_name":"D"},{"full_name":"Poole, P.J","last_name":"Poole","first_name":"P.J"},{"first_name":"J","last_name":"Lapointe","full_name":"Lapointe, J"},{"first_name":"D","last_name":"Poitras","full_name":"Poitras, D"},{"full_name":"Mnaymneh, K","last_name":"Mnaymneh","first_name":"K"},{"first_name":"Xing","last_name":"Wu","full_name":"Wu, Xing","id":"47829"},{"first_name":"M","full_name":"Couillard, M","last_name":"Couillard"},{"first_name":"M","last_name":"Korkusinski","full_name":"Korkusinski, M"},{"first_name":"E","full_name":" Schöll, E","last_name":" Schöll"},{"last_name":"Jöns","full_name":"Jöns, Klaus D.","id":"85353","first_name":"Klaus D."},{"first_name":"V","last_name":" Zwiller","full_name":" Zwiller, V"},{"first_name":"R.L","full_name":" Williams, R.L","last_name":" Williams"}],"date_updated":"2023-02-13T08:50:27Z","title":"Bright Single InAsP Quantum Dots at Telecom Wavelengths in Position-Controlled InP Nanowires: The Role of the Photonic Waveguide","type":"conference","status":"public","department":[{"_id":"623"}],"user_id":"71124","series_title":"Nano Lett.","_id":"41905","language":[{"iso":"ger"}]},{"language":[{"iso":"eng"}],"extern":"1","user_id":"14931","department":[{"_id":"642"}],"external_id":{"arxiv":["1808.05921"]},"_id":"42048","status":"public","abstract":[{"lang":"eng","text":"Long range quantum communication and quantum information processing require\r\nthe development of light-matter interfaces for distributed quantum networks.\r\nEven though photons are ideal candidates for network links to transfer quantum\r\ninformation, the system of choice for the realization of quantum nodes has not\r\nbeen identified yet. Ideally, one strives for a hybrid network architecture,\r\nwhich will consist of different quantum systems, combining the strengths of\r\neach system. However, interfacing different quantum systems via photonic\r\nchannels remains a major challenge because a detailed understanding of the\r\nunderlying light-matter interaction is missing. Here, we show the coherent\r\nmanipulation of single photons generated on-demand from a semiconductor quantum\r\ndot using a rubidium vapor quantum memory, forming a hybrid quantum network. We\r\ndemonstrate the engineering of the photons' temporal wave function using\r\nfour-level atoms and the creation of a new type of electromagnetic induced\r\ntransparency for quantum dot photons on resonance with rubidium transitions.\r\nGiven the short lifetime of our quantum dot transition the observed dynamics\r\ncannot be explained in the established steady-state picture. Our results play a\r\npivotal role in understanding quantum light-matter interactions at short time\r\nscales. These findings demonstrate a fundamental active node to construct\r\nfuture large-scale hybrid quantum networks."}],"type":"preprint","publication":"arXiv:1808.05921","title":"Electromagnetically Induced Transparency of On-demand Single Photons in  a Hybrid Quantum Network","author":[{"last_name":"Schweickert","full_name":"Schweickert, Lucas","first_name":"Lucas"},{"last_name":"Jöns","full_name":"Jöns, Klaus D.","id":"85353","first_name":"Klaus D."},{"first_name":"Mehdi","full_name":"Namazi, Mehdi","last_name":"Namazi"},{"first_name":"Guodong","last_name":"Cui","full_name":"Cui, Guodong"},{"last_name":"Lettner","full_name":"Lettner, Thomas","first_name":"Thomas"},{"last_name":"Zeuner","full_name":"Zeuner, Katharina D.","first_name":"Katharina D."},{"first_name":"Lara Scavuzzo","full_name":"Montaña, Lara Scavuzzo","last_name":"Montaña"},{"full_name":"Silva, Saimon Filipe Covre da","last_name":"Silva","first_name":"Saimon Filipe Covre da"},{"first_name":"Marcus","last_name":"Reindl","full_name":"Reindl, Marcus"},{"last_name":"Huang","full_name":"Huang, Huiying","first_name":"Huiying"},{"first_name":"Rinaldo","last_name":"Trotta","full_name":"Trotta, Rinaldo"},{"first_name":"Armando","last_name":"Rastelli","full_name":"Rastelli, Armando"},{"first_name":"Val","last_name":"Zwiller","full_name":"Zwiller, Val"},{"first_name":"Eden","last_name":"Figueroa","full_name":"Figueroa, Eden"}],"date_created":"2023-02-13T11:25:45Z","date_updated":"2023-02-13T11:27:52Z","citation":{"apa":"Schweickert, L., Jöns, K. D., Namazi, M., Cui, G., Lettner, T., Zeuner, K. D., Montaña, L. S., Silva, S. F. C. da, Reindl, M., Huang, H., Trotta, R., Rastelli, A., Zwiller, V., &#38; Figueroa, E. (2018). Electromagnetically Induced Transparency of On-demand Single Photons in  a Hybrid Quantum Network. In <i>arXiv:1808.05921</i>.","bibtex":"@article{Schweickert_Jöns_Namazi_Cui_Lettner_Zeuner_Montaña_Silva_Reindl_Huang_et al._2018, title={Electromagnetically Induced Transparency of On-demand Single Photons in  a Hybrid Quantum Network}, journal={arXiv:1808.05921}, 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 et al.}, year={2018} }","mla":"Schweickert, Lucas, et al. “Electromagnetically Induced Transparency of On-Demand Single Photons in  a Hybrid Quantum Network.” <i>ArXiv:1808.05921</i>, 2018.","short":"L. Schweickert, K.D. Jöns, M. Namazi, G. Cui, T. Lettner, K.D. Zeuner, L.S. Montaña, S.F.C. da Silva, M. Reindl, H. Huang, R. Trotta, A. Rastelli, V. Zwiller, E. Figueroa, ArXiv:1808.05921 (2018).","ieee":"L. Schweickert <i>et al.</i>, “Electromagnetically Induced Transparency of On-demand Single Photons in  a Hybrid Quantum Network,” <i>arXiv:1808.05921</i>. 2018.","chicago":"Schweickert, Lucas, Klaus D. Jöns, Mehdi Namazi, Guodong Cui, Thomas Lettner, Katharina D. Zeuner, Lara Scavuzzo Montaña, et al. “Electromagnetically Induced Transparency of On-Demand Single Photons in  a Hybrid Quantum Network.” <i>ArXiv:1808.05921</i>, 2018.","ama":"Schweickert L, Jöns KD, Namazi M, et al. Electromagnetically Induced Transparency of On-demand Single Photons in  a Hybrid Quantum Network. <i>arXiv:180805921</i>. Published online 2018."},"year":"2018"},{"date_updated":"2023-02-16T09:09:18Z","_id":"42162","author":[{"full_name":"Rutkai, Gábor","last_name":"Rutkai","first_name":"Gábor"}],"user_id":"15324","date_created":"2023-02-16T09:09:05Z","department":[{"_id":"155"}],"title":"Large Scale Thermodynamic Data Generation with Molecular Simulation","language":[{"iso":"eng"}],"type":"habilitation","year":"2018","citation":{"short":"G. Rutkai, Large Scale Thermodynamic Data Generation with Molecular Simulation, 2018.","mla":"Rutkai, Gábor. <i>Large Scale Thermodynamic Data Generation with Molecular Simulation</i>. 2018.","bibtex":"@book{Rutkai_2018, title={Large Scale Thermodynamic Data Generation with Molecular Simulation}, author={Rutkai, Gábor}, year={2018} }","apa":"Rutkai, G. (2018). <i>Large Scale Thermodynamic Data Generation with Molecular Simulation</i>.","chicago":"Rutkai, Gábor. <i>Large Scale Thermodynamic Data Generation with Molecular Simulation</i>, 2018.","ieee":"G. Rutkai, <i>Large Scale Thermodynamic Data Generation with Molecular Simulation</i>. 2018.","ama":"Rutkai G. <i>Large Scale Thermodynamic Data Generation with Molecular Simulation</i>.; 2018."},"status":"public"},{"type":"journal_article","publication":"Automatica","status":"public","_id":"42214","user_id":"238","department":[{"_id":"57"}],"language":[{"iso":"eng"}],"issue":"1","year":"2018","citation":{"ama":"Mishra PK, Chatterjee D, Quevedo DE. Sparse and constrained stochastic predictive control for networked systems. <i>Automatica</i>. 2018;87(1):40–51.","ieee":"P. K. Mishra, D. Chatterjee, and D. E. Quevedo, “Sparse and constrained stochastic predictive control for networked systems,” <i>Automatica</i>, vol. 87, no. 1, pp. 40–51, 2018.","chicago":"Mishra, P. K., D. Chatterjee, and D. E. Quevedo. “Sparse and Constrained Stochastic Predictive Control for Networked Systems.” <i>Automatica</i> 87, no. 1 (2018): 40–51.","bibtex":"@article{Mishra_Chatterjee_Quevedo_2018, title={Sparse and constrained stochastic predictive control for networked systems}, volume={87}, number={1}, journal={Automatica}, author={Mishra, P. K. and Chatterjee, D. and Quevedo, D. E.}, year={2018}, pages={40–51} }","mla":"Mishra, P. K., et al. “Sparse and Constrained Stochastic Predictive Control for Networked Systems.” <i>Automatica</i>, vol. 87, no. 1, 2018, pp. 40–51.","short":"P.K. Mishra, D. Chatterjee, D.E. Quevedo, Automatica 87 (2018) 40–51.","apa":"Mishra, P. K., Chatterjee, D., &#38; Quevedo, D. E. (2018). Sparse and constrained stochastic predictive control for networked systems. <i>Automatica</i>, <i>87</i>(1), 40–51."},"page":"40–51","intvolume":"        87","date_updated":"2023-02-17T14:01:27Z","author":[{"first_name":"P. K.","last_name":"Mishra","full_name":"Mishra, P. K."},{"last_name":"Chatterjee","full_name":"Chatterjee, D.","first_name":"D."},{"last_name":"Quevedo","full_name":"Quevedo, D. E.","first_name":"D. E."}],"date_created":"2023-02-17T13:58:58Z","volume":87,"title":"Sparse and constrained stochastic predictive control for networked systems"},{"language":[{"iso":"eng"}],"_id":"42216","user_id":"238","department":[{"_id":"57"}],"status":"public","type":"journal_article","publication":"Trans. Power Electron.","title":"Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters","date_updated":"2023-02-17T14:38:53Z","date_created":"2023-02-17T14:34:07Z","author":[{"first_name":"A. M.","full_name":"L\\’opez, A. M.","last_name":"L\\’opez"},{"first_name":"D. E.","last_name":"Quevedo","full_name":"Quevedo, D. E."},{"last_name":"Aguilera","full_name":"Aguilera, R. P.","first_name":"R. P."},{"last_name":"Geyer","full_name":"Geyer, T.","first_name":"T."},{"first_name":"N.","full_name":"Oikonomou, N.","last_name":"Oikonomou"}],"volume":33,"year":"2018","citation":{"ama":"L\\’opez AM, Quevedo DE, Aguilera RP, Geyer T, Oikonomou N. Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters. <i>Trans Power Electron</i>. 2018;33(7):6292–6303.","chicago":"L\\’opez, A. M., D. E. Quevedo, R. P. Aguilera, T. Geyer, and N. Oikonomou. “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters.” <i>Trans. Power Electron.</i> 33, no. 7 (2018): 6292–6303.","ieee":"A. M. L\\’opez, D. E. Quevedo, R. P. Aguilera, T. Geyer, and N. Oikonomou, “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters,” <i>Trans. Power Electron.</i>, vol. 33, no. 7, pp. 6292–6303, 2018.","mla":"L\\’opez, A. M., et al. “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters.” <i>Trans. Power Electron.</i>, vol. 33, no. 7, 2018, pp. 6292–6303.","bibtex":"@article{L\\’opez_Quevedo_Aguilera_Geyer_Oikonomou_2018, title={Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters}, volume={33}, number={7}, journal={Trans. Power Electron.}, author={L\\’opez, A. M. and Quevedo, D. E. and Aguilera, R. P. and Geyer, T. and Oikonomou, N.}, year={2018}, pages={6292–6303} }","short":"A.M. L\\’opez, D.E. Quevedo, R.P. Aguilera, T. Geyer, N. Oikonomou, Trans. Power Electron. 33 (2018) 6292–6303.","apa":"L\\’opez, A. M., Quevedo, D. E., Aguilera, R. P., Geyer, T., &#38; Oikonomou, N. (2018). Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters. <i>Trans. Power Electron.</i>, <i>33</i>(7), 6292–6303."},"intvolume":"        33","page":"6292–6303","issue":"7"},{"language":[{"iso":"eng"}],"department":[{"_id":"57"}],"user_id":"238","_id":"42219","status":"public","publication":"Trans. Contr. Network Syst.","type":"journal_article","title":"Optimal control of linear systems with limited control actions: threshold-based event-triggered control","volume":5,"date_created":"2023-02-17T14:34:41Z","author":[{"first_name":"B.","last_name":"Demirel","full_name":"Demirel, B."},{"first_name":"E.","full_name":"Ghadimi, E.","last_name":"Ghadimi"},{"last_name":"Quevedo","full_name":"Quevedo, D. E.","first_name":"D. E."},{"last_name":"Johansson","full_name":"Johansson, M.","first_name":"M."}],"date_updated":"2023-02-17T14:38:43Z","page":"1275–1286","intvolume":"         5","citation":{"bibtex":"@article{Demirel_Ghadimi_Quevedo_Johansson_2018, title={Optimal control of linear systems with limited control actions: threshold-based event-triggered control}, volume={5}, number={3}, journal={Trans. Contr. Network Syst.}, author={Demirel, B. and Ghadimi, E. and Quevedo, D. E. and Johansson, M.}, year={2018}, pages={1275–1286} }","short":"B. Demirel, E. Ghadimi, D.E. Quevedo, M. Johansson, Trans. Contr. Network Syst. 5 (2018) 1275–1286.","mla":"Demirel, B., et al. “Optimal Control of Linear Systems with Limited Control Actions: Threshold-Based Event-Triggered Control.” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 3, 2018, pp. 1275–1286.","apa":"Demirel, B., Ghadimi, E., Quevedo, D. E., &#38; Johansson, M. (2018). Optimal control of linear systems with limited control actions: threshold-based event-triggered control. <i>Trans. Contr. Network Syst.</i>, <i>5</i>(3), 1275–1286.","ieee":"B. Demirel, E. Ghadimi, D. E. Quevedo, and M. Johansson, “Optimal control of linear systems with limited control actions: threshold-based event-triggered control,” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 3, pp. 1275–1286, 2018.","chicago":"Demirel, B., E. Ghadimi, D. E. Quevedo, and M. Johansson. “Optimal Control of Linear Systems with Limited Control Actions: Threshold-Based Event-Triggered Control.” <i>Trans. Contr. Network Syst.</i> 5, no. 3 (2018): 1275–1286.","ama":"Demirel B, Ghadimi E, Quevedo DE, Johansson M. Optimal control of linear systems with limited control actions: threshold-based event-triggered control. <i>Trans Contr Network Syst</i>. 2018;5(3):1275–1286."},"year":"2018","issue":"3"},{"intvolume":"         2","page":"737–742","citation":{"mla":"Demirel, B., et al. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Contr. Syst. Lett.</i>, vol. 2, no. 4, 2018, pp. 737–742.","short":"B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Contr. Syst. Lett. 2 (2018) 737–742.","bibtex":"@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}, volume={2}, number={4}, journal={IEEE Contr. Syst. Lett.}, author={Demirel, B. and Ramaswamy, A. and Quevedo, D. E. and Karl, H.}, year={2018}, pages={737–742} }","apa":"Demirel, B., Ramaswamy, A., Quevedo, D. E., &#38; Karl, H. (2018). DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. <i>IEEE Contr. Syst. Lett.</i>, <i>2</i>(4), 737–742.","ieee":"B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,” <i>IEEE Contr. Syst. Lett.</i>, vol. 2, no. 4, pp. 737–742, 2018.","chicago":"Demirel, B., A. Ramaswamy, D. E. Quevedo, and H. Karl. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Contr. Syst. Lett.</i> 2, no. 4 (2018): 737–742.","ama":"Demirel B, Ramaswamy A, Quevedo DE, Karl H. DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. <i>IEEE Contr Syst Lett</i>. 2018;2(4):737–742."},"year":"2018","issue":"4","title":"DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling","volume":2,"date_created":"2023-02-17T14:34:32Z","author":[{"last_name":"Demirel","full_name":"Demirel, B.","first_name":"B."},{"first_name":"A.","full_name":"Ramaswamy, A.","last_name":"Ramaswamy"},{"first_name":"D. E.","last_name":"Quevedo","full_name":"Quevedo, D. E."},{"full_name":"Karl, H.","last_name":"Karl","first_name":"H."}],"date_updated":"2023-02-17T14:38:46Z","status":"public","publication":"IEEE Contr. Syst. Lett.","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"57"}],"user_id":"238","_id":"42218"},{"date_updated":"2023-02-17T14:38:50Z","volume":91,"author":[{"first_name":"A.","last_name":"Leong","full_name":"Leong, A."},{"first_name":"S.","last_name":"Dey","full_name":"Dey, S."},{"first_name":"D. E.","full_name":"Quevedo, D. E.","last_name":"Quevedo"}],"date_created":"2023-02-17T14:34:20Z","title":"Transmission scheduling for remote state estimation and control with an energy harvesting sensor","issue":"5","year":"2018","page":"54–60","intvolume":"        91","citation":{"mla":"Leong, A., et al. “Transmission Scheduling for Remote State Estimation and Control with an Energy Harvesting Sensor.” <i>Automatica</i>, vol. 91, no. 5, 2018, pp. 54–60.","short":"A. Leong, S. Dey, D.E. Quevedo, Automatica 91 (2018) 54–60.","bibtex":"@article{Leong_Dey_Quevedo_2018, title={Transmission scheduling for remote state estimation and control with an energy harvesting sensor}, volume={91}, number={5}, journal={Automatica}, author={Leong, A. and Dey, S. and Quevedo, D. E.}, year={2018}, pages={54–60} }","apa":"Leong, A., Dey, S., &#38; Quevedo, D. E. (2018). Transmission scheduling for remote state estimation and control with an energy harvesting sensor. <i>Automatica</i>, <i>91</i>(5), 54–60.","ama":"Leong A, Dey S, Quevedo DE. Transmission scheduling for remote state estimation and control with an energy harvesting sensor. <i>Automatica</i>. 2018;91(5):54–60.","ieee":"A. Leong, S. Dey, and D. E. Quevedo, “Transmission scheduling for remote state estimation and control with an energy harvesting sensor,” <i>Automatica</i>, vol. 91, no. 5, pp. 54–60, 2018.","chicago":"Leong, A., S. Dey, and D. E. Quevedo. “Transmission Scheduling for Remote State Estimation and Control with an Energy Harvesting Sensor.” <i>Automatica</i> 91, no. 5 (2018): 54–60."},"_id":"42217","department":[{"_id":"57"}],"user_id":"238","language":[{"iso":"eng"}],"publication":"Automatica","type":"journal_article","status":"public"},{"title":"Event-Triggered Quantized Communication-Based Distributed Convex Optimization","volume":5,"date_created":"2023-02-17T14:33:58Z","author":[{"last_name":"Liu","full_name":"Liu, S.","first_name":"S."},{"first_name":"L.","full_name":"Xie, L.","last_name":"Xie"},{"full_name":"Quevedo, D. E.","last_name":"Quevedo","first_name":"D. E."}],"date_updated":"2023-02-17T14:38:57Z","intvolume":"         5","page":"167–178","citation":{"mla":"Liu, S., et al. “Event-Triggered Quantized Communication-Based Distributed Convex Optimization.” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 1, 2018, pp. 167–178.","bibtex":"@article{Liu_Xie_Quevedo_2018, title={Event-Triggered Quantized Communication-Based Distributed Convex Optimization}, volume={5}, number={1}, journal={Trans. Contr. Network Syst.}, author={Liu, S. and Xie, L. and Quevedo, D. E.}, year={2018}, pages={167–178} }","short":"S. Liu, L. Xie, D.E. Quevedo, Trans. Contr. Network Syst. 5 (2018) 167–178.","apa":"Liu, S., Xie, L., &#38; Quevedo, D. E. (2018). Event-Triggered Quantized Communication-Based Distributed Convex Optimization. <i>Trans. Contr. Network Syst.</i>, <i>5</i>(1), 167–178.","ieee":"S. Liu, L. Xie, and D. E. Quevedo, “Event-Triggered Quantized Communication-Based Distributed Convex Optimization,” <i>Trans. Contr. Network Syst.</i>, vol. 5, no. 1, pp. 167–178, 2018.","chicago":"Liu, S., L. Xie, and D. E. Quevedo. “Event-Triggered Quantized Communication-Based Distributed Convex Optimization.” <i>Trans. Contr. Network Syst.</i> 5, no. 1 (2018): 167–178.","ama":"Liu S, Xie L, Quevedo DE. Event-Triggered Quantized Communication-Based Distributed Convex Optimization. <i>Trans Contr Network Syst</i>. 2018;5(1):167–178."},"year":"2018","issue":"1","language":[{"iso":"eng"}],"department":[{"_id":"57"}],"user_id":"238","_id":"42215","status":"public","publication":"Trans. Contr. Network Syst.","type":"journal_article"},{"language":[{"iso":"ger"}],"_id":"42334","department":[{"_id":"784"}],"series_title":"Beiträge zur Komparativen Theologie","user_id":"85630","status":"public","type":"book","title":"Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung","publisher":"Brill | Schöningh","date_updated":"2023-02-24T15:41:17Z","volume":31,"author":[{"first_name":"Zishan","last_name":"Ghaffar","full_name":"Ghaffar, Zishan"}],"date_created":"2023-02-23T09:01:36Z","year":"2018","place":"Paderborn","intvolume":"        31","citation":{"chicago":"Ghaffar, Zishan. <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>. Vol. 31. Beiträge zur Komparativen Theologie. Paderborn: Brill | Schöningh, 2018.","ieee":"Z. Ghaffar, <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>, vol. 31. Paderborn: Brill | Schöningh, 2018.","ama":"Ghaffar Z. <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>. Vol 31. Brill | Schöningh; 2018.","apa":"Ghaffar, Z. (2018). <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i> (Vol. 31). Brill | Schöningh.","short":"Z. Ghaffar, Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung, Brill | Schöningh, Paderborn, 2018.","bibtex":"@book{Ghaffar_2018, place={Paderborn}, series={Beiträge zur Komparativen Theologie}, title={Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung}, volume={31}, publisher={Brill | Schöningh}, author={Ghaffar, Zishan}, year={2018}, collection={Beiträge zur Komparativen Theologie} }","mla":"Ghaffar, Zishan. <i>Der historische Muhammad in der islamischen Theologie. Zur Kriterienfrage in der Leben-Muhammad-Forschung</i>. Brill | Schöningh, 2018."}},{"type":"review","publication":"Sehepunkte","status":"public","publication_date":"15.4.2018","_id":"41721","user_id":"73655","department":[{"_id":"6"}],"language":[{"iso":"ger"}],"publication_status":"published","year":"2018","citation":{"bibtex":"@article{Foerster_2018, 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}, journal={Sehepunkte}, author={Foerster, Anne}, year={2018} }","short":"A. Foerster, Sehepunkte 18 (2018).","mla":"Foerster, Anne. “Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era.” <i>Sehepunkte</i>, vol. 18, 2018.","apa":"Foerster, A. (2018). Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era. In <i>Sehepunkte</i> (Vol. 18).","chicago":"Foerster, Anne. “Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era.” <i>Sehepunkte</i>, 2018.","ieee":"A. Foerster, “Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era,” <i>Sehepunkte</i>, vol. 18. 2018.","ama":"Foerster A. Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era. <i>Sehepunkte</i>. 2018;18."},"intvolume":"        18","date_updated":"2023-02-25T09:16:04Z","author":[{"last_name":"Foerster","full_name":"Foerster, Anne","id":"67185","first_name":"Anne"}],"date_created":"2023-02-05T15:03:05Z","volume":18,"title":"Fleiner, Carey / Woodacre, Elena : Virtuous or Villainess? The Image of the Royal Mother from the Early Medieval to the Early Modern Era"},{"year":"2018","page":"169-173","intvolume":"         1","citation":{"apa":"Foerster, A. (2018). The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh. <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte</i>, <i>1</i>, 169–173.","mla":"Foerster, Anne. “The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte</i>, vol. 1, 2018, pp. 169–73.","short":"A. Foerster, Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte 1 (2018) 169–173.","bibtex":"@article{Foerster_2018, title={The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh}, volume={1}, journal={Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte}, author={Foerster, Anne}, year={2018}, pages={169–173} }","ieee":"A. Foerster, “The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh,” <i>Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte</i>, vol. 1, pp. 169–173, 2018.","chicago":"Foerster, Anne. “The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte</i> 1 (2018): 169–73.","ama":"Foerster A. The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh. <i>Mittelalter Interdisziplinäre Forschung und Rezeptionsgeschichte</i>. 2018;1:169-173."},"publication_status":"published","title":"The King’s Wife in Wessex: The Tale of Wicked Queen Eadburh","date_updated":"2023-02-25T09:17:01Z","volume":1,"author":[{"last_name":"Foerster","id":"67185","full_name":"Foerster, Anne","first_name":"Anne"}],"date_created":"2023-01-30T12:36:12Z","status":"public","publication":"Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte","type":"journal_article","language":[{"iso":"eng"}],"_id":"40926","department":[{"_id":"6"}],"user_id":"73655"},{"language":[{"iso":"eng"}],"department":[{"_id":"6"}],"user_id":"73655","_id":"40929","status":"public","publication":"Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte ","type":"journal_article","title":"Female Rulership: The Case of Seaxburh, Queen of Wessex","volume":1,"author":[{"last_name":"Foerster","full_name":"Foerster, Anne","id":"67185","first_name":"Anne"}],"date_created":"2023-01-30T12:38:07Z","date_updated":"2023-02-25T09:16:46Z","page":"164-168","intvolume":"         1","citation":{"ieee":"A. Foerster, “Female Rulership: The Case of Seaxburh, Queen of Wessex,” <i>Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte </i>, vol. 1, pp. 164–168, 2018.","chicago":"Foerster, Anne. “Female Rulership: The Case of Seaxburh, Queen of Wessex.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte </i> 1 (2018): 164–68.","ama":"Foerster A. Female Rulership: The Case of Seaxburh, Queen of Wessex. <i>Mittelalter Interdisziplinäre Forschung und Rezeptionsgeschichte </i>. 2018;1:164-168.","apa":"Foerster, A. (2018). Female Rulership: The Case of Seaxburh, Queen of Wessex. <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte </i>, <i>1</i>, 164–168.","bibtex":"@article{Foerster_2018, title={Female Rulership: The Case of Seaxburh, Queen of Wessex}, volume={1}, journal={Mittelalter. Interdisziplinäre Forschung und Rezeptionsgeschichte }, author={Foerster, Anne}, year={2018}, pages={164–168} }","short":"A. Foerster, Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte  1 (2018) 164–168.","mla":"Foerster, Anne. “Female Rulership: The Case of Seaxburh, Queen of Wessex.” <i>Mittelalter. Interdisziplinäre Forschung Und Rezeptionsgeschichte </i>, vol. 1, 2018, pp. 164–68."},"year":"2018","publication_status":"published"},{"type":"book","status":"public","series_title":"Mittelalter-Forschungen 57","user_id":"73655","_id":"40914","language":[{"iso":"ger"}],"publication_status":"published","citation":{"apa":"Foerster, A. (2018). <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. <a href=\"https://doi.org/0000-0002-3848-3592\">https://doi.org/0000-0002-3848-3592</a>","short":"A. Foerster, Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter, Ostfildern, 2018.","bibtex":"@book{Foerster_2018, place={Ostfildern}, series={Mittelalter-Forschungen 57}, title={Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter}, DOI={<a href=\"https://doi.org/0000-0002-3848-3592\">0000-0002-3848-3592</a>}, author={Foerster, Anne}, year={2018}, collection={Mittelalter-Forschungen 57} }","mla":"Foerster, Anne. <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. 2018, doi:<a href=\"https://doi.org/0000-0002-3848-3592\">0000-0002-3848-3592</a>.","ieee":"A. Foerster, <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. Ostfildern, 2018.","chicago":"Foerster, Anne. <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>. Mittelalter-Forschungen 57. Ostfildern, 2018. <a href=\"https://doi.org/0000-0002-3848-3592\">https://doi.org/0000-0002-3848-3592</a>.","ama":"Foerster A. <i>Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter</i>.; 2018. doi:<a href=\"https://doi.org/0000-0002-3848-3592\">0000-0002-3848-3592</a>"},"place":"Ostfildern","year":"2018","date_created":"2023-01-30T12:13:28Z","author":[{"first_name":"Anne","last_name":"Foerster","id":"67185","full_name":"Foerster, Anne"}],"date_updated":"2023-02-25T09:17:30Z","doi":"0000-0002-3848-3592","title":"Die Witwe des Königs. Zu Vorstellung, Anspruch und Performanz im englischen und deutschen Hochmittelalter"},{"department":[{"_id":"143"}],"series_title":"Fortschritt-Berichte VDI","user_id":"45673","_id":"42535","language":[{"iso":"ger"}],"type":"dissertation","status":"public","volume":349,"author":[{"full_name":"Grübel, Alexander","last_name":"Grübel","first_name":"Alexander"}],"supervisor":[{"first_name":"Hans Albert","full_name":"Richard, Hans Albert","last_name":"Richard"}],"date_created":"2023-02-27T11:59:06Z","date_updated":"2023-02-27T11:59:29Z","title":"Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb","publication_identifier":{"issn":["0178-9457"],"isbn":["978-3-18-334918-0"]},"intvolume":"       349","page":"138","citation":{"apa":"Grübel, A. (2018). <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i> (Vol. 349).","mla":"Grübel, Alexander. <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>. 2018.","bibtex":"@book{Grübel_2018, series={Fortschritt-Berichte VDI}, title={Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb}, volume={349}, author={Grübel, Alexander}, year={2018}, collection={Fortschritt-Berichte VDI} }","short":"A. Grübel, Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb, 2018.","ieee":"A. Grübel, <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>, vol. 349. 2018.","chicago":"Grübel, Alexander. <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>. Vol. 349. Fortschritt-Berichte VDI, 2018.","ama":"Grübel A. <i>Effiziente bruchmechanische Herangehensweise für eine wirtschaftliche Produktentstehung und einen sicheren Bauteilbetrieb</i>. Vol 349.; 2018."},"year":"2018"},{"title":"3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen","date_updated":"2023-02-27T11:52:29Z","author":[{"first_name":"Katharina","full_name":"Dibblee, Katharina","last_name":"Dibblee"}],"supervisor":[{"first_name":"Hans Albert","full_name":"Richard, Hans Albert","last_name":"Richard"}],"date_created":"2023-02-27T11:51:51Z","volume":350,"year":"2018","citation":{"mla":"Dibblee, Katharina. <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>. 2018.","bibtex":"@book{Dibblee_2018, series={Fortschritt-Berichte VDI}, title={3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen}, volume={350}, author={Dibblee, Katharina}, year={2018}, collection={Fortschritt-Berichte VDI} }","short":"K. Dibblee, 3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen, 2018.","apa":"Dibblee, K. (2018). <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i> (Vol. 350).","chicago":"Dibblee, Katharina. <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>. Vol. 350. Fortschritt-Berichte VDI, 2018.","ieee":"K. Dibblee, <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>, vol. 350. 2018.","ama":"Dibblee K. <i>3D-Risswachstum in homogenen, isotropen sowie funktional gradierten Strukturen</i>. Vol 350.; 2018."},"intvolume":"       350","page":"180","publication_identifier":{"isbn":["978-3-18-335018-6"],"issn":["0178-9457"]},"language":[{"iso":"ger"}],"_id":"42533","series_title":"Fortschritt-Berichte VDI","user_id":"45673","department":[{"_id":"143"}],"status":"public","type":"dissertation"},{"department":[{"_id":"424"}],"user_id":"42165","_id":"31655","language":[{"iso":"ger"}],"keyword":["Unterrichtsfach Psychologie"],"publication":"Psychologieunterricht","type":"journal_article","status":"public","volume":51,"date_created":"2022-06-05T01:21:46Z","author":[{"first_name":"Ingrid","orcid":"0000-0003-2364-9489","last_name":"Scharlau","full_name":"Scharlau, Ingrid","id":"451"}],"date_updated":"2023-02-28T08:12:05Z","title":"Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.","publication_status":"published","intvolume":"        51","page":"35 - 38","citation":{"short":"I. Scharlau, Psychologieunterricht 51 (2018) 35–38.","mla":"Scharlau, Ingrid. “Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.” <i>Psychologieunterricht</i>, vol. 51, 2018, pp. 35–38.","bibtex":"@article{Scharlau_2018, title={Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.}, volume={51}, journal={Psychologieunterricht}, author={Scharlau, Ingrid}, year={2018}, pages={35–38} }","apa":"Scharlau, I. (2018). Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie. <i>Psychologieunterricht</i>, <i>51</i>, 35–38.","chicago":"Scharlau, Ingrid. “Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.” <i>Psychologieunterricht</i> 51 (2018): 35–38.","ieee":"I. Scharlau, “Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie.,” <i>Psychologieunterricht</i>, vol. 51, pp. 35–38, 2018.","ama":"Scharlau I. Einheitlich, doch nicht ganz: Zur Fachdidaktik des Hochschul- und Schulfachs Psychologie. <i>Psychologieunterricht</i>. 2018;51:35-38."},"year":"2018"},{"status":"public","editor":[{"full_name":"Potapov, Igor","last_name":"Potapov","first_name":"Igor"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"type":"conference","user_id":"71541","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"623"},{"_id":"7"}],"_id":"8162","citation":{"ieee":"M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable Cases of Quantum k-SAT,” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 38:1-38:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","chicago":"Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>.","ama":"Aldi M, de Beaudrap N, Gharibian S, Saeedi S. On Efficiently Solvable Cases of Quantum k-SAT. In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>","short":"M. Aldi, N. de Beaudrap, S. Gharibian, S. Saeedi, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 38:1-38:16.","bibtex":"@inproceedings{Aldi_de Beaudrap_Gharibian_Saeedi_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={On Efficiently Solvable Cases of Quantum k-SAT}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={38:1-38:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 38:1-38:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">10.4230/LIPIcs.MFCS.2018.38</a>.","apa":"Aldi, M., de Beaudrap, N., Gharibian, S., &#38; Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.38\">https://doi.org/10.4230/LIPIcs.MFCS.2018.38</a>"},"intvolume":"       117","page":"38:1-38:16","place":"Dagstuhl, Germany","publication_status":"published","publication_identifier":{"unknown":["978-3-95977-086-6"]},"main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/volltexte/2018/9620/"}],"conference":{"location":"Liverpool, UK","name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)"},"doi":"10.4230/LIPIcs.MFCS.2018.38","author":[{"first_name":"Marco","last_name":"Aldi","full_name":"Aldi, Marco"},{"first_name":"Niel","full_name":"de Beaudrap, Niel","last_name":"de Beaudrap"},{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541","full_name":"Gharibian, Sevag","first_name":"Sevag"},{"first_name":"Seyran","last_name":"Saeedi","full_name":"Saeedi, Seyran"}],"volume":117,"oa":"1","date_updated":"2023-02-28T11:01:16Z","abstract":[{"lang":"eng","text":"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."}],"publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","language":[{"iso":"eng"}],"keyword":["search complexity","local Hamiltonian","Quantum SAT","algebraic geometry"],"external_id":{"arxiv":["1712.09617"]},"year":"2018","title":"On Efficiently Solvable Cases of Quantum k-SAT","date_created":"2019-03-01T11:34:41Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik"},{"year":"2018","date_created":"2019-03-01T11:29:44Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","title":"Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)","publication":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","abstract":[{"lang":"eng","text":"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."}],"external_id":{"arxiv":["1805.11139"]},"language":[{"iso":"eng"}],"keyword":["Complexity Theory","Quantum Computing","Polynomial Hierarchy","Semidefinite Programming","QMA(2)","Quantum Complexity"],"publication_identifier":{"unknown":["978-3-95977-086-6"]},"publication_status":"published","page":"58:1-58:16","intvolume":"       117","citation":{"ieee":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","chicago":"Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>.","ama":"Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis P, Worrell J, eds. <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>. Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>","mla":"Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i>, edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>.","short":"S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 58:1-58:16.","bibtex":"@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}, volume={117}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">10.4230/LIPIcs.MFCS.2018.58</a>}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, &#38; J. Worrell (Eds.), <i>43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)</i> (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.58\">https://doi.org/10.4230/LIPIcs.MFCS.2018.58</a>"},"place":"Dagstuhl, Germany","volume":117,"author":[{"first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541","last_name":"Gharibian","orcid":"0000-0002-9992-3379"},{"first_name":"Miklos","full_name":"Santha, Miklos","last_name":"Santha"},{"last_name":"Sikora","full_name":"Sikora, Jamie","first_name":"Jamie"},{"full_name":"Sundaram, Aarthi","last_name":"Sundaram","first_name":"Aarthi"},{"last_name":"Yirka","full_name":"Yirka, Justin","first_name":"Justin"}],"date_updated":"2023-02-28T11:01:03Z","oa":"1","conference":{"name":"43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)","location":"Liverpool, UK"},"doi":"10.4230/LIPIcs.MFCS.2018.58","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640","open_access":"1"}],"type":"conference","status":"public","editor":[{"full_name":"Potapov, Igor","last_name":"Potapov","first_name":"Igor"},{"last_name":"Spirakis","full_name":"Spirakis, Paul","first_name":"Paul"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","_id":"8161"},{"author":[{"first_name":"Sevag","id":"71541","full_name":"Gharibian, Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379"},{"first_name":"Justin","last_name":"Yirka","full_name":"Yirka, Justin"}],"volume":73,"date_updated":"2023-02-28T11:00:48Z","oa":"1","main_file_link":[{"open_access":"1","url":"http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577"}],"conference":{"name":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)","location":"Paris, France"},"doi":"10.4230/LIPIcs.TQC.2017.2","publication_status":"published","publication_identifier":{"unknown":["978-3-95977-034-7"]},"citation":{"chicago":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” In <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, edited by Mark Wilde, 73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">https://doi.org/10.4230/LIPIcs.TQC.2017.2</a>.","ieee":"S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements on Quantum Systems,” in <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, Paris, France, 2018, vol. 73, p. 2:1-2:17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>.","ama":"Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum Systems. In: Wilde M, ed. <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>. Vol 73. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>","bibtex":"@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating Local Measurements on Quantum Systems}, volume={73}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>}, booktitle={12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark}, year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i>, edited by Mark Wilde, vol. 73, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">10.4230/LIPIcs.TQC.2017.2</a>.","short":"S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.","apa":"Gharibian, S., &#38; Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), <i>12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)</i> (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.TQC.2017.2\">https://doi.org/10.4230/LIPIcs.TQC.2017.2</a>"},"page":"2:1-2:17","intvolume":"        73","place":"Dagstuhl, Germany","user_id":"71541","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"623"},{"_id":"7"}],"_id":"8160","type":"conference","status":"public","editor":[{"first_name":"Mark","full_name":"Wilde, Mark","last_name":"Wilde"}],"date_created":"2019-03-01T11:25:27Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik","title":"The Complexity of Simulating Local Measurements on Quantum Systems","year":"2018","external_id":{"arxiv":["1606.05626"]},"language":[{"iso":"eng"}],"keyword":["Complexity theory","Quantum Merlin Arthur (QMA)","local Hamiltonian","local measurement","spectral gap"],"publication":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)","abstract":[{"lang":"eng","text":"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."}]}]