[{"_id":"18266","publication":"Mathematics of Operations Research","language":[{"iso":"eng"}],"article_type":"original","title":"Value-positivity for matrix games","status":"public","scopus_import":"1","OA_type":"closed access","date_updated":"2026-04-07T12:31:21Z","publication_status":"published","month":"10","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Miquel","full_name":"Oliu-Barton, Miquel","last_name":"Oliu-Barton"},{"first_name":"Raimundo J","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta"}],"ec_funded":1,"abstract":[{"lang":"eng","text":"Matrix games are the most basic model in game theory, and yet robustness with respect to small perturbations of the matrix entries is not fully understood. In this paper, we introduce value positivity and uniform value positivity, two properties that refine the notion of optimality in the context of polynomially perturbed matrix games. The first concept captures how the value depends on the perturbation parameter, and the second consists of the existence of a fixed strategy that guarantees the value of the unperturbed matrix game for every sufficiently small positive parameter. We provide polynomial-time algorithms to check whether a polynomially perturbed matrix game satisfies these properties. We further provide the functional form for a parameterized optimal strategy and the value function. Finally, we translate our results to linear programming and stochastic games, where value positivity is related to the existence of robust solutions."}],"page":"2433-3282","isi":1,"volume":50,"project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"year":"2024","related_material":{"record":[{"relation":"dissertation_contains","id":"20234","status":"public"}]},"date_created":"2024-10-09T07:02:20Z","external_id":{"isi":["001328875900001"]},"oa_version":"None","citation":{"mla":"Chatterjee, Krishnendu, et al. “Value-Positivity for Matrix Games.” <i>Mathematics of Operations Research</i>, vol. 50, no. 4, Institute for Operations Research and the Management Sciences, 2024, pp. 2433–3282, doi:<a href=\"https://doi.org/10.1287/moor.2022.0332\">10.1287/moor.2022.0332</a>.","ista":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. 2024. Value-positivity for matrix games. Mathematics of Operations Research. 50(4), 2433–3282.","ieee":"K. Chatterjee, M. Oliu-Barton, and R. J. Saona Urmeneta, “Value-positivity for matrix games,” <i>Mathematics of Operations Research</i>, vol. 50, no. 4. Institute for Operations Research and the Management Sciences, pp. 2433–3282, 2024.","apa":"Chatterjee, K., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2024). Value-positivity for matrix games. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2022.0332\">https://doi.org/10.1287/moor.2022.0332</a>","chicago":"Chatterjee, Krishnendu, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Value-Positivity for Matrix Games.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2024. <a href=\"https://doi.org/10.1287/moor.2022.0332\">https://doi.org/10.1287/moor.2022.0332</a>.","ama":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. Value-positivity for matrix games. <i>Mathematics of Operations Research</i>. 2024;50(4):2433-3282. doi:<a href=\"https://doi.org/10.1287/moor.2022.0332\">10.1287/moor.2022.0332</a>","short":"K. Chatterjee, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2024) 2433–3282."},"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"4","publisher":"Institute for Operations Research and the Management Sciences","publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"article_processing_charge":"No","day":"01","quality_controlled":"1","date_published":"2024-10-01T00:00:00Z","intvolume":"        50","type":"journal_article","doi":"10.1287/moor.2022.0332","acknowledgement":"This research was supported by Fondation CFM pour la Recherche, the H2020 European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)], the Austrian Science Fund [Grant 10.55776/COE12], ANID Chile [Grant ACT210005], and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020].","corr_author":"1"},{"article_type":"original","file":[{"checksum":"c9ae0ea195bd39b8b3a630d492fb00dc","file_size":1426046,"success":1,"date_created":"2024-11-18T08:15:07Z","date_updated":"2024-11-18T08:15:07Z","file_id":"18562","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2024_CommMathPhysics_Erdoes.pdf"}],"status":"public","scopus_import":"1","title":"Eigenstate Thermalization Hypothesis for Wigner-type matrices","_id":"18554","publication":"Communications in Mathematical Physics","language":[{"iso":"eng"}],"month":"12","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","full_name":"Erdös, László"},{"first_name":"Volodymyr","full_name":"Riabov, Volodymyr","last_name":"Riabov","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b"}],"OA_type":"hybrid","ddc":["510"],"publication_status":"published","date_updated":"2026-04-07T12:32:19Z","year":"2024","volume":405,"isi":1,"abstract":[{"lang":"eng","text":"We prove the Eigenstate Thermalization Hypothesis for general Wigner-type matrices in the bulk of the self-consistent spectrum, with optimal control on the fluctuations for obs ervables of arbitrary rank. As the main technical ingredient, we prove rank-uniform optimal local laws for one and two resolvents of a Wigner-type matrix with regular observables. Our results hold under very general conditions on the variance profile, even allowing many vanishing entries, demonstrating that Eigenstate Thermalization occurs robustly across a diverse class of random matrix ensembles, for which the underlying quantum system has a non-trivial spatial structure."}],"oa_version":"Published Version","external_id":{"isi":["001348943900004"],"pmid":["39526190"],"arxiv":["2403.10359"]},"date_created":"2024-11-17T23:01:46Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20575"}]},"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","issue":"12","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"L. Erdös, V. Riabov, Communications in Mathematical Physics 405 (2024).","ama":"Erdös L, Riabov V. Eigenstate Thermalization Hypothesis for Wigner-type matrices. <i>Communications in Mathematical Physics</i>. 2024;405(12). doi:<a href=\"https://doi.org/10.1007/s00220-024-05143-y\">10.1007/s00220-024-05143-y</a>","chicago":"Erdös, László, and Volodymyr Riabov. “Eigenstate Thermalization Hypothesis for Wigner-Type Matrices.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s00220-024-05143-y\">https://doi.org/10.1007/s00220-024-05143-y</a>.","apa":"Erdös, L., &#38; Riabov, V. (2024). Eigenstate Thermalization Hypothesis for Wigner-type matrices. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-024-05143-y\">https://doi.org/10.1007/s00220-024-05143-y</a>","ieee":"L. Erdös and V. Riabov, “Eigenstate Thermalization Hypothesis for Wigner-type matrices,” <i>Communications in Mathematical Physics</i>, vol. 405, no. 12. Springer Nature, 2024.","ista":"Erdös L, Riabov V. 2024. Eigenstate Thermalization Hypothesis for Wigner-type matrices. Communications in Mathematical Physics. 405(12), 282.","mla":"Erdös, László, and Volodymyr Riabov. “Eigenstate Thermalization Hypothesis for Wigner-Type Matrices.” <i>Communications in Mathematical Physics</i>, vol. 405, no. 12, 282, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1007/s00220-024-05143-y\">10.1007/s00220-024-05143-y</a>."},"department":[{"_id":"LaEr"}],"date_published":"2024-12-01T00:00:00Z","OA_place":"publisher","intvolume":"       405","arxiv":1,"day":"01","quality_controlled":"1","oa":1,"doi":"10.1007/s00220-024-05143-y","type":"journal_article","pmid":1,"file_date_updated":"2024-11-18T08:15:07Z","corr_author":"1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","has_accepted_license":"1","license":"https://creativecommons.org/licenses/by/4.0/","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"282"},{"OA_place":"publisher","intvolume":"        78","date_published":"2024-10-01T00:00:00Z","quality_controlled":"1","day":"01","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1558-5646"]},"publisher":"Oxford University Press","issue":"10","department":[{"_id":"GaTk"}],"citation":{"ama":"Rella S, Kulikova YA, Minnegalieva A, Kondrashov F. Complex vaccination strategies prevent the emergence of vaccine resistance. <i>Evolution: International journal of organic evolution</i>. 2024;78(10):1722-1738. doi:<a href=\"https://doi.org/10.1093/evolut/qpae106\">10.1093/evolut/qpae106</a>","short":"S. Rella, Y.A. Kulikova, A. Minnegalieva, F. Kondrashov, Evolution: International Journal of Organic Evolution 78 (2024) 1722–1738.","mla":"Rella, Simon, et al. “Complex Vaccination Strategies Prevent the Emergence of Vaccine Resistance.” <i>Evolution: International Journal of Organic Evolution</i>, vol. 78, no. 10, Oxford University Press, 2024, pp. 1722–38, doi:<a href=\"https://doi.org/10.1093/evolut/qpae106\">10.1093/evolut/qpae106</a>.","ista":"Rella S, Kulikova YA, Minnegalieva A, Kondrashov F. 2024. Complex vaccination strategies prevent the emergence of vaccine resistance. Evolution: International journal of organic evolution. 78(10), 1722–1738.","chicago":"Rella, Simon, Yuliya A. Kulikova, Aygul Minnegalieva, and Fyodor Kondrashov. “Complex Vaccination Strategies Prevent the Emergence of Vaccine Resistance.” <i>Evolution: International Journal of Organic Evolution</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/evolut/qpae106\">https://doi.org/10.1093/evolut/qpae106</a>.","ieee":"S. Rella, Y. A. Kulikova, A. Minnegalieva, and F. Kondrashov, “Complex vaccination strategies prevent the emergence of vaccine resistance,” <i>Evolution: International journal of organic evolution</i>, vol. 78, no. 10. Oxford University Press, pp. 1722–1738, 2024.","apa":"Rella, S., Kulikova, Y. A., Minnegalieva, A., &#38; Kondrashov, F. (2024). Complex vaccination strategies prevent the emergence of vaccine resistance. <i>Evolution: International Journal of Organic Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/evolut/qpae106\">https://doi.org/10.1093/evolut/qpae106</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"acknowledgement":"We thank Raimundo Julian Saona Urmeneta, Maike Morrison, Sergey Kryazhimskiy, Hiroki Ishikawa, Simone Pigolotti, and Shingo Miyauchi for fruitful discussions. We also thank the participants of the FRISBI seminar at ISTA for useful comments.","has_accepted_license":"1","doi":"10.1093/evolut/qpae106","oa":1,"pmid":1,"type":"journal_article","file_date_updated":"2024-10-21T09:34:50Z","month":"10","author":[{"id":"B4765ACA-AA38-11E9-AC9A-0930E6697425","last_name":"Rella","full_name":"Rella, Simon","first_name":"Simon"},{"last_name":"Kulikova","full_name":"Kulikova, Yuliya A.","first_name":"Yuliya A."},{"full_name":"Minnegalieva, Aygul","first_name":"Aygul","last_name":"Minnegalieva","id":"87DF77F0-1D9A-11EA-B6AE-CE443DDC885E"},{"last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","full_name":"Kondrashov, Fyodor"}],"publication_status":"published","date_updated":"2026-04-07T12:34:57Z","OA_type":"hybrid","ddc":["570"],"scopus_import":"1","file":[{"date_updated":"2024-10-21T09:34:50Z","date_created":"2024-10-21T09:34:50Z","success":1,"file_size":29360811,"checksum":"5c6e8475bb88b07d424a5130d5e91e74","file_name":"2024_Evolution_Rella.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"18453","creator":"dernst"}],"status":"public","title":"Complex vaccination strategies prevent the emergence of vaccine resistance","article_type":"original","language":[{"iso":"eng"}],"publication":"Evolution: International journal of organic evolution","_id":"18307","oa_version":"Published Version","external_id":{"pmid":["38990788"],"isi":["001286581900001"]},"date_created":"2024-10-13T22:01:50Z","related_material":{"link":[{"url":"https://github.com/Simon-Re/complex-vaccination","relation":"software"}],"record":[{"status":"public","relation":"research_data","id":"14862"},{"relation":"dissertation_contains","id":"20811","status":"public"}]},"year":"2024","volume":78,"isi":1,"page":"1722-1738","abstract":[{"text":"Vaccination is the most effective tool to control infectious diseases. However, the evolution of vaccine resistance, exemplified by vaccine resistance in SARS-CoV-2, remains a concern. Here, we model complex vaccination strategies against a pathogen with multiple epitopes—molecules targeted by the vaccine. We found that a vaccine targeting one epitope was ineffective in preventing vaccine escape. Vaccine resistance in highly infectious pathogens was prevented by the full-epitope vaccine, that is, one targeting all available epitopes, but only when the rate of pathogen evolution was low. Strikingly, a bet-hedging strategy of random administration of vaccines targeting different epitopes was the most effective in preventing vaccine resistance in pathogens with the low rate of infection and high rate of evolution. Thus, complex vaccination strategies, when biologically feasible, may be preferable to the currently used single-vaccine approaches for long-term control of disease outbreaks, especially when applied to livestock with near 100% vaccination rates.","lang":"eng"}]},{"language":[{"iso":"eng"}],"publication":"Cryptology ePrint Archive","citation":{"mla":"Hoffmann, Charlotte, et al. “Practical Batch Proofs of Exponentiation.” <i>Cryptology EPrint Archive</i>, 2024/145, International Association for Cryptologic Research .","ista":"Hoffmann C, Hubáček P, Ivanova S. Practical batch proofs of exponentiation. Cryptology ePrint Archive, 2024/145.","ieee":"C. Hoffmann, P. Hubáček, and S. Ivanova, “Practical batch proofs of exponentiation,” <i>Cryptology ePrint Archive</i>. International Association for Cryptologic Research .","apa":"Hoffmann, C., Hubáček, P., &#38; Ivanova, S. (n.d.). Practical batch proofs of exponentiation. <i>Cryptology ePrint Archive</i>. International Association for Cryptologic Research .","chicago":"Hoffmann, Charlotte, Pavel Hubáček, and Svetlana Ivanova. “Practical Batch Proofs of Exponentiation.” <i>Cryptology EPrint Archive</i>. International Association for Cryptologic Research , n.d.","ama":"Hoffmann C, Hubáček P, Ivanova S. Practical batch proofs of exponentiation. <i>Cryptology ePrint Archive</i>.","short":"C. Hoffmann, P. Hubáček, S. Ivanova, Cryptology EPrint Archive (n.d.)."},"_id":"20701","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"publisher":"International Association for Cryptologic Research ","title":"Practical batch proofs of exponentiation","article_processing_charge":"No","status":"public","date_updated":"2026-04-07T12:34:30Z","publication_status":"draft","day":"02","OA_type":"green","OA_place":"repository","author":[{"last_name":"Hoffmann","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","full_name":"Hoffmann, Charlotte","orcid":"0000-0003-2027-5549","first_name":"Charlotte"},{"first_name":"Pavel","full_name":"Hubáček, Pavel","last_name":"Hubáček"},{"last_name":"Ivanova","full_name":"Ivanova, Svetlana","first_name":"Svetlana"}],"month":"02","date_published":"2024-02-02T00:00:00Z","type":"preprint","abstract":[{"text":"A Proof of Exponentiation (PoE) allows a prover to efficiently convince a verifier that 𝑦 = 𝑥\r\n𝑒\r\nin some group of unknown order. PoEs\r\nare the basis for practical constructions of Verifiable Delay Functions (VDFs), which, in turn, are important for various higher-level\r\nprotocols in distributed computing. In applications such as distributed consensus, many PoEs are generated regularly, motivating\r\nprotocols for secure aggregation of batches of statements into a\r\nfew statements to improve the efficiency for both parties. Rotem\r\n(TCC 2021) recently presented two such generic batch PoEs.\r\nIn this work, we introduce two batch PoEs that outperform\r\nboth proposals of Rotem and we evaluate their practicality. First,\r\nwe show that the two batch PoEs of Rotem can be combined to\r\nimprove the overall efficiency by at least a factor of two. Second, we\r\nrevisit the work of Bellare, Garay, and Rabin (EUROCRYPT 1998)\r\non batch verification of digital signatures and show that, under the\r\nlow order assumption, their bucket test can be securely adapted to\r\nthe setting of groups of unknown order. The resulting batch PoE\r\nquickly outperforms the state of the art in the expected number of\r\ngroup multiplications with the growing number of instances, and it\r\ndecreases the cost of batching by an order of magnitude already for\r\nhundreds of thousands of instances. Importantly, it is the first batch\r\nPoE that significantly decreases both the proof size and complexity\r\nof verification. Our experimental evaluations show that even a nonoptimized implementation achieves such improvements, which\r\nwould match the demands of real-life systems requiring large-scale\r\nPoE processing.\r\nFinally, even though our proof techniques are conceptually similar to Rotem, we give an improved analysis of the application of the\r\nlow order assumption towards secure batching of PoE instances,\r\nresulting in a tight reduction, which is important when setting the\r\nsecurity parameter in practice.","lang":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2024/145","open_access":"1"}],"oa":1,"year":"2024","article_number":"2024/145","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"status":"public","id":"20920","relation":"dissertation_contains"},{"id":"20556","relation":"dissertation_contains","status":"public"}]},"date_created":"2025-11-27T10:13:38Z","acknowledgement":"Pavel Hubáček was supported by the Institute of Mathematics, Czech Academy of Sciences (RVO 67985840).","corr_author":"1","oa_version":"Preprint"},{"author":[{"first_name":"Marek","full_name":"Filakovský, Marek","last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nakajima","first_name":"Tamio Vesa","full_name":"Nakajima, Tamio Vesa"},{"full_name":"Opršal, Jakub","orcid":"0000-0003-1245-3456","first_name":"Jakub","last_name":"Opršal","id":"ec596741-c539-11ec-b829-c79322a91242"},{"id":"0433290C-AF8F-11E9-A4C7-F729E6697425","last_name":"Tasinato","first_name":"Gianluca","full_name":"Tasinato, Gianluca"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli"}],"month":"03","ddc":["510"],"publication_status":"published","date_updated":"2026-04-07T12:36:50Z","scopus_import":"1","file":[{"creator":"dernst","file_id":"15175","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2024_LIPICs_Filakovsky.pdf","file_size":927290,"checksum":"0524d4189fd1ed08989546511343edf3","success":1,"date_created":"2024-03-25T07:44:30Z","date_updated":"2024-03-25T07:44:30Z"}],"status":"public","title":"Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs","_id":"15168","publication":"41st International Symposium on Theoretical Aspects of Computer Science","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2024-03-24T23:00:59Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20339"}]},"external_id":{"arxiv":["2312.12981"],"isi":["001300393400034"]},"year":"2024","isi":1,"project":[{"call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"volume":289,"ec_funded":1,"abstract":[{"lang":"eng","text":"A linearly ordered (LO) k-colouring of a hypergraph is a colouring of its vertices with colours 1, … , k such that each edge contains a unique maximal colour. Deciding whether an input hypergraph admits LO k-colouring with a fixed number of colours is NP-complete (and in the special case of graphs, LO colouring coincides with the usual graph colouring). Here, we investigate the complexity of approximating the \"linearly ordered chromatic number\" of a hypergraph. We prove that the following promise problem is NP-complete: Given a 3-uniform hypergraph, distinguish between the case that it is LO 3-colourable, and the case that it is not even LO 4-colourable. We prove this result by a combination of algebraic, topological, and combinatorial methods, building on and extending a topological approach for studying approximate graph colouring introduced by Krokhin, Opršal, Wrochna, and Živný (2023)."}],"date_published":"2024-03-01T00:00:00Z","intvolume":"       289","arxiv":1,"day":"01","quality_controlled":"1","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773119"]},"article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ama":"Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: <i>41st International Symposium on Theoretical Aspects of Computer Science</i>. Vol 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2024.34\">10.4230/LIPIcs.STACS.2024.34</a>","short":"M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” <i>41st International Symposium on Theoretical Aspects of Computer Science</i>, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2024.34\">10.4230/LIPIcs.STACS.2024.34</a>.","apa":"Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., &#38; Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In <i>41st International Symposium on Theoretical Aspects of Computer Science</i> (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2024.34\">https://doi.org/10.4230/LIPIcs.STACS.2024.34</a>","ieee":"M. Filakovský, T. V. Nakajima, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” in <i>41st International Symposium on Theoretical Aspects of Computer Science</i>, Clermont-Ferrand, France, 2024, vol. 289.","chicago":"Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” In <i>41st International Symposium on Theoretical Aspects of Computer Science</i>, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2024.34\">https://doi.org/10.4230/LIPIcs.STACS.2024.34</a>.","ista":"Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["LIPIcs"],"department":[{"_id":"UlWa"}],"corr_author":"1","acknowledgement":"Marek Filakovský: This research was supported by Charles University (project PRIMUS/\r\n21/SCI/014), the Austrian Science Fund (FWF project P31312-N35), and MSCAfellow5_MUNI\r\n(CZ.02.01.01/00/22_010/0003229). Tamio-Vesa Nakajima: This research was funded by UKRI EP/X024431/1 and by a Clarendon Fund Scholarship. All data is provided in full in the results section of this paper. Jakub Opršal: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No 101034413. Uli Wagner: This research was supported by the Austrian Science Fund (FWF project P31312-N35).","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"34","oa":1,"doi":"10.4230/LIPIcs.STACS.2024.34","conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","start_date":"2024-03-12","location":"Clermont-Ferrand, France","end_date":"2024-03-14"},"type":"conference","file_date_updated":"2024-03-25T07:44:30Z"},{"acknowledgement":"LE and JH were supported by the ERC Advanced Grant łRMTBeyondž No. 101020331","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.17609"}],"type":"journal_article","oa":1,"doi":"10.4310/ATMP.241031013250","day":"30","arxiv":1,"quality_controlled":"1","date_published":"2024-10-30T00:00:00Z","OA_place":"repository","intvolume":"        28","department":[{"_id":"LaEr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Cipolloni G, Erdös L, Henheik SJ. 2024. Out-of-time-ordered correlators for Wigner matrices. Advances in Theoretical and Mathematical Physics. 28(6), 2025–2083.","chicago":"Cipolloni, Giorgio, László Erdös, and Sven Joscha Henheik. “Out-of-Time-Ordered Correlators for Wigner Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2024. <a href=\"https://doi.org/10.4310/ATMP.241031013250\">https://doi.org/10.4310/ATMP.241031013250</a>.","ieee":"G. Cipolloni, L. Erdös, and S. J. Henheik, “Out-of-time-ordered correlators for Wigner matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 28, no. 6. International Press, pp. 2025–2083, 2024.","apa":"Cipolloni, G., Erdös, L., &#38; Henheik, S. J. (2024). Out-of-time-ordered correlators for Wigner matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.241031013250\">https://doi.org/10.4310/ATMP.241031013250</a>","mla":"Cipolloni, Giorgio, et al. “Out-of-Time-Ordered Correlators for Wigner Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 28, no. 6, International Press, 2024, pp. 2025–83, doi:<a href=\"https://doi.org/10.4310/ATMP.241031013250\">10.4310/ATMP.241031013250</a>.","short":"G. Cipolloni, L. Erdös, S.J. Henheik, Advances in Theoretical and Mathematical Physics 28 (2024) 2025–2083.","ama":"Cipolloni G, Erdös L, Henheik SJ. Out-of-time-ordered correlators for Wigner matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2024;28(6):2025-2083. doi:<a href=\"https://doi.org/10.4310/ATMP.241031013250\">10.4310/ATMP.241031013250</a>"},"publisher":"International Press","issue":"6","publication_identifier":{"eissn":["1095-0753"],"issn":["1095-0761"]},"article_processing_charge":"No","date_created":"2024-12-15T23:01:51Z","external_id":{"arxiv":["2402.17609"]},"related_material":{"record":[{"id":"19540","relation":"dissertation_contains","status":"public"}]},"oa_version":"Preprint","abstract":[{"text":"We consider the time evolution of the out-of-time-ordered correlator (OTOC) of two general observables \r\n and \r\n in a mean field chaotic quantum system described by a random Wigner matrix as its Hamiltonian. We rigorously identify three time regimes separated by the physically relevant scrambling and relaxation times. The main feature of our analysis is that we express the error terms in the optimal Schatten (tracial) norms of the observables, allowing us to track the exact dependence of the errors on their rank. In particular, for significantly overlapping observables with low rank the OTOC is shown to exhibit a significant local maximum at the scrambling time, a feature that may not have been noticed in the physics literature before. Our main tool is a novel multi-resolvent local law with Schatten norms that unifies and improves previous local laws involving either the much cruder operator norm (cf. [10]) or the Hilbert-Schmidt norm (cf. [11]).","lang":"eng"}],"ec_funded":1,"page":"2025-2083","volume":28,"project":[{"grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"year":"2024","OA_type":"green","date_updated":"2026-04-07T12:37:10Z","publication_status":"published","month":"10","author":[{"last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","first_name":"Giorgio","full_name":"Cipolloni, Giorgio"},{"first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik","full_name":"Henheik, Sven Joscha","first_name":"Sven Joscha","orcid":"0000-0003-1106-327X"}],"_id":"18656","publication":"Advances in Theoretical and Mathematical Physics","language":[{"iso":"eng"}],"article_type":"original","title":"Out-of-time-ordered correlators for Wigner matrices","status":"public","scopus_import":"1"},{"article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1096-0783"],"issn":["0022-1236"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on Eigenvector Overlaps for Non-Hermitian Random Matrices.” <i>Journal of Functional Analysis</i>, vol. 287, no. 4, 110495, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.jfa.2024.110495\">10.1016/j.jfa.2024.110495</a>.","ista":"Cipolloni G, Erdös L, Henheik SJ, Schröder DJ. 2024. Optimal lower bound on eigenvector overlaps for non-Hermitian random matrices. Journal of Functional Analysis. 287(4), 110495.","ieee":"G. Cipolloni, L. Erdös, S. J. Henheik, and D. J. Schröder, “Optimal lower bound on eigenvector overlaps for non-Hermitian random matrices,” <i>Journal of Functional Analysis</i>, vol. 287, no. 4. Elsevier, 2024.","apa":"Cipolloni, G., Erdös, L., Henheik, S. J., &#38; Schröder, D. J. (2024). Optimal lower bound on eigenvector overlaps for non-Hermitian random matrices. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2024.110495\">https://doi.org/10.1016/j.jfa.2024.110495</a>","chicago":"Cipolloni, Giorgio, László Erdös, Sven Joscha Henheik, and Dominik J Schröder. “Optimal Lower Bound on Eigenvector Overlaps for Non-Hermitian Random Matrices.” <i>Journal of Functional Analysis</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jfa.2024.110495\">https://doi.org/10.1016/j.jfa.2024.110495</a>.","ama":"Cipolloni G, Erdös L, Henheik SJ, Schröder DJ. Optimal lower bound on eigenvector overlaps for non-Hermitian random matrices. <i>Journal of Functional Analysis</i>. 2024;287(4). doi:<a href=\"https://doi.org/10.1016/j.jfa.2024.110495\">10.1016/j.jfa.2024.110495</a>","short":"G. Cipolloni, L. Erdös, S.J. Henheik, D.J. Schröder, Journal of Functional Analysis 287 (2024)."},"department":[{"_id":"LaEr"}],"issue":"4","publisher":"Elsevier","intvolume":"       287","OA_place":"publisher","date_published":"2024-08-15T00:00:00Z","quality_controlled":"1","day":"15","doi":"10.1016/j.jfa.2024.110495","oa":1,"file_date_updated":"2025-06-24T13:14:21Z","type":"journal_article","corr_author":"1","article_number":"110495","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","acknowledgement":"Supported by ERC Advanced Grant “RMTBeyond” No. 101020331.\r\nSupported by the SNSF Ambizione Grant PZ00P2_209089.","title":"Optimal lower bound on eigenvector overlaps for non-Hermitian random matrices","file":[{"file_size":1374854,"checksum":"07d3f73e0c56e68eb110851842c22ee0","success":1,"date_created":"2025-06-24T13:14:21Z","date_updated":"2025-06-24T13:14:21Z","file_id":"19891","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2025_JourFunctionalAnalysis_Cipolloni.pdf"}],"status":"public","scopus_import":"1","article_type":"original","language":[{"iso":"eng"}],"publication":"Journal of Functional Analysis","_id":"17049","author":[{"full_name":"Cipolloni, Giorgio","first_name":"Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni"},{"first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"last_name":"Henheik","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","orcid":"0000-0003-1106-327X","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha"},{"first_name":"Dominik J","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder"}],"month":"08","date_updated":"2026-04-07T12:37:11Z","publication_status":"published","OA_type":"hybrid","ddc":["510"],"project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","grant_number":"101020331"}],"volume":287,"isi":1,"year":"2024","ec_funded":1,"abstract":[{"text":"We consider large non-Hermitian NxN matrices with an additive independent, identically distributed (i.i.d.) noise for each matrix elements. We show that already a small noise of variance 1/N completely thermalises the bulk singular vectors, in particular they satisfy the strong form of Quantum Unique Ergodicity (QUE) with an optimal speed of convergence. In physics terms, we thus extend the Eigenstate Thermalisation Hypothesis, formulated originally by Deutsch [34] and proven for Wigner matrices in [23], to arbitrary non-Hermitian matrices with an i.i.d. noise. As a consequence we obtain an optimal lower bound on the diagonal overlaps of the corresponding non-Hermitian eigenvectors. This quantity, also known as the (square of the) eigenvalue condition number measuring the sensitivity of the eigenvalue to small perturbations, has notoriously escaped rigorous treatment beyond the explicitly computable Ginibre ensemble apart from the very recent upper bounds given in [7] and [45]. As a key tool, we develop a new systematic decomposition of general observables in random matrix theory that governs the size of products of resolvents with deterministic matrices in between.","lang":"eng"}],"oa_version":"Published Version","external_id":{"isi":["001325502400001"]},"date_created":"2024-05-26T22:00:57Z","related_material":{"record":[{"status":"public","id":"19540","relation":"dissertation_contains"}]}},{"oa_version":"Preprint","date_created":"2025-04-11T08:19:22Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19540"}]},"external_id":{"arxiv":["2309.05488"]},"project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","grant_number":"101020331"}],"year":"2024","ec_funded":1,"abstract":[{"text":"We prove the Eigenstate Thermalisation Hypothesis for Wigner matrices\r\nuniformly in the entire spectrum, in particular near the spectral edges, with a\r\nbound on the fluctuation that is optimal for any observable. This complements\r\nearlier works of Cipolloni et. al. (Comm. Math. Phys. 388, 2021; Forum Math.,\r\nSigma 10, 2022) and Benigni et. al. (Comm. Math. Phys. 391, 2022; arXiv:\r\n2303.11142) that were restricted either to the bulk of the spectrum or to\r\nspecial observables. As a main ingredient, we prove a new multi-resolvent local\r\nlaw that optimally accounts for the edge scaling.","lang":"eng"}],"author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","first_name":"Giorgio","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio"},{"full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"last_name":"Henheik","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","full_name":"Henheik, Sven Joscha","orcid":"0000-0003-1106-327X","first_name":"Sven Joscha"}],"month":"12","date_updated":"2026-04-07T12:37:11Z","publication_status":"draft","title":"Eigenstate thermalisation at the edge for Wigner matrices","status":"public","language":[{"iso":"eng"}],"publication":"arXiv","_id":"19545","corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"Supported by ERC Advanced Grant “RMTBeyond” No. 101020331.","doi":"10.48550/arXiv.2309.05488","oa":1,"type":"preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2309.05488","open_access":"1"}],"OA_place":"repository","date_published":"2024-12-17T00:00:00Z","day":"17","arxiv":1,"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"LaEr"}],"citation":{"mla":"Cipolloni, Giorgio, et al. “Eigenstate Thermalisation at the Edge for Wigner Matrices.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.05488\">10.48550/arXiv.2309.05488</a>.","chicago":"Cipolloni, Giorgio, László Erdös, and Sven Joscha Henheik. “Eigenstate Thermalisation at the Edge for Wigner Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.05488\">https://doi.org/10.48550/arXiv.2309.05488</a>.","apa":"Cipolloni, G., Erdös, L., &#38; Henheik, S. J. (n.d.). Eigenstate thermalisation at the edge for Wigner matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.05488\">https://doi.org/10.48550/arXiv.2309.05488</a>","ieee":"G. Cipolloni, L. Erdös, and S. J. Henheik, “Eigenstate thermalisation at the edge for Wigner matrices,” <i>arXiv</i>. .","ista":"Cipolloni G, Erdös L, Henheik SJ. Eigenstate thermalisation at the edge for Wigner matrices. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2309.05488\">10.48550/arXiv.2309.05488</a>.","ama":"Cipolloni G, Erdös L, Henheik SJ. Eigenstate thermalisation at the edge for Wigner matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.05488\">10.48550/arXiv.2309.05488</a>","short":"G. Cipolloni, L. Erdös, S.J. Henheik, ArXiv (n.d.)."}},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2410.10809","open_access":"1"}],"abstract":[{"lang":"eng","text":"We introduce a notion of a \\emph{local gap} for interacting many-body quantum lattice systems and prove the validity of response theory and Kubo's formula for localized perturbations in such settings.\r\nOn a high level, our result shows that the usual spectral gap condition, concerning the system as a whole, is not a necessary condition for understanding local properties of the system.\r\nMore precisely, we say that an equilibrium state ρ0 of a Hamiltonian H0 is locally gapped in Λgap⊂Λ, whenever the Liouvillian −i[H0,⋅] is almost invertible on local observables supported in Λgap when tested in ρ0.\r\nTo put this into context, we provide other alternative notions of a local gap and discuss their relations.\r\nThe validity of response theory is based on the construction of \\emph{non-equilibrium almost stationary states} (NEASSs).\r\nBy controlling locality properties of the NEASS construction, we show that response theory holds to any order, whenever the perturbation \\(\\epsilon V\\) acts in a region which is further than |logϵ| away from the non-gapped region Λ∖Λgap."}],"type":"preprint","oa":1,"year":"2024","doi":"10.48550/arXiv.2410.10809","date_created":"2025-04-11T11:54:56Z","external_id":{"arxiv":["2410.10809"]},"related_material":{"record":[{"relation":"dissertation_contains","id":"19540","status":"public"}]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Preprint","corr_author":"1","_id":"19551","citation":{"ista":"Henheik SJ, Wessel T. Response theory for locally gapped systems. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2410.10809\">10.48550/arXiv.2410.10809</a>.","ieee":"S. J. Henheik and T. Wessel, “Response theory for locally gapped systems,” <i>arXiv</i>. .","chicago":"Henheik, Sven Joscha, and Tom Wessel. “Response Theory for Locally Gapped Systems.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2410.10809\">https://doi.org/10.48550/arXiv.2410.10809</a>.","apa":"Henheik, S. J., &#38; Wessel, T. (n.d.). Response theory for locally gapped systems. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2410.10809\">https://doi.org/10.48550/arXiv.2410.10809</a>","mla":"Henheik, Sven Joscha, and Tom Wessel. “Response Theory for Locally Gapped Systems.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2410.10809\">10.48550/arXiv.2410.10809</a>.","short":"S.J. Henheik, T. Wessel, ArXiv (n.d.).","ama":"Henheik SJ, Wessel T. Response theory for locally gapped systems. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2410.10809\">10.48550/arXiv.2410.10809</a>"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"publication":"arXiv","article_processing_charge":"No","status":"public","title":"Response theory for locally gapped systems","arxiv":1,"day":"14","publication_status":"draft","date_updated":"2026-04-07T12:37:11Z","date_published":"2024-10-14T00:00:00Z","month":"10","author":[{"last_name":"Henheik","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","orcid":"0000-0003-1106-327X","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha"},{"first_name":"Tom","full_name":"Wessel, Tom","last_name":"Wessel"}],"OA_place":"repository"},{"doi":"10.48550/arXiv.2409.17297","year":"2024","oa":1,"type":"preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2409.17297"}],"abstract":[{"text":"We introduce a multi-band BCS free energy functional and prove that for a\r\nmulti-band superconductor the effect of inter-band coupling can only increase\r\nthe critical temperature, irrespective of its attractive or repulsive nature\r\nand its strength. Further, for weak coupling and weaker inter-band coupling, we\r\nprove that the dependence of the increase in critical temperature on the\r\ninter-band coupling is (1) linear, if there are two or more equally strongly\r\nsuperconducting bands, or (2) quadratic, if there is only one dominating band.","lang":"eng"}],"oa_version":"Preprint","corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"arxiv":["2409.17297"]},"related_material":{"record":[{"id":"19540","relation":"dissertation_contains","status":"public"}]},"date_created":"2025-04-11T11:43:58Z","status":"public","article_processing_charge":"No","title":"Multi-band superconductors have enhanced critical temperatures","language":[{"iso":"eng"}],"publication":"arXiv","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"19550","citation":{"ama":"Henheik SJ, Langmann E, Lauritsen AB. Multi-band superconductors have enhanced critical temperatures. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2409.17297\">10.48550/arXiv.2409.17297</a>","short":"S.J. Henheik, E. Langmann, A.B. Lauritsen, ArXiv (n.d.).","mla":"Henheik, Sven Joscha, et al. “Multi-Band Superconductors Have Enhanced Critical Temperatures.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2409.17297\">10.48550/arXiv.2409.17297</a>.","ista":"Henheik SJ, Langmann E, Lauritsen AB. Multi-band superconductors have enhanced critical temperatures. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2409.17297\">10.48550/arXiv.2409.17297</a>.","ieee":"S. J. Henheik, E. Langmann, and A. B. Lauritsen, “Multi-band superconductors have enhanced critical temperatures,” <i>arXiv</i>. .","chicago":"Henheik, Sven Joscha, Edwin Langmann, and Asbjørn Bækgaard Lauritsen. “Multi-Band Superconductors Have Enhanced Critical Temperatures.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2409.17297\">https://doi.org/10.48550/arXiv.2409.17297</a>.","apa":"Henheik, S. J., Langmann, E., &#38; Lauritsen, A. B. (n.d.). Multi-band superconductors have enhanced critical temperatures. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2409.17297\">https://doi.org/10.48550/arXiv.2409.17297</a>"},"department":[{"_id":"LaEr"},{"_id":"RoSe"}],"author":[{"full_name":"Henheik, Sven Joscha","first_name":"Sven Joscha","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik"},{"last_name":"Langmann","full_name":"Langmann, Edwin","first_name":"Edwin"},{"id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","last_name":"Lauritsen","first_name":"Asbjørn Bækgaard","orcid":"0000-0003-4476-2288","full_name":"Lauritsen, Asbjørn Bækgaard"}],"month":"10","OA_place":"repository","date_published":"2024-10-21T00:00:00Z","publication_status":"draft","date_updated":"2026-04-07T12:37:11Z","arxiv":1,"day":"21"},{"doi":"10.48550/arXiv.2410.06813","oa":1,"type":"preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.06813"}],"corr_author":"1","acknowledgement":"Supported by the ERC Advanced Grant \"RMTBeyond\"\r\nNo. 101020331.","article_processing_charge":"No","department":[{"_id":"LaEr"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ama":"Erdös L, Henheik SJ, Riabov V. Cusp universality for correlated random matrices. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2410.06813\">10.48550/arXiv.2410.06813</a>","short":"L. Erdös, S.J. Henheik, V. Riabov, ArXiv (n.d.).","mla":"Erdös, László, et al. “Cusp Universality for Correlated Random Matrices.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2410.06813\">10.48550/arXiv.2410.06813</a>.","ista":"Erdös L, Henheik SJ, Riabov V. Cusp universality for correlated random matrices. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2410.06813\">10.48550/arXiv.2410.06813</a>.","ieee":"L. Erdös, S. J. Henheik, and V. Riabov, “Cusp universality for correlated random matrices,” <i>arXiv</i>. .","chicago":"Erdös, László, Sven Joscha Henheik, and Volodymyr Riabov. “Cusp Universality for Correlated Random Matrices.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2410.06813\">https://doi.org/10.48550/arXiv.2410.06813</a>.","apa":"Erdös, L., Henheik, S. J., &#38; Riabov, V. (n.d.). Cusp universality for correlated random matrices. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2410.06813\">https://doi.org/10.48550/arXiv.2410.06813</a>"},"OA_place":"repository","date_published":"2024-11-03T00:00:00Z","arxiv":1,"day":"03","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020","grant_number":"101020331"}],"year":"2024","ec_funded":1,"abstract":[{"text":"For correlated real symmetric or complex Hermitian random matrices, we prove\r\nthat the local eigenvalue statistics at any cusp singularity are universal.\r\nSince the density of states typically exhibits only square root edge or cubic\r\nroot cusp singularities, our result completes the proof of the\r\nWigner-Dyson-Mehta universality conjecture in all spectral regimes for a very\r\ngeneral class of random matrices. Previously only the bulk and the edge\r\nuniversality were established in this generality [arXiv:1804.07744], while cusp\r\nuniversality was proven only for Wigner-type matrices with independent entries\r\n[arXiv:1809.03971, arXiv:1811.04055]. As our main technical input, we prove an\r\noptimal local law at the cusp using the Zigzag strategy, a recursive tandem of\r\nthe characteristic flow method and a Green function comparison argument.\r\nMoreover, our proof of the optimal local law holds uniformly in the spectrum,\r\nthus also re-establishing universality of the local eigenvalue statistics in\r\nthe previously studied bulk [arXiv:1705.10661] and edge [arXiv:1804.07744]\r\nregimes.","lang":"eng"}],"oa_version":"Preprint","related_material":{"record":[{"status":"public","relation":"later_version","id":"20322"},{"status":"public","relation":"dissertation_contains","id":"20575"},{"status":"public","relation":"dissertation_contains","id":"19540"}]},"date_created":"2025-04-11T08:48:21Z","external_id":{"arxiv":["2410.06813"]},"title":"Cusp universality for correlated random matrices","status":"public","language":[{"iso":"eng"}],"publication":"arXiv","_id":"19547","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henheik","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","orcid":"0000-0003-1106-327X","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha"},{"id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","last_name":"Riabov","full_name":"Riabov, Volodymyr","first_name":"Volodymyr"}],"month":"11","date_updated":"2026-04-07T12:37:11Z","publication_status":"draft"},{"doi":"10.15479/at:ista:18588","oa":1,"file_date_updated":"2024-12-13T11:30:53Z","type":"dissertation","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"corr_author":"1","has_accepted_license":"1","acknowledgement":"I would like to acknowledge Scott Waitukaitis and Jérémie Palacci, for their supervision, and their extensive support of my learning. \r\n\r\nFor the beautiful characterization images used in this work, I would like to thank Dr. Daniel Grober, Samuel Hajek and Felix Pertl.\r\n\r\nThe Palacci group, particularly Malina Strugaru and Dan Grober, for their continuous guidance in decoding and following my streams of thought.\r\n\r\nTo the Waitukaitis group, for helping me find my footing in science, and making me feel at\r\nhome.\r\n\r\nTo the Nanofabrication Facility (NFF) at ISTA, for training me in significant aspects of my research. The MIBA Facility, and particularly Todor Asenov for consistently picking up the phone for my machining and designing needs.\r\n\r\nTo my friends, Mariana, Lenka, Aaron, Rebecca, Eavan who provided an ear, wine, and a lot more when I needed to vent, talk through my crises as well as experiment. For the walks, for the coffees, for reading through my work and providing edits, for dinners to take me out of blocks and binds and for cheering me on when it felt insurmountable. \r\n\r\nFinally, I am grateful to Griff and Fletcher, whose music helped me through several blocks, especially with my writing.\r\n\r\nMy science would not have been possible without the guidance, support and contributions of\r\nall these people, and more.","supervisor":[{"full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jérémie A","orcid":"0000-0002-7253-9465","full_name":"Palacci, Jérémie A","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","last_name":"Palacci"}],"article_processing_charge":"No","publication_identifier":{"issn":["2791-4585"]},"degree_awarded":"MS","alternative_title":["ISTA Master's Thesis"],"citation":{"ama":"Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing across scales. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>","short":"C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales, Institute of Science and Technology Austria, 2024.","mla":"Mweka, Cecelia N. <i>Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>.","chicago":"Mweka, Cecelia N. “Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>.","apa":"Mweka, C. N. (2024). <i>Non equilibrium dynamics of driven individual particles and 3D printing across scales</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>","ieee":"C. N. Mweka, “Non equilibrium dynamics of driven individual particles and 3D printing across scales,” Institute of Science and Technology Austria, 2024.","ista":"Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria."},"department":[{"_id":"GradSch"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Institute of Science and Technology Austria","OA_place":"publisher","date_published":"2024-11-29T00:00:00Z","day":"29","year":"2024","page":"61","abstract":[{"text":"This thesis is an experimental work about two distinct research projects that evolved from a single project: non-equilibrium dynamics of an acoustically vibrated particle and microfabrication of particles with nano-scale 3D printing. The first project explores non equilibrium dynamics of a particle driven by ultrasonic vibrations. We design an experimental system consisting of an electromechanical vibration scheme to drive the particle’s vibrations and an imaging scheme to track its trajectories. We study the trajectories to determine how the particle’s dynamics evolve under the driven conditions, considering out of equilibrium systems in the context of equilibrium statistical mechanics. Using a Langevin framework and the Boltzmann factor, we characterize the particle’s dynamics as complex; the particle motion\r\nis not purely diffusive. We extract physical parameters like spring constant, effective temperature, damping coefficient and resonance frequency.\r\n\r\nIn the second project, we explore and develop techniques in the design and microfabrication of particles across scales. Microfabrication involves building structures at the micron or submicron scale. These designed miniaturized patterns, objects, or devices are useful in biophysics, pharmacology, medical biology, and nanotechnology. We specifically apply two-photon polymerization, a form of 3D nano printing. We print millimetric particles, characterizing different designs to evaluate and showcase the resolution, aspect ratio integrity and print quality of the printing process. We also design and fabricate a microsensor to deflect under applicable force of order 0.1 pN. We present fundamental concepts needed to design the microsensor, showcasing 3D printing at considerably smaller scales down to the µm or below.","lang":"eng"}],"oa_version":"Published Version","date_created":"2024-11-27T09:12:02Z","title":"Non equilibrium dynamics of driven individual particles and 3D printing across scales","status":"public","file":[{"file_id":"18597","creator":"cmweka","file_name":"Cecelia Mweka Master Thesis.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_size":3836671,"checksum":"054ed7a5e5ae6e7220e6bb37ea57a3c3","date_updated":"2024-11-28T12:50:32Z","success":1,"date_created":"2024-11-28T12:50:32Z"},{"creator":"cmweka","file_id":"18598","file_name":"Cecelia Mweka Master Thesis.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","relation":"source_file","file_size":7068210,"checksum":"7d7d9299f090d83e628d65d93116e8c2","date_updated":"2024-12-13T11:30:53Z","date_created":"2024-11-28T12:51:43Z"}],"language":[{"iso":"eng"}],"_id":"18588","month":"11","author":[{"first_name":"Cecelia N","full_name":"Mweka, Cecelia N","last_name":"Mweka","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21"}],"date_updated":"2026-04-07T12:42:13Z","publication_status":"published","ddc":["530"]},{"file_date_updated":"2024-07-11T10:26:22Z","type":"dissertation","doi":"10.15479/at:ista:17225","oa":1,"tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","has_accepted_license":"1","corr_author":"1","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"citation":{"apa":"Li, V. (2024). <i>Towards a quantum entanglement enhanced atom interferomter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17225\">https://doi.org/10.15479/at:ista:17225</a>","ieee":"V. Li, “Towards a quantum entanglement enhanced atom interferomter,” Institute of Science and Technology Austria, 2024.","chicago":"Li, Vyacheslav. “Towards a Quantum Entanglement Enhanced Atom Interferomter.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17225\">https://doi.org/10.15479/at:ista:17225</a>.","ista":"Li V. 2024. Towards a quantum entanglement enhanced atom interferomter. Institute of Science and Technology Austria.","mla":"Li, Vyacheslav. <i>Towards a Quantum Entanglement Enhanced Atom Interferomter</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17225\">10.15479/at:ista:17225</a>.","short":"V. Li, Towards a Quantum Entanglement Enhanced Atom Interferomter, Institute of Science and Technology Austria, 2024.","ama":"Li V. Towards a quantum entanglement enhanced atom interferomter. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17225\">10.15479/at:ista:17225</a>"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","supervisor":[{"last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Hosten, Onur","orcid":"0000-0002-2031-204X","first_name":"Onur"}],"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"day":"11","OA_place":"publisher","date_published":"2024-07-11T00:00:00Z","page":"79","abstract":[{"text":"This thesis describes the development of an atom interferometer designed to exploit the\r\nadvantages of utilizing quantum entanglement for enhanced precision measurements beyond\r\nthe standard quantum limit. While the project remains ongoing, significant progress has been\r\nmade.\r\nA key contribution of this work is the development of Quantrol, an experimental control\r\nsystem leveraging the ARTIQ framework. This software enables precise timing and control\r\nwithout requiring prior knowledge of ARTIQ’s implementation details or coding experience.\r\nThe interface offers user friendly visual comprehension of the experimental sequence and\r\nextended capabilities, allowing researchers to scan variables with a simple click of a mouse.\r\nThe main proposed project is to implement atom interferometric sequence with squeezed input\r\nstates inside of a dipole trap generated by a high finesse cavity. The presence of the dipole\r\ntrap allows one dimensional atomic cloud split while maintaining relatively strong confinement\r\nin other directions.\r\nWe are currently able to trap and cool 87Rb atoms to few micro kelvin temperatures, load\r\nthem into the dipole trap and state prepare them to be used for squeezing and interferometric\r\nsequence.","lang":"eng"}],"project":[{"grant_number":"101087907","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics"}],"year":"2024","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"11438"}]},"date_created":"2024-07-11T09:46:48Z","oa_version":"Published Version","language":[{"iso":"eng"}],"_id":"17225","title":"Towards a quantum entanglement enhanced atom interferomter","status":"public","file":[{"file_name":"PhD_Thesis_Vyacheslav_Li_no_signatures_PDFA.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"vli","file_id":"17228","date_updated":"2024-07-11T10:26:22Z","success":1,"date_created":"2024-07-11T10:26:22Z","checksum":"15b2dbe8d2c9ed7ca5dd413827928077","file_size":6729761},{"date_updated":"2024-07-11T10:26:22Z","date_created":"2024-07-11T10:26:22Z","checksum":"16e904a11d8d0ebb167cb654ddfc7fe5","file_size":9542859,"file_name":"PhD Thesis Vyacheslav Li.zip","relation":"source_file","content_type":"application/x-zip-compressed","access_level":"closed","file_id":"17229","creator":"vli"}],"date_updated":"2026-04-07T12:42:28Z","publication_status":"published","ddc":["530"],"month":"07","author":[{"id":"3A4FAA92-F248-11E8-B48F-1D18A9856A87","last_name":"Li","first_name":"Vyacheslav","full_name":"Li, Vyacheslav"}]},{"file_date_updated":"2024-10-24T08:09:13Z","type":"dissertation","oa":1,"doi":"10.15479/at:ista:18443","has_accepted_license":"1","keyword":["hyperkaehler geometry","branes","mirror symmetry","T-duality"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"GradSch"},{"_id":"TaHa"}],"citation":{"short":"M.A. Sisak, T-Dual Branes on Hyperkähler Manifolds, Institute of Science and Technology Austria, 2024.","ama":"Sisak MA. T-dual branes on hyperkähler manifolds. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18443\">10.15479/at:ista:18443</a>","ista":"Sisak MA. 2024. T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria.","apa":"Sisak, M. A. (2024). <i>T-dual branes on hyperkähler manifolds</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18443\">https://doi.org/10.15479/at:ista:18443</a>","chicago":"Sisak, Maria A. “T-Dual Branes on Hyperkähler Manifolds.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18443\">https://doi.org/10.15479/at:ista:18443</a>.","ieee":"M. A. Sisak, “T-dual branes on hyperkähler manifolds,” Institute of Science and Technology Austria, 2024.","mla":"Sisak, Maria A. <i>T-Dual Branes on Hyperkähler Manifolds</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18443\">10.15479/at:ista:18443</a>."},"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","supervisor":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel","first_name":"Tamás","orcid":"0000-0002-9582-2634","full_name":"Hausel, Tamás"}],"day":"24","date_published":"2024-10-24T00:00:00Z","OA_place":"publisher","abstract":[{"text":"In [KW06] Kapustin and Witten conjectured that there is a mirror symmetry relation between\r\nthe hyperkähler structures on certain Higgs bundle moduli spaces. As a consequence, they\r\nconjecture an equivalence between categories of BBB and BAA-branes. At the classical\r\nlevel, this mirror symmetry is given by T-duality between semi-flat hyperkähler structures on\r\nalgebraic integrable systems.\r\nIn this thesis, we investigate the T-duality relation between hyperkähler structures and the\r\ncorresponding branes on affine torus bundles. We use the techniques of generalized geometry\r\nto show that semi-flat hyperkähler structures are T-dual on algebraic integrable systems.\r\nWe also describe T-duality for generalized branes. Motivated by Fourier-Mukai transform\r\nwe upgrade the T-duality between generalized branes to T-duality of submanifolds endowed\r\nwith U(1)-bundles and connections. This T-duality in the appropriate context specializes to\r\nT-duality between BBB and BAA-branes.\r\n","lang":"eng"}],"page":"178","project":[{"_id":"6286e8c4-2b32-11ec-9570-f5297902f67f","name":"Branes on hyperkähler manifolds","grant_number":"26069"}],"year":"2024","date_created":"2024-10-19T12:00:37Z","oa_version":"Published Version","_id":"18443","language":[{"iso":"eng"}],"title":"T-dual branes on hyperkähler manifolds","file":[{"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"MASisak_dissertation.pdf","creator":"msisak","file_id":"18467","success":1,"date_created":"2024-10-23T14:42:45Z","date_updated":"2024-10-23T14:42:45Z","file_size":1672547,"checksum":"8c4893e726aaa4b3efb82758da9b6851"},{"date_updated":"2024-10-24T08:09:13Z","date_created":"2024-10-23T14:43:56Z","checksum":"1831b072e861a1e5481024ca9d02b036","file_size":617913,"file_name":"MASisak_source.zip","relation":"source_file","content_type":"application/x-zip-compressed","access_level":"closed","file_id":"18468","creator":"msisak"}],"status":"public","OA_type":"free access","ddc":["516"],"date_updated":"2026-04-07T12:42:44Z","publication_status":"published","month":"10","author":[{"last_name":"Sisak","id":"44A03D04-AEA4-11E9-B225-EA2DE6697425","full_name":"Sisak, Maria A","first_name":"Maria A"}]},{"related_material":{"record":[{"status":"public","id":"18062","relation":"part_of_dissertation"},{"id":"18061","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"17378","status":"public"},{"relation":"part_of_dissertation","id":"17087","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"14458"}]},"date_created":"2024-09-02T11:01:48Z","oa_version":"Published Version","ec_funded":1,"abstract":[{"lang":"eng","text":"Large language models (LLMs) have made tremendous progress in the past few years, from being able to generate coherent text to matching or surpassing humans in a wide variety of creative, knowledge or reasoning tasks. Much of this can be attributed to massively increased scale, both in the size of the model as well as the amount of training data, from 100s of millions to 100s of billions, or even trillions. This trend is expected to continue, which, although exciting, also raises major practical concerns. Already today's 100+ billion parameter LLMs require top-of-the-line hardware just to run. Hence, it is clear that sustaining these developments will require significant efficiency advances.\r\n\r\nHistorically, one of the most practical ways of improving model efficiency has been compression, especially in the form of sparsity or quantization. While this has been studied extensively in the past, existing accurate methods are all designed for models around 100 million parameters; scaling them up to ones literally 1000x larger is highly challenging. In this thesis, we introduce a new unified sparsification and quantization approach OBC, which through additional algorithmic enhancements leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity, respectively. Additionally, we show how weight-only quantizion does not just bring space savings but also up to 4.5x faster generation speed, via custom GPU kernels.\r\n\r\nIn fact, we show for the first time that it is possible to develop an FP16 times INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes close to simultaneously maximizing both memory and compute utilization, making weight-only quantization highly practical even for multi-user serving. Further, we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter models, where extreme sub-1-bit compression rates can be achieved without any inference slow-down, by co-designing a bespoke entropy coding scheme together with an efficient kernel.\r\n\r\nFinally, we also study compression from the perspective of someone with access to massive amounts of compute resources for training large models completely from scratch. Here the key questions evolve around the joint scaling behavior between compression, model size, and amount of training data used. Based on extensive experimental results for both vision and text models, we introduce the first scaling law which accurately captures the relationship between weight-sparsity, number of non-zero weights and data. This further allows us to characterize the optimal sparsity, which we find to increase the longer a fixed cost model is being trained.\r\n\r\nOverall, this thesis presents contributions to three different angles of large model efficiency: affordable but accurate algorithms, highly efficient systems implementations, and fundamental scaling laws for compressed training."}],"page":"129","year":"2024","project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"ddc":["000"],"publication_status":"published","date_updated":"2026-04-07T12:43:04Z","month":"09","author":[{"full_name":"Frantar, Elias","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar"}],"_id":"17485","language":[{"iso":"eng"}],"file":[{"file_id":"17570","creator":"efrantar","file_name":"thesis-final.zip","relation":"source_file","access_level":"closed","content_type":"application/zip","checksum":"5d785645805a78c5b4ce7cc3df557b09","file_size":1615167,"date_updated":"2024-09-05T12:04:11Z","date_created":"2024-09-05T12:04:11Z"},{"checksum":"a9dd1c2d23734986924eb44ebb55fd8f","file_size":2376611,"success":1,"date_created":"2024-09-06T16:24:59Z","date_updated":"2024-09-06T16:24:59Z","creator":"efrantar","file_id":"17880","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"frantar_thesis_final.pdf"}],"status":"public","title":"Compressing large neural networks : Algorithms, systems and scaling laws","has_accepted_license":"1","corr_author":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"type":"dissertation","file_date_updated":"2024-09-06T16:24:59Z","oa":1,"doi":"10.15479/at:ista:17485","day":"05","date_published":"2024-09-05T00:00:00Z","OA_place":"publisher","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"citation":{"ama":"Frantar E. Compressing large neural networks : Algorithms, systems and scaling laws. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>","short":"E. Frantar, Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws, Institute of Science and Technology Austria, 2024.","mla":"Frantar, Elias. <i>Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>.","ieee":"E. Frantar, “Compressing large neural networks : Algorithms, systems and scaling laws,” Institute of Science and Technology Austria, 2024.","chicago":"Frantar, Elias. “Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>.","apa":"Frantar, E. (2024). <i>Compressing large neural networks : Algorithms, systems and scaling laws</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>","ista":"Frantar E. 2024. Compressing large neural networks : Algorithms, systems and scaling laws. Institute of Science and Technology Austria."},"degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"article_processing_charge":"No"},{"publication_status":"published","quality_controlled":"1","editor":[{"last_name":"Gibbons","full_name":"Gibbons, P.","first_name":"P."},{"last_name":"Pekhimenko","full_name":"Pekhimenko, G.","first_name":"G."},{"last_name":"De Sa","full_name":"De Sa, C.","first_name":"C."}],"date_updated":"2026-04-07T12:43:03Z","day":"01","author":[{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar","full_name":"Frantar, Elias","first_name":"Elias"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"month":"05","intvolume":"         6","date_published":"2024-05-01T00:00:00Z","language":[{"iso":"eng"}],"publication":" Proceedings of Machine Learning and Systems","citation":{"short":"E. Frantar, D.-A. Alistarh, in:, P. Gibbons, G. Pekhimenko, C. De Sa (Eds.),  Proceedings of Machine Learning and Systems, 2024.","ama":"Frantar E, Alistarh D-A. QMoE: Sub-1-bit compression of trillion parameter models. In: Gibbons P, Pekhimenko G, De Sa C, eds. <i> Proceedings of Machine Learning and Systems</i>. Vol 6. ; 2024.","ista":"Frantar E, Alistarh D-A. 2024. QMoE: Sub-1-bit compression of trillion parameter models.  Proceedings of Machine Learning and Systems. MLSys: Machine Learning and Systems vol. 6.","ieee":"E. Frantar and D.-A. Alistarh, “QMoE: Sub-1-bit compression of trillion parameter models,” in <i> Proceedings of Machine Learning and Systems</i>, Santa Clara, CA, USA, 2024, vol. 6.","apa":"Frantar, E., &#38; Alistarh, D.-A. (2024). QMoE: Sub-1-bit compression of trillion parameter models. In P. Gibbons, G. Pekhimenko, &#38; C. De Sa (Eds.), <i> Proceedings of Machine Learning and Systems</i> (Vol. 6). Santa Clara, CA, USA.","chicago":"Frantar, Elias, and Dan-Adrian Alistarh. “QMoE: Sub-1-Bit Compression of Trillion Parameter Models.” In <i> Proceedings of Machine Learning and Systems</i>, edited by P. Gibbons, G. Pekhimenko, and C. De Sa, Vol. 6, 2024.","mla":"Frantar, Elias, and Dan-Adrian Alistarh. “QMoE: Sub-1-Bit Compression of Trillion Parameter Models.” <i> Proceedings of Machine Learning and Systems</i>, edited by P. Gibbons et al., vol. 6, 2024."},"_id":"18061","department":[{"_id":"DaAl"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","article_processing_charge":"No","title":"QMoE: Sub-1-bit compression of trillion parameter models","date_created":"2024-09-13T10:01:38Z","related_material":{"record":[{"relation":"dissertation_contains","id":"17485","status":"public"}]},"oa_version":"Published Version","corr_author":"1","type":"conference","main_file_link":[{"open_access":"1","url":"https://proceedings.mlsys.org/paper_files/paper/2024/hash/c74b624843218d9b6713fcf299d6d5e4-Abstract-Conference.html"}],"conference":{"location":"Santa Clara, CA, USA","end_date":"2024-05-16","name":"MLSys: Machine Learning and Systems","start_date":"2024-05-13"},"abstract":[{"text":"Mixture-of-Experts (MoE) architectures offer a general solution to the high inference costs of large language models (LLMs) via sparse routing, bringing faster and more accurate models, at the cost of massive parameter counts. For example, the SwitchTransformer-c2048 model has 1.6 trillion parameters, requiring 3.2TB of accelerator memory to run efficiently, which makes practical deployment challenging and expensive. In this paper, we present a solution to this memory problem, in form of a new compression and execution framework called QMoE. Specifically, QMoE consists of a scalable algorithm which accurately compresses trillion-parameter MoEs to less than 1 bit per parameter, in a custom format co-designed with bespoke GPU decoding kernels to facilitate efficient end-to-end compressed inference, with minor runtime overheads relative to uncompressed execution. Concretely, QMoE can compress the 1.6 trillion parameter SwitchTransformer-c2048 model to less than 160GB (20x compression, 0.8 bits per parameter) at only minor accuracy loss, in less than a day on a single GPU. This enables, for the first time, the execution of a trillion-parameter model on affordable commodity hardware, like a single server with 4x NVIDIA A6000 or 8x NVIDIA 3090 GPUs, at less than 5% runtime overhead relative to ideal uncompressed inference. The anonymized code is available at: github.com/mlsys24-qmoe/qmoe.","lang":"eng"}],"oa":1,"year":"2024","volume":6},{"type":"conference","abstract":[{"lang":"eng","text":"We explore the impact of parameter sparsity on the scaling behavior of Transformers trained on massive datasets (i.e., \"foundation models\"), in both vision and language domains. In this setting, we identify the first scaling law describing the relationship between weight sparsity, number of non-zero parameters, and amount of training data, which we validate empirically across model and data scales; on ViT/JFT-4B and T5/C4. These results allow us to characterize the \"optimal sparsity\", the sparsity level which yields the best performance for a given effective model size and training budget. For a fixed number of non-zero parameters, we identify that the optimal sparsity increases with the amount of data used for training. We also extend our study to different sparsity structures (such as the hardware-friendly n:m pattern) and strategies (such as starting from a pretrained dense model). Our findings shed light on the power and limitations of weight sparsity across various parameter and computational settings, offering both theoretical understanding and practical implications for leveraging sparsity towards computational efficiency improvements. We provide pruning and scaling law fitting code at: github.com/google-research/jaxpruner/tree/main/jaxpruner/projects/bigsparse."}],"conference":{"location":"Vienna, Austria","end_date":"2024-05-07","name":"ICLR: International Conference on Learning Representations","start_date":"2024-05-07"},"main_file_link":[{"url":"https://openreview.net/forum?id=i9K2ZWkYIP","open_access":"1"}],"year":"2024","oa":1,"external_id":{"arxiv":["2309.08520"]},"date_created":"2024-09-13T10:31:08Z","related_material":{"record":[{"status":"public","id":"17485","relation":"dissertation_contains"}]},"corr_author":"1","oa_version":"Published Version","publication":"The Twelfth International Conference on Learning Representations","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"_id":"18062","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Frantar, E., Ruiz, C. R., Houlsby, N., Alistarh, D.-A., &#38; Evci, U. (2024). Scaling laws for sparsely-connected foundation models. In <i>The Twelfth International Conference on Learning Representations</i>. Vienna, Austria.","ieee":"E. Frantar, C. R. Ruiz, N. Houlsby, D.-A. Alistarh, and U. Evci, “Scaling laws for sparsely-connected foundation models,” in <i>The Twelfth International Conference on Learning Representations</i>, Vienna, Austria, 2024.","chicago":"Frantar, Elias, Carlos Riquelme Ruiz, Neil Houlsby, Dan-Adrian Alistarh, and Utku Evci. “Scaling Laws for Sparsely-Connected Foundation Models.” In <i>The Twelfth International Conference on Learning Representations</i>, 2024.","ista":"Frantar E, Ruiz CR, Houlsby N, Alistarh D-A, Evci U. 2024. Scaling laws for sparsely-connected foundation models. The Twelfth International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","mla":"Frantar, Elias, et al. “Scaling Laws for Sparsely-Connected Foundation Models.” <i>The Twelfth International Conference on Learning Representations</i>, 2024.","short":"E. Frantar, C.R. Ruiz, N. Houlsby, D.-A. Alistarh, U. Evci, in:, The Twelfth International Conference on Learning Representations, 2024.","ama":"Frantar E, Ruiz CR, Houlsby N, Alistarh D-A, Evci U. Scaling laws for sparsely-connected foundation models. In: <i>The Twelfth International Conference on Learning Representations</i>. ; 2024."},"title":"Scaling laws for sparsely-connected foundation models","article_processing_charge":"No","scopus_import":"1","status":"public","date_updated":"2026-04-07T12:43:03Z","publication_status":"published","quality_controlled":"1","arxiv":1,"day":"16","month":"01","author":[{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar","first_name":"Elias","full_name":"Frantar, Elias"},{"last_name":"Ruiz","full_name":"Ruiz, Carlos Riquelme","first_name":"Carlos Riquelme"},{"last_name":"Houlsby","first_name":"Neil","full_name":"Houlsby, Neil"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Evci, Utku","first_name":"Utku","last_name":"Evci"}],"date_published":"2024-01-16T00:00:00Z"},{"oa":1,"doi":"10.15479/at:ista:17208","file_date_updated":"2024-07-17T09:23:24Z","type":"dissertation","acknowledged_ssus":[{"_id":"ScienComp"}],"corr_author":"1","has_accepted_license":"1","keyword":["Quantum computing","Variational Quantum Algorithms","Optimization"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","supervisor":[{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","first_name":"Maksym","full_name":"Serbyn, Maksym"}],"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"citation":{"ama":"Medina Ramos RA. Exploring the optimization landscape of variational quantum algorithms. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17208\">10.15479/at:ista:17208</a>","short":"R.A. Medina Ramos, Exploring the Optimization Landscape of Variational Quantum Algorithms, Institute of Science and Technology Austria, 2024.","mla":"Medina Ramos, Raimel A. <i>Exploring the Optimization Landscape of Variational Quantum Algorithms</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17208\">10.15479/at:ista:17208</a>.","chicago":"Medina Ramos, Raimel A. “Exploring the Optimization Landscape of Variational Quantum Algorithms.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17208\">https://doi.org/10.15479/at:ista:17208</a>.","ieee":"R. A. Medina Ramos, “Exploring the optimization landscape of variational quantum algorithms,” Institute of Science and Technology Austria, 2024.","apa":"Medina Ramos, R. A. (2024). <i>Exploring the optimization landscape of variational quantum algorithms</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17208\">https://doi.org/10.15479/at:ista:17208</a>","ista":"Medina Ramos RA. 2024. Exploring the optimization landscape of variational quantum algorithms. Institute of Science and Technology Austria."},"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","date_published":"2024-07-09T00:00:00Z","OA_place":"publisher","day":"09","project":[{"name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899"}],"year":"2024","ec_funded":1,"abstract":[{"text":"Can current quantum computers provide a speedup over their classical counterparts for some kinds of problems? In this thesis, with a focus on ground state search/preparation, we address some of the challenges that both quantum annealing and variational quantum algorithms suffer from, hindering any possible practical speedup in comparison to the best classical counterparts. \r\n\r\nIn the first part of the thesis, we study the performance of quantum annealing for solving a particular combinatorial optimization problem called 3-XOR satisfability (3-XORSAT). The classical problem is mapped into a ground state search of a 3-local classical Hamiltonian $H_C$. We consider how modifying the initial problem, by adding more interaction terms to the corresponding Hamiltonian, leads to the emergence of a first-order phase transition during the annealing process. This phenomenon causes the total annealing duration, $T$, required to prepare the ground state of $H_C$ with a high probability to increase exponentially with the size of the problem. Our findings indicate that with the growing complexity of problem instances, the likelihood of encountering first-order phase transitions also increases, making quantum annealing an impractical solution for these types of combinatorial optimization problems.\r\n\r\nIn the second part, we focus on the problem of barren plateaus in generic variational quantum algorithms. Barren plateaus correspond to flat regions in the parameter space where the gradient of the cost function is zero in expectation, and with the variance decaying exponentially with the system size, thus obstructing an efficient parameter optimization.  We propose an algorithm to circumvent Barren Plateaus by monitoring the entanglement entropy of k-local reduced density matrices, alongside a method for estimating entanglement entropy via classical shadow tomography. We illustrate the approach with the paradigmatic example of the variational quantum eigensolver, and show that our algorithm effectively avoids barren plateaus in the initialization as well as during the optimization stage. \r\n\r\nLastly, in the last two Chapters of this thesis, we focus on the quantum approximate optimization algorithm (QAOA), originally introduced as an algorithm for solving generic combinatorial optimization problems in near-term quantum devices. Specifically, we focus on how to develop rigorous initialization strategies with guarantee improvement. Our motivation for this study lies in that for random initialization, the optimization typically leads to local minima with poor performance. Our main result corresponds to the analytical construction of index-1 saddle points or transition states, stationary points with a single direction of descent, as a tool for systematically exploring the QAOA optimization landscape. This leads us to propose a novel greedy parameter initialization strategy that guarantees for the energy to decrease with an increasing number of circuit layers. Furthermore, with precise estimates for the negative Hessian eigenvalue and its eigenvector, we establish a lower bound for energy improvement following a QAOA iteration.","lang":"eng"}],"page":"133","oa_version":"Published Version","related_material":{"record":[{"id":"10545","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"10067","relation":"part_of_dissertation"},{"status":"public","id":"17222","relation":"part_of_dissertation"},{"status":"public","id":"13125","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"11471","status":"public"}]},"date_created":"2024-07-09T09:14:24Z","title":"Exploring the optimization landscape of variational quantum algorithms","status":"public","file":[{"relation":"source_file","access_level":"closed","content_type":"application/zip","file_name":"Raimel_Thesis-Final.zip","file_id":"17212","creator":"rmedinar","date_created":"2024-07-09T09:21:44Z","date_updated":"2024-07-10T11:34:09Z","checksum":"6f45273d04f4418bc2adc018baed0525","file_size":"14218691"},{"creator":"rmedinar","file_id":"17275","file_name":"Raimel_Thesis-20_pdfa.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":11253627,"checksum":"6724a95bec772dbabc0111b9f08a805e","date_updated":"2024-07-17T09:23:24Z","date_created":"2024-07-17T09:23:24Z","success":1}],"_id":"17208","language":[{"iso":"eng"}],"author":[{"id":"CE680B90-D85A-11E9-B684-C920E6697425","last_name":"Medina Ramos","first_name":"Raimel A","orcid":"0000-0002-5383-2869","full_name":"Medina Ramos, Raimel A"}],"month":"07","ddc":["539"],"date_updated":"2026-04-07T12:43:22Z","publication_status":"published"},{"oa_version":"Preprint","corr_author":"1","related_material":{"record":[{"relation":"dissertation_contains","id":"17208","status":"public"}]},"external_id":{"arxiv":["2405.10125"]},"date_created":"2024-07-10T13:12:09Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"2405.10125","oa":1,"year":"2024","doi":"10.48550/arXiv.2405.10125","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.10125"}],"abstract":[{"text":"The quantum approximate optimization algorithm (QAOA) uses a quantum computer\r\nto implement a variational method with $2p$ layers of alternating unitary\r\noperators, optimized by a classical computer to minimize a cost function. While\r\nrigorous performance guarantees exist for the QAOA at small depths $p$, the\r\nbehavior at large depths remains less clear, though simulations suggest\r\nexponentially fast convergence for certain problems. In this work, we gain\r\ninsights into the deep QAOA using an analytic expansion of the cost function\r\naround transition states. Transition states are constructed in a recursive\r\nmanner: from the local minima of the QAOA with $p$ layers we obtain transition\r\nstates of the QAOA with $p+1$ layers, which are stationary points characterized\r\nby a unique direction of negative curvature. We construct an analytic estimate\r\nof the negative curvature and the corresponding direction in parameter space at\r\neach transition state. The expansion of the QAOA cost function along the\r\nnegative direction to the quartic order gives a lower bound of the QAOA cost\r\nfunction improvement. We provide physical intuition behind the analytic\r\nexpressions for the local curvature and quartic expansion coefficient. Our\r\nnumerical study confirms the accuracy of our approximations and reveals that\r\nthe obtained bound and the true value of the QAOA cost function gain have a\r\ncharacteristic exponential decrease with the number of layers $p$, with the\r\nbound decreasing more rapidly. Our study establishes an analytical method for\r\nrecursively studying the QAOA that is applicable in the regime of high circuit\r\ndepth.","lang":"eng"}],"type":"preprint","date_published":"2024-05-16T00:00:00Z","author":[{"id":"CE680B90-D85A-11E9-B684-C920E6697425","last_name":"Medina Ramos","first_name":"Raimel A","orcid":"0000-0002-5383-2869","full_name":"Medina Ramos, Raimel A"},{"id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym"}],"month":"05","OA_place":"repository","arxiv":1,"day":"16","publication_status":"draft","date_updated":"2026-04-07T12:43:22Z","article_processing_charge":"No","status":"public","title":"A recursive lower bound on the energy improvement of the quantum approximate optimization algorithm","_id":"17222","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Medina Ramos RA, Serbyn M. A recursive lower bound on the energy improvement of the quantum approximate optimization algorithm. arXiv, 2405.10125.","chicago":"Medina Ramos, Raimel A, and Maksym Serbyn. “A Recursive Lower Bound on the Energy Improvement of the Quantum Approximate Optimization Algorithm.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2405.10125\">https://doi.org/10.48550/arXiv.2405.10125</a>.","ieee":"R. A. Medina Ramos and M. Serbyn, “A recursive lower bound on the energy improvement of the quantum approximate optimization algorithm,” <i>arXiv</i>. .","apa":"Medina Ramos, R. A., &#38; Serbyn, M. (n.d.). A recursive lower bound on the energy improvement of the quantum approximate optimization algorithm. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2405.10125\">https://doi.org/10.48550/arXiv.2405.10125</a>","mla":"Medina Ramos, Raimel A., and Maksym Serbyn. “A Recursive Lower Bound on the Energy Improvement of the Quantum Approximate Optimization Algorithm.” <i>ArXiv</i>, 2405.10125, doi:<a href=\"https://doi.org/10.48550/arXiv.2405.10125\">10.48550/arXiv.2405.10125</a>.","short":"R.A. Medina Ramos, M. Serbyn, ArXiv (n.d.).","ama":"Medina Ramos RA, Serbyn M. A recursive lower bound on the energy improvement of the quantum approximate optimization algorithm. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2405.10125\">10.48550/arXiv.2405.10125</a>"},"department":[{"_id":"MaSe"}],"language":[{"iso":"eng"}],"publication":"arXiv"},{"page":"195","abstract":[{"lang":"eng","text":"In this thesis, we are dealing with both arithmetic and geometric problems coming from the\r\nstudy of rational points with a particular focus on function fields over finite fields:\r\n(1) Using the circle method we produce upper bounds for the number of rational points of\r\nbounded height on diagonal cubic surfaces and fourfolds over Fq(t). This is based on\r\njoint work with Leonhard Hochfilzer.\r\n(2) We study rational points on smooth complete intersections X defined by cubic and\r\nquadratic hypersurfaces over Fq(t). We refine the Farey dissection of the “unit square”\r\ndeveloped by Vishe [202] and use the circle method with a Kloosterman refinement to\r\nestablish an asymptotic formula for the number of rational points of bounded height on\r\nX when dim(X) ≥ 23. Under the same hypotheses, we also verify weak approximation.\r\n(3) In joint work with Hochfilzer, we obtain upper bounds for the number of rational points of\r\nbounded height on del Pezzo surfaces of low degree over any global field. Our approach\r\nis to take hyperplane sections, which reduces the problem to uniform estimates for the\r\nnumber of rational points on curves.\r\n(4) We develop a version of the circle method capable of counting Fq-points on jet schemes\r\nof moduli spaces of rational curves on hypersurfaces. Combining this with a spreading\r\nout argument and a result of Mustaţă [150], this allows us to show that these moduli\r\nspaces only have canonical singularities under suitable assumptions on the degree and the\r\ndimension.\r\nIn addition, we give an overview of guiding questions and conjectures in the field of rational\r\npoints and explain the basic mechanism underlying the circle method.\r\n"}],"project":[{"grant_number":"P36278","_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","name":"Rational curves via function field analytic number theory"}],"year":"2024","date_created":"2024-09-23T18:58:08Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"18293","status":"public"},{"id":"18294","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"18295","status":"public"},{"relation":"part_of_dissertation","id":"18173","status":"public"}]},"oa_version":"Published Version","language":[{"iso":"eng"}],"_id":"18132","title":"Counting rational points over function fields","file":[{"file_name":"PhDthesis (3).zip","content_type":"application/x-zip-compressed","access_level":"closed","relation":"source_file","creator":"jglas","file_id":"18133","date_updated":"2024-09-23T18:49:22Z","date_created":"2024-09-23T18:49:22Z","file_size":5382106,"checksum":"2f8cf5cefdab108b1979caa8146cae9a"},{"success":1,"date_created":"2024-09-25T14:08:57Z","date_updated":"2024-09-25T14:08:57Z","file_size":2380127,"checksum":"08bb6f14c42b47ff25882a2ce3ea0d8a","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"example-phd.pdf","file_id":"18140","creator":"jglas"}],"status":"public","date_updated":"2026-04-07T12:53:54Z","publication_status":"published","ddc":["512"],"month":"09","author":[{"first_name":"Jakob","full_name":"Glas, Jakob","last_name":"Glas","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb"}],"file_date_updated":"2024-09-25T14:08:57Z","type":"dissertation","doi":"10.15479/at:ista:18132","oa":1,"license":"https://creativecommons.org/licenses/by-nc/4.0/","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"has_accepted_license":"1","corr_author":"1","degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"TiBr"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"mla":"Glas, Jakob. <i>Counting Rational Points over Function Fields</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18132\">10.15479/at:ista:18132</a>.","apa":"Glas, J. (2024). <i>Counting rational points over function fields</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18132\">https://doi.org/10.15479/at:ista:18132</a>","chicago":"Glas, Jakob. “Counting Rational Points over Function Fields.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18132\">https://doi.org/10.15479/at:ista:18132</a>.","ieee":"J. Glas, “Counting rational points over function fields,” Institute of Science and Technology Austria, 2024.","ista":"Glas J. 2024. Counting rational points over function fields. Institute of Science and Technology Austria.","ama":"Glas J. Counting rational points over function fields. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18132\">10.15479/at:ista:18132</a>","short":"J. Glas, Counting Rational Points over Function Fields, Institute of Science and Technology Austria, 2024."},"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","supervisor":[{"last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D"}],"publication_identifier":{"issn":["2663-337X"]},"day":"23","OA_place":"publisher","date_published":"2024-09-23T00:00:00Z"}]