[{"supplementarymaterial":"yes","acknowledgement":"We thank X. Ye (ISTA) for providing the His–SUMO expression plasmid pSVA13429. pCDB302 was a gift from C. Bahl (Addgene plasmid number 113673; http://n2t.net/addgene:113673; RRID Addgene_113673). We thank B. Ahsan, G. Sharov, G. Cannone and S. Chen from the Medical Research Council (MRC) LMB Electron Microscopy Facility for help and support. We thank Scientific Computing at the MRC LMB for their support. We thank L. Trübestein and N. Krasnici of the protein service unit of the ISTA Lab Support Facility for help with the SEC coupled with multi-angle light scattering experiments. We thank D. Grohmann and R. Reichelt from the Archaea Centre at the University of Regensburg for providing the P. furiosus cell material. P.N. and S.-V.A. were supported by a Momentum grant from the Volkswagen (VW) Foundation (grant number 94933). D.K.-C. and D.B. were supported by the VW Stiftung ‘Life?’ programme (to J.L.; grant number Az 96727) and by the MRC, as part of UK Research and Innovation (UKRI), MRC file reference number U105184326 (to J.L.). N.T. and S.G. acknowledge support from the French Government’s Investissement d’Avenir program, Laboratoire d’Excellence ‘Integrative Biology of Emerging Infectious Diseases’ (grant number ANR-10-LABX-62-IBEID), and the computational and storage services (Maestro cluster) provided by the IT department at Institut Pasteur. M.K. and M.L. were supported by the Austrian Science Fund (FWF) Stand-Alone P34607. For the purpose of open access, the MRC Laboratory of Molecular Biology has applied a CC BY public copyright licence to any author accepted manuscript version arising.","status":"public","title":"Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division","year":"2024","abstract":[{"lang":"eng","text":"Cell division in all domains of life requires the orchestration of many proteins, but in Archaea most of the machinery remains poorly characterized. Here we investigate the FtsZ-based cell division mechanism in Haloferax volcanii and find proteins containing photosynthetic reaction centre (PRC) barrel domains that play an essential role in archaeal cell division. We rename these proteins cell division protein B 1 (CdpB1) and CdpB2. Depletions and deletions in their respective genes cause severe cell division defects, generating drastically enlarged cells. Fluorescence microscopy of tagged FtsZ1, FtsZ2 and SepF in CdpB1 and CdpB2 mutant strains revealed an unusually disordered divisome that is not organized into a distinct ring-like structure. Biochemical analysis shows that SepF forms a tripartite complex with CdpB1/2 and crystal structures suggest that these two proteins might form filaments, possibly aligning SepF and the FtsZ2 ring during cell division. Overall our results indicate that PRC-domain proteins play essential roles in FtsZ-based cell division in Archaea."}],"dataavailabilitystatement":"The data that support the findings of this study are available in the Source Data. Source data are provided with this paper. Coordinates have been submitted to the Protein Data Bank (PDB) with accession code 8QZO.","publication_status":"published","quality_controlled":"1","publication":"Nature Microbiology","das_tickbox":"1","citation":{"apa":"Nußbaum, P., Kureisaite-Ciziene, D., Bellini, D., Van Der Does, C., Kojic, M., Taib, N., … Albers, S. V. (2024). Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division. <i>Nature Microbiology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41564-024-01600-5\">https://doi.org/10.1038/s41564-024-01600-5</a>","ama":"Nußbaum P, Kureisaite-Ciziene D, Bellini D, et al. Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division. <i>Nature Microbiology</i>. 2024;9(3):698-711. doi:<a href=\"https://doi.org/10.1038/s41564-024-01600-5\">10.1038/s41564-024-01600-5</a>","ieee":"P. Nußbaum <i>et al.</i>, “Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division,” <i>Nature Microbiology</i>, vol. 9, no. 3. Springer Nature, pp. 698–711, 2024.","ista":"Nußbaum P, Kureisaite-Ciziene D, Bellini D, Van Der Does C, Kojic M, Taib N, Yeates A, Tourte M, Gribaldo S, Loose M, Löwe J, Albers SV. 2024. Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division. Nature Microbiology. 9(3), 698–711.","short":"P. Nußbaum, D. Kureisaite-Ciziene, D. Bellini, C. Van Der Does, M. Kojic, N. Taib, A. Yeates, M. Tourte, S. Gribaldo, M. Loose, J. Löwe, S.V. Albers, Nature Microbiology 9 (2024) 698–711.","mla":"Nußbaum, Phillip, et al. “Proteins Containing Photosynthetic Reaction Centre Domains Modulate FtsZ-Based Archaeal Cell Division.” <i>Nature Microbiology</i>, vol. 9, no. 3, Springer Nature, 2024, pp. 698–711, doi:<a href=\"https://doi.org/10.1038/s41564-024-01600-5\">10.1038/s41564-024-01600-5</a>.","chicago":"Nußbaum, Phillip, Danguole Kureisaite-Ciziene, Dom Bellini, Chris Van Der Does, Marko Kojic, Najwa Taib, Anna Yeates, et al. “Proteins Containing Photosynthetic Reaction Centre Domains Modulate FtsZ-Based Archaeal Cell Division.” <i>Nature Microbiology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41564-024-01600-5\">https://doi.org/10.1038/s41564-024-01600-5</a>."},"day":"04","_id":"15118","researchdata_availability":"yes","publication_identifier":{"eissn":["2058-5276"]},"external_id":{"pmid":["38443575"],"isi":["001183270800021"]},"doi":"10.1038/s41564-024-01600-5","date_published":"2024-03-04T00:00:00Z","month":"03","isi":1,"page":"698-711","type":"journal_article","date_updated":"2026-10-16T10:35:48Z","related_material":{"record":[{"status":"public","id":"20741","relation":"dissertation_contains"}]},"date_created":"2024-03-17T23:00:58Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"publisher":"Springer Nature","article_type":"original","oa_version":"None","volume":9,"acknowledged_ssus":[{"_id":"LifeSc"}],"department":[{"_id":"MaLo"}],"author":[{"first_name":"Phillip","full_name":"Nußbaum, Phillip","last_name":"Nußbaum"},{"last_name":"Kureisaite-Ciziene","full_name":"Kureisaite-Ciziene, Danguole","first_name":"Danguole"},{"full_name":"Bellini, Dom","last_name":"Bellini","first_name":"Dom"},{"first_name":"Chris","last_name":"Van Der Does","full_name":"Van Der Does, Chris"},{"full_name":"Kojic, Marko","last_name":"Kojic","first_name":"Marko","id":"73e7ecd4-dc85-11ea-9058-88a16394b160","orcid":"0000-0001-7244-8128"},{"first_name":"Najwa","full_name":"Taib, Najwa","last_name":"Taib"},{"last_name":"Yeates","full_name":"Yeates, Anna","first_name":"Anna"},{"first_name":"Maxime","full_name":"Tourte, Maxime","last_name":"Tourte"},{"last_name":"Gribaldo","full_name":"Gribaldo, Simonetta","first_name":"Simonetta"},{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin","last_name":"Loose"},{"first_name":"Jan","last_name":"Löwe","full_name":"Löwe, Jan"},{"full_name":"Albers, Sonja Verena","last_name":"Albers","first_name":"Sonja Verena"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"project":[{"grant_number":"P34607","_id":"fc38323b-9c52-11eb-aca3-ff8afb4a011d","name":"In vitro reconstitution of bacterial cell division"}],"fulldoi":"https://doi.org/10.1038/s41564-024-01600-5","issue":"3","intvolume":"         9"},{"has_accepted_license":"1","publication_status":"published","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"2024_JourCellScience_Gnyliukh.pdf","file_id":"18792","success":1,"checksum":"6dc023f0cc7052ad3cf0a42589d2e30f","relation":"main_file","content_type":"application/pdf","creator":"dernst","date_created":"2025-01-09T08:41:16Z","access_level":"open_access","date_updated":"2025-01-09T08:41:16Z","file_size":25845948}],"_id":"15330","day":"01","citation":{"ama":"Gnyliukh N, Johnson AJ, Nagel M, et al. Role of dynamin-related proteins 2 and SH3P2 in clathrin-mediated endocytosis in Arabidopsis thaliana. <i>Journal of Cell Science</i>. 2024;137(8). doi:<a href=\"https://doi.org/10.1242/jcs.261720\">10.1242/jcs.261720</a>","ieee":"N. Gnyliukh <i>et al.</i>, “Role of dynamin-related proteins 2 and SH3P2 in clathrin-mediated endocytosis in Arabidopsis thaliana,” <i>Journal of Cell Science</i>, vol. 137, no. 8. The Company of Biologists, 2024.","apa":"Gnyliukh, N., Johnson, A. J., Nagel, M., Monzer, A., Babic, D., Hlavata, A., … Friml, J. (2024). Role of dynamin-related proteins 2 and SH3P2 in clathrin-mediated endocytosis in Arabidopsis thaliana. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.261720\">https://doi.org/10.1242/jcs.261720</a>","chicago":"Gnyliukh, Nataliia, Alexander J Johnson, MK Nagel, Aline Monzer, David Babic, Annamaria Hlavata, SS Alotaibi, E Isono, Martin Loose, and Jiří Friml. “Role of Dynamin-Related Proteins 2 and SH3P2 in Clathrin-Mediated Endocytosis in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>. The Company of Biologists, 2024. <a href=\"https://doi.org/10.1242/jcs.261720\">https://doi.org/10.1242/jcs.261720</a>.","mla":"Gnyliukh, Nataliia, et al. “Role of Dynamin-Related Proteins 2 and SH3P2 in Clathrin-Mediated Endocytosis in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>, vol. 137, no. 8, jcs. 261720, The Company of Biologists, 2024, doi:<a href=\"https://doi.org/10.1242/jcs.261720\">10.1242/jcs.261720</a>.","ista":"Gnyliukh N, Johnson AJ, Nagel M, Monzer A, Babic D, Hlavata A, Alotaibi S, Isono E, Loose M, Friml J. 2024. Role of dynamin-related proteins 2 and SH3P2 in clathrin-mediated endocytosis in Arabidopsis thaliana. Journal of Cell Science. 137(8), jcs. 261720.","short":"N. Gnyliukh, A.J. Johnson, M. Nagel, A. Monzer, D. Babic, A. Hlavata, S. Alotaibi, E. Isono, M. Loose, J. Friml, Journal of Cell Science 137 (2024)."},"publication":"Journal of Cell Science","das_tickbox":"0","quality_controlled":"1","acknowledgement":"Nataliia Gnyliukh was partially funded by the European Union’s Horizon 2020 research and\r\ninnovation program (2018-2020) under the Marie Sklodowska-Curie Grant (agreement no.\r\n665385). Taif University Researchers Supporting Project: TURSP-HC2022/02. and Austrian\r\nScience Fund (FWF): I 6123-B.We thank Prof. Eileen Lafer and Liping Wang for their suggestions regarding the optimisation of protein expression and purification. We thank Prof. Sebastian Y. Bednarek for the useful comments and constructive criticism of the project. We thank Maciek Adamowski for providing genetic material. This research was supported by the Scientific Service Units (SSU) of IST-Austria through resources provided by the Electron microscopy (EMF), Lab Support Facility (LSF) (particularly Dorota Jaworska) and the Bioimaging Facility (BIF).","OA_place":"publisher","supplementarymaterial":"yes","abstract":[{"lang":"eng","text":"Clathrin-mediated endocytosis (CME) is vital for the regulation of plant growth and development by controlling plasma membrane protein composition and cargo uptake. CME relies on the precise recruitment of regulators for vesicle maturation and release. Homologues of components of mammalian vesicle scission are strong candidates to be part of the scission machinery in plants, but the precise roles of these proteins in this process are not fully understood. Here, we characterised the roles of Plant Dynamin-Related Proteins 2 (DRP2s) and SH3-domain containing protein 2 (SH3P2), the plant homologue to Dynamins’ recruiters, like Endophilin and Amphiphysin, in the CME by combining high-resolution imaging of endocytic events in vivo and characterisation of the purified proteins in vitro. Although DRP2s and SH3P2 arrive similarly late during CME and physically interact, genetic analysis of the sh3p123 triple-mutant and complementation assays with non-SH3P2-interacting DRP2 variants suggests that SH3P2 does not directly recruit DRP2s to the site of endocytosis. These observations imply that despite the presence of many well-conserved endocytic components, plants have acquired a distinct mechanism for CME."}],"year":"2024","status":"public","title":"Role of dynamin-related proteins 2 and SH3P2 in clathrin-mediated endocytosis in Arabidopsis thaliana","corr_author":"1","isi":1,"month":"04","type":"journal_article","ec_funded":1,"external_id":{"isi":["001266917100005"],"pmid":["38506228"]},"publication_identifier":{"issn":["0021-9533"],"eissn":["1477-9137"]},"researchdata_availability":"no","doi":"10.1242/jcs.261720","date_published":"2024-04-01T00:00:00Z","oa_version":"Published Version","article_type":"original","pmid":1,"publisher":"The Company of Biologists","ddc":["570"],"file_date_updated":"2025-01-09T08:41:16Z","volume":137,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"14591"}]},"date_updated":"2026-10-16T10:38:13Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-04-19T09:54:59Z","language":[{"iso":"eng"}],"issue":"8","intvolume":"       137","project":[{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"grant_number":"I06123","_id":"bd76d395-d553-11ed-ba76-f678c14f9033","name":"Peptide receptors for auxin canalization in Arabidopsis"}],"fulldoi":"https://doi.org/10.1242/jcs.261720","article_number":"jcs.261720","oa":1,"scopus_import":"1","author":[{"orcid":"0000-0002-2198-0509","first_name":"Nataliia","id":"390C1120-F248-11E8-B48F-1D18A9856A87","full_name":"Gnyliukh, Nataliia","last_name":"Gnyliukh"},{"last_name":"Johnson","full_name":"Johnson, Alexander J","orcid":"0000-0002-2739-8843","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander J"},{"first_name":"MK","full_name":"Nagel, MK","last_name":"Nagel"},{"full_name":"Monzer, Aline","last_name":"Monzer","first_name":"Aline","id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425"},{"first_name":"David","id":"db566d23-f6e0-11ea-865d-e6f270e968e7","full_name":"Babic, David","last_name":"Babic"},{"id":"36062FEC-F248-11E8-B48F-1D18A9856A87","first_name":"Annamaria","last_name":"Hlavata","full_name":"Hlavata, Annamaria"},{"first_name":"SS","full_name":"Alotaibi, SS","last_name":"Alotaibi"},{"full_name":"Isono, E","last_name":"Isono","first_name":"E"},{"last_name":"Loose","full_name":"Loose, Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","orcid":"0000-0001-7309-9724"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří"}],"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"MaLo"},{"_id":"JiFr"},{"_id":"CaBe"}],"OA_type":"hybrid","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"Bio"}]},{"page":"3823-3839","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2303.07245","open_access":"1"}],"month":"06","isi":1,"arxiv":1,"doi":"10.1109/TIT.2024.3367767","date_published":"2024-06-01T00:00:00Z","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"researchdata_availability":"no","external_id":{"isi":["001230181100001"],"arxiv":["2303.07245"]},"das_tickbox":"0","quality_controlled":"1","publication":"IEEE Transactions on Information Theory","citation":{"mla":"Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 6, IEEE, 2024, pp. 3823–39, doi:<a href=\"https://doi.org/10.1109/TIT.2024.3367767\">10.1109/TIT.2024.3367767</a>.","chicago":"Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/TIT.2024.3367767\">https://doi.org/10.1109/TIT.2024.3367767</a>.","ista":"Esposito AR, Mondelli M. 2024. Concentration without independence via information measures. IEEE Transactions on Information Theory. 70(6), 3823–3839.","short":"A.R. Esposito, M. Mondelli, IEEE Transactions on Information Theory 70 (2024) 3823–3839.","ama":"Esposito AR, Mondelli M. Concentration without independence via information measures. <i>IEEE Transactions on Information Theory</i>. 2024;70(6):3823-3839. doi:<a href=\"https://doi.org/10.1109/TIT.2024.3367767\">10.1109/TIT.2024.3367767</a>","ieee":"A. R. Esposito and M. Mondelli, “Concentration without independence via information measures,” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 6. IEEE, pp. 3823–3839, 2024.","apa":"Esposito, A. R., &#38; Mondelli, M. (2024). Concentration without independence via information measures. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2024.3367767\">https://doi.org/10.1109/TIT.2024.3367767</a>"},"day":"01","_id":"15172","publication_status":"published","corr_author":"1","status":"public","title":"Concentration without independence via information measures","abstract":[{"lang":"eng","text":"We propose a novel approach to concentration for non-independent random variables. The main idea is to “pretend” that the random variables are independent and pay a multiplicative price measuring how far they are from actually being independent. This price is encapsulated in the Hellinger integral between the joint and the product of the marginals, which is then upper bounded leveraging tensorisation properties. Our bounds represent a natural generalisation of concentration inequalities in the presence of dependence: we recover exactly the classical bounds (McDiarmid’s inequality) when the random variables are independent. Furthermore, in a “large deviations” regime, we obtain the same decay in the probability as for the independent case, even when the random variables display non-trivial dependencies. To show this, we consider a number of applications of interest. First, we provide a bound for Markov chains with finite state space. Then, we consider the Simple Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian setting in which the stochastic process depends on its entire past. To conclude, we propose an application to Markov Chain Monte Carlo methods, where our approach leads to an improved lower bound on the minimum burn-in period required to reach a certain accuracy. In all of these settings, we provide a regime of parameters in which our bound fares better than what the state of the art can provide."}],"year":"2024","supplementarymaterial":"yes","fulldoi":"https://doi.org/10.1109/TIT.2024.3367767","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"intvolume":"        70","issue":"6","language":[{"iso":"eng"}],"department":[{"_id":"MaMo"}],"author":[{"full_name":"Esposito, Amedeo Roberto","last_name":"Esposito","first_name":"Amedeo Roberto","id":"9583e921-e1ad-11ec-9862-cef099626dc9"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020"}],"article_processing_charge":"No","oa":1,"scopus_import":"1","volume":70,"publisher":"IEEE","article_type":"original","oa_version":"Preprint","date_created":"2024-03-24T23:01:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-16T10:39:43Z","related_material":{"record":[{"relation":"earlier_version","id":"14922","status":"public"}]}},{"conference":{"location":"Athens, Greece","start_date":"2024-07-07","name":"ISIT: International Symposium on Information Theory","end_date":"2024-07-12"},"supplementarymaterial":"no","acknowledgement":"The work in this paper was supported in part by the Swiss National Science Foundation under Grant 200364.\r\n","status":"public","title":"Properties of the strong data processing constant for Rényi divergence","corr_author":"1","abstract":[{"lang":"eng","text":"Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for f -divergences. Universal upper and lower bounds have been provided along with several applications, connecting them to impossibility (converse) results, concentration of measure, hypercontractivity, and so on. In this paper, we study Renyi divergence and the corresponding SDPI constant whose behavior seems to deviate from that of ordinary <1>-divergences. In particular, one can find examples showing that the universal upper bound relating its SDPI constant to the one of Total Variation does not hold in general. In this work, we prove, however, that the universal lower bound involving the SDPI constant of the Chi-square divergence does indeed hold. Furthermore, we also provide a characterization of the distribution that achieves the supremum when is equal to 2 and consequently compute the SDPI constant for Renyi divergence of the general binary channel."}],"year":"2024","publication_status":"published","citation":{"short":"L. Jin, A.R. Esposito, M. Gastpar, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory, IEEE, 2024, pp. 3178–3183.","ista":"Jin L, Esposito AR, Gastpar M. 2024. Properties of the strong data processing constant for Rényi divergence. Proceedings of the 2024 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 3178–3183.","chicago":"Jin, Lifu, Amedeo Roberto Esposito, and Michael Gastpar. “Properties of the Strong Data Processing Constant for Rényi Divergence.” In <i>Proceedings of the 2024 IEEE International Symposium on Information Theory</i>, 3178–83. IEEE, 2024. <a href=\"https://doi.org/10.1109/ISIT57864.2024.10619367\">https://doi.org/10.1109/ISIT57864.2024.10619367</a>.","mla":"Jin, Lifu, et al. “Properties of the Strong Data Processing Constant for Rényi Divergence.” <i>Proceedings of the 2024 IEEE International Symposium on Information Theory</i>, IEEE, 2024, pp. 3178–83, doi:<a href=\"https://doi.org/10.1109/ISIT57864.2024.10619367\">10.1109/ISIT57864.2024.10619367</a>.","apa":"Jin, L., Esposito, A. R., &#38; Gastpar, M. (2024). Properties of the strong data processing constant for Rényi divergence. In <i>Proceedings of the 2024 IEEE International Symposium on Information Theory</i> (pp. 3178–3183). Athens, Greece: IEEE. <a href=\"https://doi.org/10.1109/ISIT57864.2024.10619367\">https://doi.org/10.1109/ISIT57864.2024.10619367</a>","ama":"Jin L, Esposito AR, Gastpar M. Properties of the strong data processing constant for Rényi divergence. In: <i>Proceedings of the 2024 IEEE International Symposium on Information Theory</i>. IEEE; 2024:3178-3183. doi:<a href=\"https://doi.org/10.1109/ISIT57864.2024.10619367\">10.1109/ISIT57864.2024.10619367</a>","ieee":"L. Jin, A. R. Esposito, and M. Gastpar, “Properties of the strong data processing constant for Rényi divergence,” in <i>Proceedings of the 2024 IEEE International Symposium on Information Theory</i>, Athens, Greece, 2024, pp. 3178–3183."},"day":"19","das_tickbox":"0","publication":"Proceedings of the 2024 IEEE International Symposium on Information Theory","quality_controlled":"1","_id":"17893","publication_identifier":{"issn":["2157-8095"],"isbn":["9798350382846"]},"researchdata_availability":"no","external_id":{"isi":["001304426903055"],"arxiv":["2403.10656"]},"arxiv":1,"date_published":"2024-08-19T00:00:00Z","doi":"10.1109/ISIT57864.2024.10619367","isi":1,"month":"08","page":"3178-3183","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2403.10656 "}],"type":"conference","date_updated":"2026-10-16T10:38:29Z","date_created":"2024-09-08T22:01:12Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"IEEE","oa_version":"Preprint","article_processing_charge":"No","department":[{"_id":"MaMo"}],"author":[{"last_name":"Jin","full_name":"Jin, Lifu","first_name":"Lifu"},{"id":"9583e921-e1ad-11ec-9862-cef099626dc9","first_name":"Amedeo Roberto","last_name":"Esposito","full_name":"Esposito, Amedeo Roberto"},{"first_name":"Michael","full_name":"Gastpar, Michael","last_name":"Gastpar"}],"oa":1,"scopus_import":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/ISIT57864.2024.10619367"},{"corr_author":"1","title":"Multiple packing: Lower bounds via error exponents","status":"public","year":"2024","abstract":[{"text":"We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. For any N > 0 and L ∈ Z ≥2 , a multiple packing is a set C of points in R n such that any point in R n lies in the intersection of at most L - 1 balls of radius √ nN around points in C . This is a natural generalization of the sphere packing problem. We study the multiple packing problem for both bounded point sets whose points have norm at most √ nP for some constant P > 0, and unbounded point sets whose points are allowed to be anywhere in R n . Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied over finite fields. We derive the best known lower bounds on the optimal multiple packing density. This is accomplished by establishing an inequality which relates the list-decoding error exponent for additive white Gaussian noise channels, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We also derive novel bounds on the list-decoding error exponent for infinite constellations and closed-form expressions for the list-decoding error exponents for the power-constrained AWGN channel, which may be of independent interest beyond multiple packing.","lang":"eng"}],"supplementarymaterial":"yes","acknowledgement":"The work of Yihan Zhang was supported by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 682203-ERC-[Inf-Speed-Tradeoff]. The work of Shashank Vatedka was supported in part by the Core Research Grant from the Science and\r\nEngineering Research Board, India, under Grant CRG/2022/004464; and in\r\npart by the Department of Science and Technology (DST), India, under Grant\r\nDST/INT/RUS/RSF/P-41/2020 (TPN No. 65025).","publication":"IEEE Transactions on Information Theory","das_tickbox":"0","quality_controlled":"1","citation":{"ieee":"Y. Zhang and S. Vatedka, “Multiple packing: Lower bounds via error exponents,” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 2. IEEE, pp. 1008–1039, 2024.","ama":"Zhang Y, Vatedka S. Multiple packing: Lower bounds via error exponents. <i>IEEE Transactions on Information Theory</i>. 2024;70(2):1008-1039. doi:<a href=\"https://doi.org/10.1109/TIT.2023.3334032\">10.1109/TIT.2023.3334032</a>","apa":"Zhang, Y., &#38; Vatedka, S. (2024). Multiple packing: Lower bounds via error exponents. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2023.3334032\">https://doi.org/10.1109/TIT.2023.3334032</a>","chicago":"Zhang, Yihan, and Shashank Vatedka. “Multiple Packing: Lower Bounds via Error Exponents.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/TIT.2023.3334032\">https://doi.org/10.1109/TIT.2023.3334032</a>.","mla":"Zhang, Yihan, and Shashank Vatedka. “Multiple Packing: Lower Bounds via Error Exponents.” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 2, IEEE, 2024, pp. 1008–39, doi:<a href=\"https://doi.org/10.1109/TIT.2023.3334032\">10.1109/TIT.2023.3334032</a>.","ista":"Zhang Y, Vatedka S. 2024. Multiple packing: Lower bounds via error exponents. IEEE Transactions on Information Theory. 70(2), 1008–1039.","short":"Y. Zhang, S. Vatedka, IEEE Transactions on Information Theory 70 (2024) 1008–1039."},"day":"01","_id":"14665","publication_status":"published","arxiv":1,"doi":"10.1109/TIT.2023.3334032","date_published":"2024-02-01T00:00:00Z","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"researchdata_availability":"no","external_id":{"isi":["001166812100008"],"arxiv":["2211.04408"]},"page":"1008-1039","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.04408"}],"month":"02","isi":1,"date_created":"2023-12-10T23:01:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-16T10:39:20Z","volume":70,"publisher":"IEEE","article_type":"original","oa_version":"Preprint","article_processing_charge":"No","author":[{"orcid":"0000-0002-6465-6258","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan","last_name":"Zhang"},{"last_name":"Vatedka","full_name":"Vatedka, Shashank","first_name":"Shashank"}],"department":[{"_id":"MaMo"}],"oa":1,"scopus_import":"1","fulldoi":"https://doi.org/10.1109/TIT.2023.3334032","issue":"2","intvolume":"        70","language":[{"iso":"eng"}]},{"external_id":{"isi":["001304426901091"]},"researchdata_availability":"no","publication_identifier":{"issn":["2157-8095"],"isbn":["9798350382846"]},"date_published":"2024-08-19T00:00:00Z","doi":"10.1109/ISIT57864.2024.10619362","isi":1,"month":"08","type":"conference","page":"1586-1591","acknowledgement":"The work of M. Langberg and A. D. Sarwate was supported in part by the US NSF under awards CCF-1909451 and CCF1909468. B. K. Dey was supported in part by the Bharti Centre\r\nfor Communication in IIT Bombay. ","supplementarymaterial":"no","conference":{"location":"Athens, Greece","start_date":"2024-07-07","end_date":"2024-07-12","name":"ISIT: International Symposium on Information Theory"},"year":"2024","abstract":[{"text":"We propose a concatenated code construction for a class of discrete-alphabet oblivious arbitrarily varying channels (AVCs) with cost constraints. The code has time and space complexity polynomial in the blocklength n . It uses a Reed-Solomon outer code, logarithmic blocklength random inner codes, and stochastic encoding by permuting the codeword before transmission. When the channel satisfies a condition called strong DS-nonsymmetrizability (a modified version of nonsymmetrizability originally due to Dobrushin and Stambler), we show that the code achieves a rate that for a variety of oblivious AVCs (such as classically studied error/erasure channels) match the known capacities.","lang":"eng"}],"status":"public","title":"Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs","publication_status":"published","_id":"17895","day":"19","citation":{"ista":"Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. 2024. Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs. Proceedings of the 2024 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1586–1591.","short":"B.K. Dey, S. Jaggi, M. Langberg, A.D. Sarwate, Y. Zhang, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory , IEEE, 2024, pp. 1586–1591.","mla":"Dey, B. K., et al. “Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs.” <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>, IEEE, 2024, pp. 1586–91, doi:<a href=\"https://doi.org/10.1109/ISIT57864.2024.10619362\">10.1109/ISIT57864.2024.10619362</a>.","chicago":"Dey, B. K., S. Jaggi, M. Langberg, A. D. Sarwate, and Yihan Zhang. “Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs.” In <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>, 1586–91. IEEE, 2024. <a href=\"https://doi.org/10.1109/ISIT57864.2024.10619362\">https://doi.org/10.1109/ISIT57864.2024.10619362</a>.","apa":"Dey, B. K., Jaggi, S., Langberg, M., Sarwate, A. D., &#38; Zhang, Y. (2024). Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs. In <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i> (pp. 1586–1591). Athens, Greece: IEEE. <a href=\"https://doi.org/10.1109/ISIT57864.2024.10619362\">https://doi.org/10.1109/ISIT57864.2024.10619362</a>","ieee":"B. K. Dey, S. Jaggi, M. Langberg, A. D. Sarwate, and Y. Zhang, “Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs,” in <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>, Athens, Greece, 2024, pp. 1586–1591.","ama":"Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs. In: <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>. IEEE; 2024:1586-1591. doi:<a href=\"https://doi.org/10.1109/ISIT57864.2024.10619362\">10.1109/ISIT57864.2024.10619362</a>"},"das_tickbox":"0","publication":"Proceedings of the 2024 IEEE International Symposium on Information Theory ","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","department":[{"_id":"MaMo"}],"author":[{"first_name":"B. K.","full_name":"Dey, B. K.","last_name":"Dey"},{"full_name":"Jaggi, S.","last_name":"Jaggi","first_name":"S."},{"full_name":"Langberg, M.","last_name":"Langberg","first_name":"M."},{"last_name":"Sarwate","full_name":"Sarwate, A. D.","first_name":"A. D."},{"full_name":"Zhang, Yihan","last_name":"Zhang","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","orcid":"0000-0002-6465-6258"}],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/ISIT57864.2024.10619362","date_updated":"2026-10-16T10:39:03Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-08T22:01:12Z","oa_version":"None","publisher":"IEEE"},{"publication_status":"published","_id":"17894","das_tickbox":"0","publication":"Proceedings of the 2024 IEEE International Symposium on Information Theory ","quality_controlled":"1","day":"19","citation":{"ieee":"A. R. Esposito, M. Gastpar, and I. Issa, “Variational characterizations of Sibson’s α-mutual information,” in <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>, Athens, Greece, 2024, pp. 2110–2115.","ama":"Esposito AR, Gastpar M, Issa I. Variational characterizations of Sibson’s α-mutual information. In: <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>. IEEE; 2024:2110-2115. doi:<a href=\"https://doi.org/10.1109/ISIT57864.2024.10619378\">10.1109/ISIT57864.2024.10619378</a>","apa":"Esposito, A. R., Gastpar, M., &#38; Issa, I. (2024). Variational characterizations of Sibson’s α-mutual information. In <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i> (pp. 2110–2115). Athens, Greece: IEEE. <a href=\"https://doi.org/10.1109/ISIT57864.2024.10619378\">https://doi.org/10.1109/ISIT57864.2024.10619378</a>","chicago":"Esposito, Amedeo Roberto, Michael Gastpar, and Ibrahim Issa. “Variational Characterizations of Sibson’s α-Mutual Information.” In <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>, 2110–15. IEEE, 2024. <a href=\"https://doi.org/10.1109/ISIT57864.2024.10619378\">https://doi.org/10.1109/ISIT57864.2024.10619378</a>.","mla":"Esposito, Amedeo Roberto, et al. “Variational Characterizations of Sibson’s α-Mutual Information.” <i>Proceedings of the 2024 IEEE International Symposium on Information Theory </i>, IEEE, 2024, pp. 2110–15, doi:<a href=\"https://doi.org/10.1109/ISIT57864.2024.10619378\">10.1109/ISIT57864.2024.10619378</a>.","ista":"Esposito AR, Gastpar M, Issa I. 2024. Variational characterizations of Sibson’s α-mutual information. Proceedings of the 2024 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 2110–2115.","short":"A.R. Esposito, M. Gastpar, I. Issa, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory , IEEE, 2024, pp. 2110–2115."},"acknowledgement":"The work in this paper was supported in part by the Swiss National Science Foundation under Grant 200364.","conference":{"end_date":"2024-07-12","name":"ISIT: International Symposium on Information Theory","start_date":"2024-07-07","location":"Athens, Greece"},"supplementarymaterial":"no","year":"2024","abstract":[{"text":"Sibson's α -mutual information has received renewed attention recently in several contexts: concentration of measure under dependence, statistical learning, hypothesis testing, and estimation theory. In this work, we introduce several variational representations of Sibson's α -mutual information: 1) as a supremum over joint distributions of (a combination of) KL divergences; and 2) as a supremum over functions of opportune expected values. Leveraging them, we produce a variety of novel and known results, including a generalization of transportation-cost inequalities and Fano's inequality.","lang":"eng"}],"corr_author":"1","status":"public","title":"Variational characterizations of Sibson's α-mutual information","month":"08","isi":1,"type":"conference","page":"2110-2115","external_id":{"isi":["001304426902023"]},"publication_identifier":{"issn":["2157-8095"],"isbn":["9798350382846"]},"researchdata_availability":"no","doi":"10.1109/ISIT57864.2024.10619378","date_published":"2024-08-19T00:00:00Z","oa_version":"None","publisher":"IEEE","date_updated":"2026-10-16T10:38:46Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-08T22:01:12Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1109/ISIT57864.2024.10619378","scopus_import":"1","article_processing_charge":"No","author":[{"last_name":"Esposito","full_name":"Esposito, Amedeo Roberto","id":"9583e921-e1ad-11ec-9862-cef099626dc9","first_name":"Amedeo Roberto"},{"full_name":"Gastpar, Michael","last_name":"Gastpar","first_name":"Michael"},{"first_name":"Ibrahim","last_name":"Issa","full_name":"Issa, Ibrahim"}],"department":[{"_id":"MaMo"}]},{"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/s11692-023-09624-1","intvolume":"        51","department":[{"_id":"MaRo"}],"article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Masahito","last_name":"Tsuboi","full_name":"Tsuboi, Masahito"},{"first_name":"Bjørn Tore","full_name":"Kopperud, Bjørn Tore","last_name":"Kopperud"},{"first_name":"Michael","full_name":"Matschiner, Michael","last_name":"Matschiner"},{"first_name":"Mark","last_name":"Grabowski","full_name":"Grabowski, Mark"},{"first_name":"Chrsitine","id":"205ffb76-7fe7-11eb-aa17-958bd11b99ad","full_name":"Syrowatka, Chrsitine","last_name":"Syrowatka"},{"first_name":"Christophe","full_name":"Pélabon, Christophe","last_name":"Pélabon"},{"last_name":"Hansen","full_name":"Hansen, Thomas F.","first_name":"Thomas F."}],"scopus_import":"1","oa":1,"publisher":"Springer Nature","oa_version":"Published Version","article_type":"original","volume":51,"ddc":["570"],"file_date_updated":"2024-07-22T11:53:43Z","date_updated":"2026-10-16T10:43:26Z","date_created":"2024-02-04T23:00:53Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"month":"03","page":"149-165","type":"journal_article","researchdata_availability":"upon request","publication_identifier":{"issn":["0071-3260"],"eissn":["1934-2845"]},"external_id":{"isi":["001151285200001"]},"doi":"10.1007/s11692-023-09624-1","date_published":"2024-03-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2024-07-22T11:53:43Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_updated":"2024-07-22T11:53:43Z","file_size":1705974,"file_id":"17311","success":1,"file_name":"2024_EvolutionaryBio_Tsuboi.pdf","checksum":"416ab4dac751c443b9de51fb58278ff2","relation":"main_file"}],"has_accepted_license":"1","publication_status":"published","citation":{"ista":"Tsuboi M, Kopperud BT, Matschiner M, Grabowski M, Syrowatka C, Pélabon C, Hansen TF. 2024. Antler allometry, the Irish elk and Gould revisited. Evolutionary Biology. 51, 149–165.","short":"M. Tsuboi, B.T. Kopperud, M. Matschiner, M. Grabowski, C. Syrowatka, C. Pélabon, T.F. Hansen, Evolutionary Biology 51 (2024) 149–165.","chicago":"Tsuboi, Masahito, Bjørn Tore Kopperud, Michael Matschiner, Mark Grabowski, Chrsitine Syrowatka, Christophe Pélabon, and Thomas F. Hansen. “Antler Allometry, the Irish Elk and Gould Revisited.” <i>Evolutionary Biology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s11692-023-09624-1\">https://doi.org/10.1007/s11692-023-09624-1</a>.","mla":"Tsuboi, Masahito, et al. “Antler Allometry, the Irish Elk and Gould Revisited.” <i>Evolutionary Biology</i>, vol. 51, Springer Nature, 2024, pp. 149–65, doi:<a href=\"https://doi.org/10.1007/s11692-023-09624-1\">10.1007/s11692-023-09624-1</a>.","apa":"Tsuboi, M., Kopperud, B. T., Matschiner, M., Grabowski, M., Syrowatka, C., Pélabon, C., &#38; Hansen, T. F. (2024). Antler allometry, the Irish elk and Gould revisited. <i>Evolutionary Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11692-023-09624-1\">https://doi.org/10.1007/s11692-023-09624-1</a>","ieee":"M. Tsuboi <i>et al.</i>, “Antler allometry, the Irish elk and Gould revisited,” <i>Evolutionary Biology</i>, vol. 51. Springer Nature, pp. 149–165, 2024.","ama":"Tsuboi M, Kopperud BT, Matschiner M, et al. Antler allometry, the Irish elk and Gould revisited. <i>Evolutionary Biology</i>. 2024;51:149-165. doi:<a href=\"https://doi.org/10.1007/s11692-023-09624-1\">10.1007/s11692-023-09624-1</a>"},"day":"01","publication":"Evolutionary Biology","quality_controlled":"1","das_tickbox":"1","_id":"14932","supplementarymaterial":"yes","acknowledgement":"Open access funding provided by University of Oslo (incl Oslo University Hospital).\r\nWe thank Adrian Lister, Louis Tomsett, Roberto Portela Miguez and Roula Pappa (NHMUK), Brian O'Toole and Eileen Westwig (AMNH), Daniela Kalthoff (NHRM), Alexander Bibl and Zachos Frank (NHMW), Darrin Lunde and John Ososky (NMNH), Matthew Parkes and Nigel Monaghan (NMI), Elizabetta Cioppi and Luca Bellucci (IGF), and Yoshihiro Tanaka and Hiroyuki Taruno (OMNH), who helped us in obtaining the museum data, and a special thanks to Jørgen Sikkeland (NTNU NHM) for assistance in obtaining the ontogenetic data for the red deer. We thank Olja Toljagic and Kjetil L. Voje for discussions, Ayumu Tsuboi for assistance with data collection, and Jean-Michel Gaillard and the anonymous reviewers for comments on the manuscript. We thank the Centre of Advanced Study (CAS) at the Norwegian Academy of Sciences and Letters for hosting us during the academic year of 2019/2020 when much of the analysis and writing were done. MT was funded by JSPS Research Fellowship for Young Scientists (201603238).","title":"Antler allometry, the Irish elk and Gould revisited","status":"public","dataavailabilitystatement":"All data used in this paper are available from the authors on request.","abstract":[{"lang":"eng","text":"The huge antlers of the extinct Irish elk have invited evolutionary speculation since Darwin. In the 1970s, Stephen Jay Gould presented the first extensive data on antler size in the Irish elk and combined these with comparative data from other deer to test the hypothesis that the gigantic antlers were the outcome of a positive allometry that constrained large-bodied deer to have proportionally even larger antlers. He concluded that the Irish elk had antlers as predicted for its size and interpreted this within his emerging framework of developmental constraints as an explanatory factor in evolution. Here we reanalyze antler allometry based on new morphometric data for 57 taxa of the family Cervidae. We also present a new phylogeny for the Cervidae, which we use for comparative analyses. In contrast to Gould, we find that the antlers of Irish elk were larger than predicted from the allometry within the true deer, Cervini, as analyzed by Gould, but follow the allometry across Cervidae as a whole. After dissecting the discrepancy, we reject the allometric-constraint hypothesis because, contrary to Gould, we find no similarity between static and evolutionary allometries, and because we document extensive non-allometric evolution of antler size across the Cervidae."}],"year":"2024"},{"language":[{"iso":"eng"}],"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"PCEGP3_181181","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","name":"Improving estimation and prediction of common complex disease risk"}],"fulldoi":"https://doi.org/10.1109/ICASSP48485.2024.10447198","acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"MaMo"},{"_id":"MaRo"}],"author":[{"first_name":"Al","id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","full_name":"Depope, Al","last_name":"Depope"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"last_name":"Robinson","full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813"}],"OA_type":"green","article_processing_charge":"No","scopus_import":"1","oa":1,"publisher":"IEEE","oa_version":"Submitted Version","date_updated":"2026-10-16T10:42:55Z","date_created":"2024-06-16T22:01:07Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"04","isi":1,"page":"13151-13155","type":"conference","main_file_link":[{"url":"https://openreview.net/forum?id=aQYCDxfZV0","open_access":"1"}],"researchdata_availability":"no","publication_identifier":{"isbn":["9798350344851"],"issn":["1520-6149"]},"external_id":{"isi":["001396233806078"]},"doi":"10.1109/ICASSP48485.2024.10447198","date_published":"2024-04-19T00:00:00Z","publication_status":"published","das_tickbox":"0","quality_controlled":"1","publication":"2024 IEEE International Conference on Acoustics, Speech, and Signal Processing","day":"19","citation":{"apa":"Depope, A., Mondelli, M., &#38; Robinson, M. R. (2024). Inference of genetic effects via approximate message passing. In <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i> (pp. 13151–13155). Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">https://doi.org/10.1109/ICASSP48485.2024.10447198</a>","ama":"Depope A, Mondelli M, Robinson MR. Inference of genetic effects via approximate message passing. In: <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>. IEEE; 2024:13151-13155. doi:<a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">10.1109/ICASSP48485.2024.10447198</a>","ieee":"A. Depope, M. Mondelli, and M. R. Robinson, “Inference of genetic effects via approximate message passing,” in <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>, Seoul, Korea, 2024, pp. 13151–13155.","short":"A. Depope, M. Mondelli, M.R. Robinson, in:, 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2024, pp. 13151–13155.","ista":"Depope A, Mondelli M, Robinson MR. 2024. Inference of genetic effects via approximate message passing. 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing. ICASSP: International Conference on Acoustics, Speech and Signal Processing, 13151–13155.","mla":"Depope, Al, et al. “Inference of Genetic Effects via Approximate Message Passing.” <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>, IEEE, 2024, pp. 13151–55, doi:<a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">10.1109/ICASSP48485.2024.10447198</a>.","chicago":"Depope, Al, Marco Mondelli, and Matthew Richard Robinson. “Inference of Genetic Effects via Approximate Message Passing.” In <i>2024 IEEE International Conference on Acoustics, Speech, and Signal Processing</i>, 13151–55. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICASSP48485.2024.10447198\">https://doi.org/10.1109/ICASSP48485.2024.10447198</a>."},"_id":"17147","supplementarymaterial":"no","conference":{"end_date":"2024-04-19","name":"ICASSP: International Conference on Acoustics, Speech and Signal Processing","location":"Seoul, Korea","start_date":"2024-04-14"},"acknowledgement":"This work was supported by a Lopez-Loreta Prize to MM, an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and core funding from ISTA. The authors thank Philip Schniter, Matthew Stephens and Pragya Sur for valuable suggestions on an early version of the work. The authors acknowledge the participants and investigators of the UK Biobank study. High-performance\r\ncomputing was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","OA_place":"repository","corr_author":"1","title":"Inference of genetic effects via approximate message passing","status":"public","abstract":[{"text":"Efficient utilization of large-scale biobank data is crucial for inferring the genetic basis of disease and predicting health outcomes from the DNA. Yet we lack efficient, accurate methods that scale to data where electronic health records are linked to whole genome sequence information. To address this issue, our paper develops a new algorithmic paradigm based on Approximate Message Passing (AMP), which is specifically tailored for genomic prediction and association testing. Our method yields comparable out-of-sample prediction accuracy to the state of the art on UK Biobank traits, whilst dramatically improving computational complexity, with a 8x-speed up in the run time. In addition, AMP theory provides a joint association testing framework, which outperforms the currently used REGENIE method, in roughly a third of the compute time. This first, truly large-scale application of the AMP framework lays the foundations for a far wider range of statistical analyses for hundreds of millions of variables measured on millions of people.","lang":"eng"}],"year":"2024"},{"intvolume":"       235","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"language":[{"iso":"eng"}],"scopus_import":"1","oa":1,"article_processing_charge":"No","department":[{"_id":"MaMo"}],"author":[{"last_name":"Bombari","full_name":"Bombari, Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa","first_name":"Simone"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco"}],"OA_type":"green","volume":235,"oa_version":"Preprint","publisher":"ML Research Press","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-01-30T07:35:49Z","related_material":{"record":[{"relation":"dissertation_contains","id":"22857","status":"public"}]},"date_updated":"2026-10-16T10:42:17Z","type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2402.02969","open_access":"1"}],"page":"4300-4328","month":"07","date_published":"2024-07-30T00:00:00Z","arxiv":1,"external_id":{"arxiv":["2402.02969"]},"publication_identifier":{"eissn":["2640-3498"]},"researchdata_availability":"no","_id":"18973","das_tickbox":"0","publication":"41st International Conference on Machine Learning","quality_controlled":"1","alternative_title":["PMLR"],"day":"30","citation":{"ama":"Bombari S, Mondelli M. Towards understanding the word sensitivity of attention layers: A study via random features. In: <i>41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:4300-4328.","ieee":"S. Bombari and M. Mondelli, “Towards understanding the word sensitivity of attention layers: A study via random features,” in <i>41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 4300–4328.","apa":"Bombari, S., &#38; Mondelli, M. (2024). Towards understanding the word sensitivity of attention layers: A study via random features. In <i>41st International Conference on Machine Learning</i> (Vol. 235, pp. 4300–4328). Vienna, Austria: ML Research Press.","mla":"Bombari, Simone, and Marco Mondelli. “Towards Understanding the Word Sensitivity of Attention Layers: A Study via Random Features.” <i>41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 4300–28.","chicago":"Bombari, Simone, and Marco Mondelli. “Towards Understanding the Word Sensitivity of Attention Layers: A Study via Random Features.” In <i>41st International Conference on Machine Learning</i>, 235:4300–4328. ML Research Press, 2024.","short":"S. Bombari, M. Mondelli, in:, 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 4300–4328.","ista":"Bombari S, Mondelli M. 2024. Towards understanding the word sensitivity of attention layers: A study via random features. 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 4300–4328."},"publication_status":"published","abstract":[{"lang":"eng","text":"Understanding the reasons behind the exceptional success of transformers requires a better analysis of why attention layers are suitable for NLP tasks. In particular, such tasks require predictive models to capture contextual meaning which often depends on one or few words, even if the sentence is long. Our work studies this key property, dubbed word sensitivity (WS), in the prototypical setting of random features. We show that attention layers enjoy high WS, namely, there exists a vector in the space of embeddings that largely perturbs the random attention features map. The argument critically exploits the role of the softmax in the attention layer, highlighting its benefit compared to other activations (e.g., ReLU). In contrast, the WS of standard random features is of order 1/n−−√, n being the number of words in the textual sample, and thus it decays with the length of the context. We then translate these results on the word sensitivity into generalization bounds: due to their low WS, random features provably cannot learn to distinguish between two sentences that differ only in a single word; in contrast, due to their high WS, random attention features have higher generalization capabilities. We validate our theoretical results with experimental evidence over the BERT-Base word embeddings of the imdb review dataset."}],"year":"2024","corr_author":"1","status":"public","title":"Towards understanding the word sensitivity of attention layers: A study via random features","OA_place":"repository","acknowledgement":"The authors were partially supported by the 2019 LopezLoreta prize, and they would like to thank Mohammad Hossein Amani, Lorenzo Beretta, and Clement Rebuffel for helpful discussions.","supplementarymaterial":"no","conference":{"end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","location":"Vienna, Austria","start_date":"2024-07-21"}},{"related_material":{"record":[{"id":"22857","relation":"dissertation_contains","status":"public"}]},"date_updated":"2026-10-16T10:42:37Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-01-30T07:29:47Z","oa_version":"Preprint","publisher":"ML Research Press","volume":235,"oa":1,"scopus_import":"1","OA_type":"green","department":[{"_id":"MaMo"}],"article_processing_charge":"No","author":[{"last_name":"Bombari","full_name":"Bombari, Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa","first_name":"Simone"},{"full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"}],"language":[{"iso":"eng"}],"intvolume":"       235","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"acknowledgement":"The authors were partially supported by the 2019 LopezLoreta prize, and they would like to thank (in alphabetical order) Grigorios Chrysos, Simone Maria Giancola, Mahyar\r\nJafari Nodeh, Christoph Lampert, Marco Miani, GuanWen Qiu, and Peter Sukenık for helpful discussions.","OA_place":"repository","supplementarymaterial":"yes","conference":{"start_date":"2024-07-21","location":"Vienna, Austria","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning"},"year":"2024","abstract":[{"lang":"eng","text":"Deep learning models are known to overfit and memorize spurious features in the training dataset. While numerous empirical studies have aimed at understanding this phenomenon, a rigorous theoretical framework to quantify it is still missing. In this paper, we consider spurious features that are uncorrelated with the learning task, and we provide a precise characterization of how they are memorized via two separate terms: (i) the stability of the model with respect to individual training samples, and (ii) the feature alignment between the spurious pattern and the full sample. While the first term is well established in learning theory and it is connected to the generalization error in classical work, the second one is, to the best of our knowledge, novel. Our key technical result gives a precise characterization of the feature alignment for the two prototypical settings of random features (RF) and neural tangent kernel (NTK) regression. We prove that the memorization of spurious features weakens as the generalization capability increases and, through the analysis of the feature alignment, we unveil the role of the model and of its activation function. Numerical experiments show the predictive power of our theory on standard datasets (MNIST, CIFAR-10)."}],"corr_author":"1","status":"public","title":"How spurious features are memorized: Precise analysis for random and NTK features","publication_status":"published","_id":"18972","publication":"41st International Conference on Machine Learning","das_tickbox":"0","quality_controlled":"1","citation":{"short":"S. Bombari, M. Mondelli, in:, 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 4267–4299.","ista":"Bombari S, Mondelli M. 2024. How spurious features are memorized: Precise analysis for random and NTK features. 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 4267–4299.","chicago":"Bombari, Simone, and Marco Mondelli. “How Spurious Features Are Memorized: Precise Analysis for Random and NTK Features.” In <i>41st International Conference on Machine Learning</i>, 235:4267–99. ML Research Press, 2024.","mla":"Bombari, Simone, and Marco Mondelli. “How Spurious Features Are Memorized: Precise Analysis for Random and NTK Features.” <i>41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 4267–99.","apa":"Bombari, S., &#38; Mondelli, M. (2024). How spurious features are memorized: Precise analysis for random and NTK features. In <i>41st International Conference on Machine Learning</i> (Vol. 235, pp. 4267–4299). Vienna, Austria: ML Research Press.","ama":"Bombari S, Mondelli M. How spurious features are memorized: Precise analysis for random and NTK features. In: <i>41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:4267-4299.","ieee":"S. Bombari and M. Mondelli, “How spurious features are memorized: Precise analysis for random and NTK features,” in <i>41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 4267–4299."},"alternative_title":["PMLR"],"day":"30","external_id":{"arxiv":["2305.12100"]},"publication_identifier":{"eissn":["2640-3498"]},"researchdata_availability":"no","date_published":"2024-07-30T00:00:00Z","arxiv":1,"month":"07","type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2305.12100","open_access":"1"}],"page":"4267-4299"},{"date_published":"2024-09-01T00:00:00Z","doi":"10.1109/TIT.2024.3430842","arxiv":1,"external_id":{"isi":["001299623600019"],"arxiv":["2210.07754"]},"researchdata_availability":"no","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"main_file_link":[{"url":"https://arxiv.org/abs/2210.07754","open_access":"1"}],"type":"journal_article","page":"6211-6238","isi":1,"month":"09","abstract":[{"lang":"eng","text":"In this work we consider the list-decodability and list-recoverability of arbitrary q -ary codes, for all integer values of q ⩾ 2. A code is called ( p , L ) q -list-decodable if every radius pn Hamming ball contains less than L codewords; ( p , ℓ, L ) q -recoverability is a generalization where we place radius pn Hamming balls on every point of a combinatorial rectangle with side length ℓ and again stipulate that there be less than L codewords. Our main contribution is to precisely calculate the maximum value of p for which there exist infinite families of positive rate ( p , ℓ, L ) q -list-recoverable codes, the quantity we call the zero-rate threshold . Denoting this value by p *, we in fact show that codes correcting a p * + ε fraction of errors must have size O ε (1), i.e., independent of n . Such a result is typically referred to as a “Plotkin bound.” To complement this, a standard random code with expurgation construction shows that there exist positive rate codes correcting a p * − ε fraction of errors. We also follow a classical proof template (typically attributed to Elias and Bassalygo) to derive from the zero-rate threshold other tradeoffs between rate and decoding radius for list-decoding and list-recovery. Technically, proving the Plotkin bound boils down to demon-strating the Schur convexity of a certain function defined on the q -simplex as well as the convexity of a univariate function derived from it. We remark that an earlier argument claimed similar results for q -ary list-decoding; however, we point out that this earlier proof is flawed."}],"year":"2024","title":"Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery","status":"public","corr_author":"1","OA_place":"repository","acknowledgement":"Part of this work was done while Nicolas Resch was affiliated with the Centrum Wiskunde & Informatica and supported in part by ERC H2020 grant No.74079 (ALGSTRONGCRYPTO). Chen Yuan is supported in part by the National Key Research and Development Projects under Grant 2022YFA1004900 and Grant 2021YFE0109900, the National Natural Science Foundation of China under Grant 12101403 and Grant 12031011.","supplementarymaterial":"no","_id":"17330","citation":{"short":"N. Resch, C. Yuan, Y. Zhang, IEEE Transactions on Information Theory 70 (2024) 6211–6238.","ista":"Resch N, Yuan C, Zhang Y. 2024. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. IEEE Transactions on Information Theory. 70(9), 6211–6238.","chicago":"Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/TIT.2024.3430842\">https://doi.org/10.1109/TIT.2024.3430842</a>.","mla":"Resch, Nicolas, et al. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 9, IEEE, 2024, pp. 6211–38, doi:<a href=\"https://doi.org/10.1109/TIT.2024.3430842\">10.1109/TIT.2024.3430842</a>.","apa":"Resch, N., Yuan, C., &#38; Zhang, Y. (2024). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2024.3430842\">https://doi.org/10.1109/TIT.2024.3430842</a>","ieee":"N. Resch, C. Yuan, and Y. Zhang, “Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery,” <i>IEEE Transactions on Information Theory</i>, vol. 70, no. 9. IEEE, pp. 6211–6238, 2024.","ama":"Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. <i>IEEE Transactions on Information Theory</i>. 2024;70(9):6211-6238. doi:<a href=\"https://doi.org/10.1109/TIT.2024.3430842\">10.1109/TIT.2024.3430842</a>"},"day":"01","publication":"IEEE Transactions on Information Theory","das_tickbox":"0","quality_controlled":"1","publication_status":"published","oa":1,"scopus_import":"1","author":[{"full_name":"Resch, Nicolas","last_name":"Resch","first_name":"Nicolas"},{"first_name":"Chen","full_name":"Yuan, Chen","last_name":"Yuan"},{"orcid":"0000-0002-6465-6258","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan","last_name":"Zhang"}],"OA_type":"green","department":[{"_id":"MaMo"}],"article_processing_charge":"No","intvolume":"        70","issue":"9","fulldoi":"https://doi.org/10.1109/TIT.2024.3430842","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-07-28T22:01:10Z","related_material":{"record":[{"relation":"earlier_version","id":"14083","status":"public"}]},"date_updated":"2026-10-16T10:41:59Z","volume":70,"oa_version":"Preprint","article_type":"original","publisher":"IEEE"},{"_id":"18652","day":"03","citation":{"ista":"Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. 2024. Codes for adversaries: Between worst-case and average-case jamming. Foundations and Trends in Communications and Information Theory. 21(3–4), 300–588.","short":"B.K. Dey, S. Jaggi, M. Langberg, A.D. Sarwate, Y. Zhang, Foundations and Trends in Communications and Information Theory 21 (2024) 300–588.","mla":"Dey, Bikash Kumar, et al. “Codes for Adversaries: Between Worst-Case and Average-Case Jamming.” <i>Foundations and Trends in Communications and Information Theory</i>, vol. 21, no. 3–4, Now Publishers, 2024, pp. 300–588, doi:<a href=\"https://doi.org/10.1561/0100000112\">10.1561/0100000112</a>.","chicago":"Dey, Bikash Kumar, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, and Yihan Zhang. “Codes for Adversaries: Between Worst-Case and Average-Case Jamming.” <i>Foundations and Trends in Communications and Information Theory</i>. Now Publishers, 2024. <a href=\"https://doi.org/10.1561/0100000112\">https://doi.org/10.1561/0100000112</a>.","apa":"Dey, B. K., Jaggi, S., Langberg, M., Sarwate, A. D., &#38; Zhang, Y. (2024). Codes for adversaries: Between worst-case and average-case jamming. <i>Foundations and Trends in Communications and Information Theory</i>. Now Publishers. <a href=\"https://doi.org/10.1561/0100000112\">https://doi.org/10.1561/0100000112</a>","ama":"Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. Codes for adversaries: Between worst-case and average-case jamming. <i>Foundations and Trends in Communications and Information Theory</i>. 2024;21(3-4):300-588. doi:<a href=\"https://doi.org/10.1561/0100000112\">10.1561/0100000112</a>","ieee":"B. K. Dey, S. Jaggi, M. Langberg, A. D. Sarwate, and Y. Zhang, “Codes for adversaries: Between worst-case and average-case jamming,” <i>Foundations and Trends in Communications and Information Theory</i>, vol. 21, no. 3–4. Now Publishers, pp. 300–588, 2024."},"publication":"Foundations and Trends in Communications and Information Theory","quality_controlled":"1","publication_status":"published","abstract":[{"text":"Over the last 70 years, information theory and coding has enabled communication technologies that have had an astounding impact on our lives. This is possible due to the match between encoding/decoding strategies and corresponding channel models. Traditional studies of channels have taken one of two extremes: Shannon-theoretic models are inherently average-case in which channel noise is governed by a memoryless stochastic process, whereas coding-theoretic (referred to as “Hamming”) models take a worst-case, adversarial, view of the noise. However, for several existing and emerging communication systems the Shannon/average-case view may be too optimistic, whereas the Hamming/worstcase view may be too pessimistic. This monograph takes up the challenge of studying adversarial channel models that lie between the Shannon and Hamming extremes.","lang":"eng"}],"year":"2024","status":"public","title":"Codes for adversaries: Between worst-case and average-case jamming","corr_author":"1","supplementarymaterial":"unclear","type":"journal_article","page":"300-588","month":"12","doi":"10.1561/0100000112","date_published":"2024-12-03T00:00:00Z","researchdata_availability":"unclear","publication_identifier":{"eissn":["1567-2328"],"issn":["1567-2190"]},"volume":21,"oa_version":"None","article_type":"original","publisher":"Now Publishers","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-12-15T23:01:50Z","date_updated":"2026-10-16T10:40:55Z","issue":"3-4","intvolume":"        21","fulldoi":"https://doi.org/10.1561/0100000112","language":[{"iso":"eng"}],"scopus_import":"1","OA_type":"closed access","department":[{"_id":"MaMo"}],"author":[{"full_name":"Dey, Bikash Kumar","last_name":"Dey","first_name":"Bikash Kumar"},{"last_name":"Jaggi","full_name":"Jaggi, Sidharth","first_name":"Sidharth"},{"full_name":"Langberg, Michael","last_name":"Langberg","first_name":"Michael"},{"full_name":"Sarwate, Anand D.","last_name":"Sarwate","first_name":"Anand D."},{"last_name":"Zhang","full_name":"Zhang, Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan","orcid":"0000-0002-6465-6258"}],"article_processing_charge":"No"},{"corr_author":"1","title":"Tangent space generators of matrix product states and exact floquet quantum scars","status":"public","abstract":[{"text":"The advancement of quantum simulators motivates the development of a theoretical framework to assist with efficient state preparation in quantum many-body systems. Generally, preparing a target entangled state via unitary evolution with time-dependent couplings is a challenging task and very little is known about the existence of solutions and their properties. In this work we develop a constructive approach for preparing matrix product states (MPS) via continuous unitary evolution. We provide an explicit construction of the operator that exactly implements the evolution of a given MPS along a specified direction in its tangent space. This operator can be written as a sum of local terms of finite range, yet it is in general non-Hermitian. Relying on the explicit construction of the non-Hermitian generator of the dynamics, we demonstrate the existence of a Hermitian sequence of operators that implements the desired MPS evolution with an error that decreases exponentially with the operator range. The construction is benchmarked on an explicit periodic trajectory in a translationally invariant MPS manifold. We demonstrate that the Floquet unitary generating the dynamics over one period of the trajectory features an approximate MPS-like eigenstate embedded among a sea of thermalizing eigenstates. These results show that our construction is not only useful for state preparation and control of many-body systems, but also provides a generic route towards Floquet scars—periodically driven models with quasilocal generators of dynamics that have exact MPS eigenstates in their spectrum.","lang":"eng"}],"year":"2024","supplementarymaterial":"yes","acknowledgement":"We thank L. Piroli, S. Garratt, and A. Molnár for insightful discussions. This research was funded in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreements No. 850899 and No. 863476), the Austrian Science Fund (FWF) (Grant DOIs 10.55776/COE1, 10.55776/P36305, and 10.55776/F71), and the European Union (NextGenerationEU). This work was performed in part at the Aspen Center for Physics, which is supported by National Science Foundation Grant PHY-2210452. This research was supported in part by NSF Grant PHY-2309135 to the Kavli Institute for Theoretical Physics (KITP).","OA_place":"publisher","DOAJ_listed":"1","publication":"PRX Quantum","quality_controlled":"1","das_tickbox":"0","citation":{"ista":"Ljubotina M, Petrova E, Schuch N, Serbyn M. 2024. Tangent space generators of matrix product states and exact floquet quantum scars. PRX Quantum. 5(4), 040311.","short":"M. Ljubotina, E. Petrova, N. Schuch, M. Serbyn, PRX Quantum 5 (2024).","chicago":"Ljubotina, Marko, Elena Petrova, Norbert Schuch, and Maksym Serbyn. “Tangent Space Generators of Matrix Product States and Exact Floquet Quantum Scars.” <i>PRX Quantum</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/prxquantum.5.040311\">https://doi.org/10.1103/prxquantum.5.040311</a>.","mla":"Ljubotina, Marko, et al. “Tangent Space Generators of Matrix Product States and Exact Floquet Quantum Scars.” <i>PRX Quantum</i>, vol. 5, no. 4, 040311, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/prxquantum.5.040311\">10.1103/prxquantum.5.040311</a>.","apa":"Ljubotina, M., Petrova, E., Schuch, N., &#38; Serbyn, M. (2024). Tangent space generators of matrix product states and exact floquet quantum scars. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/prxquantum.5.040311\">https://doi.org/10.1103/prxquantum.5.040311</a>","ieee":"M. Ljubotina, E. Petrova, N. Schuch, and M. Serbyn, “Tangent space generators of matrix product states and exact floquet quantum scars,” <i>PRX Quantum</i>, vol. 5, no. 4. American Physical Society, 2024.","ama":"Ljubotina M, Petrova E, Schuch N, Serbyn M. Tangent space generators of matrix product states and exact floquet quantum scars. <i>PRX Quantum</i>. 2024;5(4). doi:<a href=\"https://doi.org/10.1103/prxquantum.5.040311\">10.1103/prxquantum.5.040311</a>"},"day":"23","_id":"18488","file":[{"relation":"main_file","checksum":"2e057ba021744d0a74602517935326b3","success":1,"file_id":"18489","file_name":"2024_PRXQuantum_Ljubotina.pdf","file_size":1151431,"date_updated":"2024-10-30T08:59:09Z","access_level":"open_access","date_created":"2024-10-30T08:59:09Z","content_type":"application/pdf","creator":"dernst"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","publication_status":"published","arxiv":1,"date_published":"2024-10-23T00:00:00Z","doi":"10.1103/prxquantum.5.040311","researchdata_availability":"no","publication_identifier":{"eissn":["2691-3399"]},"external_id":{"arxiv":["2403.12325"],"isi":["001346198800001"]},"ec_funded":1,"type":"journal_article","month":"10","isi":1,"date_created":"2024-10-29T16:04:05Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-16T12:13:31Z","APC_amount":"3711,01 EUR","volume":5,"file_date_updated":"2024-10-30T08:59:09Z","ddc":["530"],"publisher":"American Physical Society","article_type":"original","oa_version":"Published Version","department":[{"_id":"MaSe"}],"OA_type":"gold","author":[{"orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","last_name":"Ljubotina","full_name":"Ljubotina, Marko"},{"full_name":"Petrova, Elena","last_name":"Petrova","first_name":"Elena","id":"0ac84990-897b-11ed-a09c-f5abb56a4ede"},{"first_name":"Norbert","full_name":"Schuch, Norbert","last_name":"Schuch"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn"}],"article_processing_charge":"Yes","scopus_import":"1","oa":1,"article_number":"040311","project":[{"call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"fulldoi":"https://doi.org/10.1103/prxquantum.5.040311","issue":"4","intvolume":"         5","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Introducing a class of SU(2) invariant quantum unitary circuits generating chiral transport, we examine the role of broken space-reflection and time-reversal symmetries on spin-transport properties. Upon adjusting parameters of local unitary gates, the dynamics can be either chaotic or integrable. The latter corresponds to a generalization of the space-time discretized (Trotterized) higher-spin quantum Heisenberg chain. We demonstrate that breaking of space-reflection symmetry results in a drift in the dynamical spin susceptibility. Remarkably, we find a universal drift velocity given by a simple formula, which, at zero average magnetization, depends only on the values of SU(2) Casimir invariants associated with local spins. In the integrable case, the drift velocity formula is confirmed analytically based on the exact solution of thermodynamic Bethe ansatz equations. Finally, by inspecting the large fluctuations of the time-integrated current between two halves of the system in stationary maximum-entropy states, we demonstrate violation of the Gallavotti-Cohen symmetry, implying that such states cannot be regarded as equilibrium ones. We show that the scaled cumulant generating function of the time-integrated current instead obeys a generalized fluctuation relation."}],"year":"2024","status":"public","title":"Quantum many-body spin ratchets","acknowledgement":"The authors thank Denis Bernard, Jérôme Dubail, Hosho Katsura, Kareljan Schoutens, and Alberto Zorzato for stimulating discussions. This work has been supported by: Slovenian Research Agency (ARIS) under Grants No. N1-0219 (T.P., L.Z.), No. N1-0334 (T.P., L.Z.), No. N1-0243 (E.I.), and under Research Program P1-0402 (E.I., T.P., L.Z.). European Research Council (ERC) under Consolidator Grant No. 771536—NEMO (L.Z.), Advanced Grant No.\r\n101096208—QUEST (T.P., L.Z.), and Starting Grant No. 850899—NEQuM (M.L.). Simons Foundation under Simons Junior Fellowship Grant No. 1141511 (Ž.K.). M.L. acknowledges the hospitality of the Aspen Center for Physics, which is supported by National Science Foundation Grant No. PHY-2210452. Numerical simulations were performed using the ITensor library [117]. ","DOAJ_listed":"1","OA_place":"publisher","supplementarymaterial":"yes","_id":"18176","das_tickbox":"0","quality_controlled":"1","publication":"PRX Quantum","citation":{"ista":"Zadnik L, Ljubotina M, Krajnik Ž, Ilievski E, Prosen T. 2024. Quantum many-body spin ratchets. PRX Quantum. 5(3), 030356.","short":"L. Zadnik, M. Ljubotina, Ž. Krajnik, E. Ilievski, T. Prosen, PRX Quantum 5 (2024).","mla":"Zadnik, Lenart, et al. “Quantum Many-Body Spin Ratchets.” <i>PRX Quantum</i>, vol. 5, no. 3, 030356, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">10.1103/PRXQuantum.5.030356</a>.","chicago":"Zadnik, Lenart, Marko Ljubotina, Žiga Krajnik, Enej Ilievski, and Tomaž Prosen. “Quantum Many-Body Spin Ratchets.” <i>PRX Quantum</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">https://doi.org/10.1103/PRXQuantum.5.030356</a>.","apa":"Zadnik, L., Ljubotina, M., Krajnik, Ž., Ilievski, E., &#38; Prosen, T. (2024). Quantum many-body spin ratchets. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">https://doi.org/10.1103/PRXQuantum.5.030356</a>","ama":"Zadnik L, Ljubotina M, Krajnik Ž, Ilievski E, Prosen T. Quantum many-body spin ratchets. <i>PRX Quantum</i>. 2024;5(3). doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.030356\">10.1103/PRXQuantum.5.030356</a>","ieee":"L. Zadnik, M. Ljubotina, Ž. Krajnik, E. Ilievski, and T. Prosen, “Quantum many-body spin ratchets,” <i>PRX Quantum</i>, vol. 5, no. 3. American Physical Society, 2024."},"day":"25","publication_status":"published","has_accepted_license":"1","file":[{"file_size":1061648,"date_updated":"2024-10-07T11:04:12Z","access_level":"open_access","date_created":"2024-10-07T11:04:12Z","content_type":"application/pdf","creator":"dernst","relation":"main_file","checksum":"bc230631255d3bcf8bcbbc8fdbfefcf2","success":1,"file_id":"18183","file_name":"2024_PRXQuantum_Zadnik.pdf"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2024-09-25T00:00:00Z","doi":"10.1103/PRXQuantum.5.030356","arxiv":1,"external_id":{"isi":["001327172800001"],"arxiv":["2406.01571"]},"publication_identifier":{"eissn":["2691-3399"]},"researchdata_availability":"no","type":"journal_article","ec_funded":1,"month":"09","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-10-06T22:01:12Z","date_updated":"2026-10-16T12:13:08Z","file_date_updated":"2024-10-07T11:04:12Z","ddc":["530"],"volume":5,"article_type":"original","oa_version":"Published Version","publisher":"American Physical Society","scopus_import":"1","oa":1,"OA_type":"gold","department":[{"_id":"MaSe"}],"article_processing_charge":"Yes","author":[{"first_name":"Lenart","full_name":"Zadnik, Lenart","last_name":"Zadnik"},{"last_name":"Ljubotina","full_name":"Ljubotina, Marko","orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko"},{"full_name":"Krajnik, Žiga","last_name":"Krajnik","first_name":"Žiga"},{"first_name":"Enej","full_name":"Ilievski, Enej","last_name":"Ilievski"},{"first_name":"Tomaž","full_name":"Prosen, Tomaž","last_name":"Prosen"}],"article_number":"030356","issue":"3","intvolume":"         5","project":[{"grant_number":"850899","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"fulldoi":"https://doi.org/10.1103/PRXQuantum.5.030356","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"project":[{"name":"IBM PhD Nomination Fellowship - Stefan Sack","_id":"bd660c93-d553-11ed-ba76-fb0fb6f49c0d"}],"fulldoi":"https://doi.org/10.1103/PhysRevResearch.6.013223","intvolume":"         6","issue":"1","article_number":"013223","article_processing_charge":"Yes","department":[{"_id":"MaSe"}],"author":[{"last_name":"Sack","full_name":"Sack, Stefan","id":"dd622248-f6e0-11ea-865d-ce382a1c81a5","first_name":"Stefan","orcid":"0000-0001-5400-8508"},{"full_name":"Egger, Daniel J.","last_name":"Egger","first_name":"Daniel J."}],"oa":1,"scopus_import":"1","publisher":"American Physical Society","oa_version":"Published Version","article_type":"original","volume":6,"ddc":["530"],"file_date_updated":"2024-03-19T07:16:38Z","date_updated":"2026-10-16T12:12:26Z","date_created":"2024-03-17T23:00:59Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"03","type":"journal_article","publication_identifier":{"eissn":["2643-1564"]},"researchdata_availability":"no","external_id":{"arxiv":["2307.14427"]},"arxiv":1,"date_published":"2024-03-01T00:00:00Z","doi":"10.1103/PhysRevResearch.6.013223","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_size":2777593,"date_updated":"2024-03-19T07:16:38Z","creator":"dernst","content_type":"application/pdf","access_level":"open_access","date_created":"2024-03-19T07:16:38Z","relation":"main_file","checksum":"274c9f1b15b3547a10a03f39e4ccc582","file_name":"2024_PhysicalReviewResearch_Sack.pdf","success":1,"file_id":"15123"}],"publication_status":"published","has_accepted_license":"1","citation":{"ieee":"S. Sack and D. J. Egger, “Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation,” <i>Physical Review Research</i>, vol. 6, no. 1. American Physical Society, 2024.","ama":"Sack S, Egger DJ. Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation. <i>Physical Review Research</i>. 2024;6(1). doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.6.013223\">10.1103/PhysRevResearch.6.013223</a>","apa":"Sack, S., &#38; Egger, D. J. (2024). Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevResearch.6.013223\">https://doi.org/10.1103/PhysRevResearch.6.013223</a>","chicago":"Sack, Stefan, and Daniel J. Egger. “Large-Scale Quantum Approximate Optimization on Nonplanar Graphs with Machine Learning Noise Mitigation.” <i>Physical Review Research</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevResearch.6.013223\">https://doi.org/10.1103/PhysRevResearch.6.013223</a>.","mla":"Sack, Stefan, and Daniel J. Egger. “Large-Scale Quantum Approximate Optimization on Nonplanar Graphs with Machine Learning Noise Mitigation.” <i>Physical Review Research</i>, vol. 6, no. 1, 013223, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.6.013223\">10.1103/PhysRevResearch.6.013223</a>.","ista":"Sack S, Egger DJ. 2024. Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation. Physical Review Research. 6(1), 013223.","short":"S. Sack, D.J. Egger, Physical Review Research 6 (2024)."},"day":"01","quality_controlled":"1","das_tickbox":"0","publication":"Physical Review Research","_id":"15122","supplementarymaterial":"yes","DOAJ_listed":"1","acknowledgement":"S.H.S. acknowledges support from the IBM Ph.D. fellowship 2022 in quantum computing. The authors also thank M. Serbyn, R. Kueng, R. A. Medina, and S. Woerner for fruitful discussions.","title":"Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation","status":"public","corr_author":"1","year":"2024","abstract":[{"lang":"eng","text":"Quantum computers are increasing in size and quality but are still very noisy. Error mitigation extends the size of the quantum circuits that noisy devices can meaningfully execute. However, state-of-the-art error mitigation methods are hard to implement and the limited qubit connectivity in superconducting qubit devices restricts most applications to the hardware's native topology. Here we show a quantum approximate optimization algorithm (QAOA) on nonplanar random regular graphs with up to 40 nodes enabled by a machine learning-based error mitigation. We use a swap network with careful decision-variable-to-qubit mapping and a feed-forward neural network to optimize a depth-two QAOA on up to 40 qubits. We observe a meaningful parameter optimization for the largest graph which requires running quantum circuits with 958 two-qubit gates. Our paper emphasizes the need to mitigate samples, and not only expectation values, in quantum approximate optimization. These results are a step towards executing quantum approximate optimization at a scale that is not classically simulable. Reaching such system sizes is key to properly understanding the true potential of heuristic algorithms like QAOA."}]},{"article_number":"L100304","article_processing_charge":"No","department":[{"_id":"MaSe"}],"author":[{"full_name":"Brighi, Pietro","last_name":"Brighi","first_name":"Pietro","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7969-2729"},{"first_name":"Marko","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","orcid":"0000-0003-0038-7068","full_name":"Ljubotina, Marko","last_name":"Ljubotina"}],"scopus_import":"1","oa":1,"language":[{"iso":"eng"}],"project":[{"grant_number":"850899","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"fulldoi":"https://doi.org/10.1103/PhysRevB.110.L100304","issue":"10","intvolume":"       110","date_updated":"2026-10-16T12:12:47Z","date_created":"2024-09-22T22:01:42Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"American Physical Society","article_type":"letter_note","oa_version":"Preprint","volume":110,"researchdata_availability":"no","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"external_id":{"arxiv":["2405.02102"],"isi":["001361617100003"]},"arxiv":1,"date_published":"2024-09-11T00:00:00Z","doi":"10.1103/PhysRevB.110.L100304","month":"09","isi":1,"ec_funded":1,"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.02102"}],"supplementarymaterial":"no","acknowledgement":"The authors acknowledge useful discussions with M. Serbyn, Z. Papic, and A. Nunnenkamp. ´\r\nP.B. is supported by the Erwin Schrödinger Center for Quantum Science & Technology (ESQ) of the Österreichische Akademie der Wissenschaften (ÖAW) under the Discovery Grant. M.L. acknowledges support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 850899). The numerical simulations were performed using the ITensor library [68] on the Vienna Scientific Cluster (VSC).","corr_author":"1","title":"Anomalous transport in the kinetically constrained quantum East-West model","status":"public","year":"2024","abstract":[{"lang":"eng","text":"We study a chaotic particle-conserving kinetically constrained model, with a single parameter which allows us to break reflection symmetry. Through extensive numerical simulations we find that the domain wall state shows a variety of dynamical behaviors from localization all the way to ballistic transport, depending on the value of the reflection breaking parameter. Surprisingly, such anomalous behavior is not mirrored in infinite-temperature dynamics, which appear to scale diffusively, in line with expectations for generic interacting models. However, studying the particle density gradient, we show that the lack of reflection symmetry affects infinite-temperature dynamics, resulting in an asymmetric dynamical structure factor. This is in disagreement with normal diffusion and suggests that the model may also exhibit anomalous dynamics at infinite temperature in the thermodynamic limit. Finally, we observe low-entangled eigenstates in the spectrum of the model, a telltale sign of quantum many-body scars."}],"publication_status":"published","quality_controlled":"1","das_tickbox":"0","publication":"Physical Review B","day":"11","citation":{"ama":"Brighi P, Ljubotina M. Anomalous transport in the kinetically constrained quantum East-West model. <i>Physical Review B</i>. 2024;110(10). doi:<a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">10.1103/PhysRevB.110.L100304</a>","ieee":"P. Brighi and M. Ljubotina, “Anomalous transport in the kinetically constrained quantum East-West model,” <i>Physical Review B</i>, vol. 110, no. 10. American Physical Society, 2024.","apa":"Brighi, P., &#38; Ljubotina, M. (2024). Anomalous transport in the kinetically constrained quantum East-West model. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">https://doi.org/10.1103/PhysRevB.110.L100304</a>","mla":"Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” <i>Physical Review B</i>, vol. 110, no. 10, L100304, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">10.1103/PhysRevB.110.L100304</a>.","chicago":"Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically Constrained Quantum East-West Model.” <i>Physical Review B</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevB.110.L100304\">https://doi.org/10.1103/PhysRevB.110.L100304</a>.","ista":"Brighi P, Ljubotina M. 2024. Anomalous transport in the kinetically constrained quantum East-West model. Physical Review B. 110(10), L100304.","short":"P. Brighi, M. Ljubotina, Physical Review B 110 (2024)."},"_id":"18110"},{"isi":1,"month":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2201.10220","open_access":"1"}],"type":"journal_article","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"researchdata_availability":"no","external_id":{"arxiv":["2201.10220"],"pmid":["38364163"],"isi":["001179276700003"]},"arxiv":1,"date_published":"2024-01-30T00:00:00Z","doi":"10.1103/PhysRevLett.132.050401","publication_status":"published","day":"30","citation":{"apa":"Petrova, E., Tiunov, E. S., Bañuls, M. C., &#38; Fedorov, A. K. (2024). Fractal states of the Schwinger model. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.132.050401\">https://doi.org/10.1103/PhysRevLett.132.050401</a>","ieee":"E. Petrova, E. S. Tiunov, M. C. Bañuls, and A. K. Fedorov, “Fractal states of the Schwinger model,” <i>Physical Review Letters</i>, vol. 132, no. 5. American Physical Society, 2024.","ama":"Petrova E, Tiunov ES, Bañuls MC, Fedorov AK. Fractal states of the Schwinger model. <i>Physical Review Letters</i>. 2024;132(5). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.132.050401\">10.1103/PhysRevLett.132.050401</a>","short":"E. Petrova, E.S. Tiunov, M.C. Bañuls, A.K. Fedorov, Physical Review Letters 132 (2024).","ista":"Petrova E, Tiunov ES, Bañuls MC, Fedorov AK. 2024. Fractal states of the Schwinger model. Physical Review Letters. 132(5), 050401.","mla":"Petrova, Elena, et al. “Fractal States of the Schwinger Model.” <i>Physical Review Letters</i>, vol. 132, no. 5, 050401, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.132.050401\">10.1103/PhysRevLett.132.050401</a>.","chicago":"Petrova, Elena, Egor S. Tiunov, Mari Carmen Bañuls, and Aleksey K. Fedorov. “Fractal States of the Schwinger Model.” <i>Physical Review Letters</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevLett.132.050401\">https://doi.org/10.1103/PhysRevLett.132.050401</a>."},"das_tickbox":"0","quality_controlled":"1","publication":"Physical Review Letters","_id":"15002","supplementarymaterial":"yes","acknowledgement":"We thank A. Bargov, I. Khaymovich, and V. Tiunova for fruitful discussions and for useful comments. M. C. B. thanks S. Kühn for discussions about the phase structure of the model. A. K. F. thanks V. Gritsev and A. Garkun for insightful comments. E. V. P., E. S. T., and A. K. F. are\r\nsupported by the RSF Grant No. 20-42-05002 (studying the fractal Ansatz) and the Roadmap on Quantum Computing (Contract No. 868-1.3-15/15-2021, October 5, 2021; calculating on GS energies). A. K. F. thanks the Priority 2030 program at the NIST “MISIS” under the project No. K1-2022-027. M. C. B. was partly funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111–390814868.","status":"public","title":"Fractal states of the Schwinger model","abstract":[{"lang":"eng","text":"The lattice Schwinger model, the discrete version of QED in \r\n1\r\n+\r\n1\r\n dimensions, is a well-studied test bench for lattice gauge theories. Here, we study the fractal properties of this model. We reveal the self-similarity of the ground state, which allows us to develop a recurrent procedure for finding the ground-state wave functions and predicting ground-state energies. We present the results of recurrently calculating ground-state wave functions using the fractal Ansatz and automized software package for fractal image processing. In certain parameter regimes, just a few terms are enough for our recurrent procedure to predict ground-state energies close to the exact ones for several hundreds of sites. Our findings pave the way to understanding the complexity of calculating many-body wave functions in terms of their fractal properties as well as finding new links between condensed matter and high-energy lattice models."}],"year":"2024","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1103/PhysRevLett.132.050401","intvolume":"       132","issue":"5","article_number":"050401","department":[{"_id":"MaSe"}],"article_processing_charge":"No","author":[{"full_name":"Petrova, Elena","last_name":"Petrova","first_name":"Elena","id":"0ac84990-897b-11ed-a09c-f5abb56a4ede"},{"first_name":"Egor S.","full_name":"Tiunov, Egor S.","last_name":"Tiunov"},{"first_name":"Mari Carmen","full_name":"Bañuls, Mari Carmen","last_name":"Bañuls"},{"full_name":"Fedorov, Aleksey K.","last_name":"Fedorov","first_name":"Aleksey K."}],"scopus_import":"1","oa":1,"publisher":"American Physical Society","pmid":1,"oa_version":"Preprint","article_type":"original","volume":132,"date_updated":"2026-10-16T12:12:00Z","date_created":"2024-02-18T23:01:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"fulldoi":"https://doi.org/10.15479/at:ista:17208","supervisor":[{"last_name":"Serbyn","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","orcid":"0000-0002-2399-5827"}],"oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"author":[{"last_name":"Medina Ramos","full_name":"Medina Ramos, Raimel A","orcid":"0000-0002-5383-2869","id":"CE680B90-D85A-11E9-B684-C920E6697425","first_name":"Raimel A"}],"article_processing_charge":"No","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","file_date_updated":"2024-07-17T09:23:24Z","ddc":["539"],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10545"},{"id":"10067","relation":"part_of_dissertation","status":"public"},{"id":"13125","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"11471"},{"status":"public","id":"17222","relation":"part_of_dissertation"}]},"date_updated":"2026-10-16T12:14:52Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","degree_awarded":"PhD","date_created":"2024-07-09T09:14:24Z","month":"07","type":"dissertation","page":"133","ec_funded":1,"keyword":["Quantum computing","Variational Quantum Algorithms","Optimization"],"researchdata_availability":"no","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/at:ista:17208","date_published":"2024-07-09T00:00:00Z","doi_confirm":"1","publication_status":"published","has_accepted_license":"1","file":[{"file_size":"14218691","date_updated":"2024-07-10T11:34:09Z","access_level":"closed","date_created":"2024-07-09T09:21:44Z","creator":"rmedinar","content_type":"application/zip","relation":"source_file","checksum":"6f45273d04f4418bc2adc018baed0525","file_id":"17212","file_name":"Raimel_Thesis-Final.zip"},{"success":1,"file_id":"17275","file_name":"Raimel_Thesis-20_pdfa.pdf","relation":"main_file","checksum":"6724a95bec772dbabc0111b9f08a805e","access_level":"open_access","date_created":"2024-07-17T09:23:24Z","content_type":"application/pdf","creator":"rmedinar","file_size":11253627,"date_updated":"2024-07-17T09:23:24Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"17208","das_tickbox":"0","alternative_title":["ISTA Thesis"],"day":"09","citation":{"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>","ieee":"R. A. Medina Ramos, “Exploring the optimization landscape of variational quantum algorithms,” Institute of Science and Technology Austria, 2024.","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>","ista":"Medina Ramos RA. 2024. Exploring the optimization landscape of variational quantum algorithms. Institute of Science and Technology Austria.","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>."},"OA_place":"publisher","supplementarymaterial":"no","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"}],"year":"2024","corr_author":"1","title":"Exploring the optimization landscape of variational quantum algorithms","status":"public"},{"_id":"17493","quality_controlled":"1","das_tickbox":"0","publication":"Physical Review X","day":"26","citation":{"apa":"Vermersch, B., Ljubotina, M., Cirac, J. I., Zoller, P., Serbyn, M., &#38; Piroli, L. (2024). Many-body entropies and entanglement from polynomially many local measurements. <i>Physical Review X</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevx.14.031035\">https://doi.org/10.1103/physrevx.14.031035</a>","ama":"Vermersch B, Ljubotina M, Cirac JI, Zoller P, Serbyn M, Piroli L. Many-body entropies and entanglement from polynomially many local measurements. <i>Physical Review X</i>. 2024;14(3). doi:<a href=\"https://doi.org/10.1103/physrevx.14.031035\">10.1103/physrevx.14.031035</a>","ieee":"B. Vermersch, M. Ljubotina, J. I. Cirac, P. Zoller, M. Serbyn, and L. Piroli, “Many-body entropies and entanglement from polynomially many local measurements,” <i>Physical Review X</i>, vol. 14, no. 3. American Physical Society, 2024.","short":"B. Vermersch, M. Ljubotina, J.I. Cirac, P. Zoller, M. Serbyn, L. Piroli, Physical Review X 14 (2024).","ista":"Vermersch B, Ljubotina M, Cirac JI, Zoller P, Serbyn M, Piroli L. 2024. Many-body entropies and entanglement from polynomially many local measurements. Physical Review X. 14(3), 031035.","chicago":"Vermersch, Benoît, Marko Ljubotina, J. Ignacio Cirac, Peter Zoller, Maksym Serbyn, and Lorenzo Piroli. “Many-Body Entropies and Entanglement from Polynomially Many Local Measurements.” <i>Physical Review X</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/physrevx.14.031035\">https://doi.org/10.1103/physrevx.14.031035</a>.","mla":"Vermersch, Benoît, et al. “Many-Body Entropies and Entanglement from Polynomially Many Local Measurements.” <i>Physical Review X</i>, vol. 14, no. 3, 031035, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/physrevx.14.031035\">10.1103/physrevx.14.031035</a>."},"has_accepted_license":"1","publication_status":"published","file":[{"date_updated":"2024-09-05T09:39:00Z","file_size":1408836,"content_type":"application/pdf","creator":"cchlebak","date_created":"2024-09-05T09:39:00Z","access_level":"open_access","checksum":"1b114acc89025120727200681e4e9074","relation":"main_file","file_name":"2024_PhysRevX_Vermersch.pdf","file_id":"17532","success":1}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2024","abstract":[{"lang":"eng","text":"Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical postprocessing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix, which allow us to reconstruct entropies and PT moments from information on local subsystems. This identification yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements providing a practical and common measurement scheme, we prove that our protocol requires only polynomially many measurements and postprocessing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators and provide numerical evidence that they are satisfied in more general, physically interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today’s quantum platforms."}],"title":"Many-body entropies and entanglement from polynomially many local measurements","status":"public","OA_place":"publisher","DOAJ_listed":"1","acknowledgement":"B. V. acknowledges funding from the Austrian Science Foundation (Grant No. FWF, P 32597 N), from the French National Research Agency via the JCJC project QRand (Grant No. ANR-20-CE47-0005), and via the research programs Plan France 2030 EPIQ (Grant No. ANR-22-PETQ-0007), QUBITAF (Grant No. ANR-22-PETQ-0004), and HQI (Grant No. ANR-22-PNCQ-0002). M. L. and M. S. acknowledge support by the European Research Council under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899). M. S. acknowledges the hospitality of KITP supported in part by the National Science Foundation under Grants No. NSF PHY-1748958 and No. NSF PHY-2309135. J. I. C. is supported by the Hightech Agenda Bayern Plus through the Munich Quantum Valley and the German Federal Ministry of Education and Research through EQUAHUMO (Grant No. 13N16066). P. Z. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under Grant Agreement No. 101113690 (PASQuanS2.1).","supplementarymaterial":"yes","type":"journal_article","ec_funded":1,"month":"08","isi":1,"date_published":"2024-08-26T00:00:00Z","doi":"10.1103/physrevx.14.031035","arxiv":1,"external_id":{"arxiv":["2311.08108"],"isi":["001299667100002"]},"researchdata_availability":"no","publication_identifier":{"issn":["2160-3308"]},"file_date_updated":"2024-09-05T09:39:00Z","ddc":["530"],"volume":14,"article_type":"original","oa_version":"Published Version","publisher":"American Physical Society","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-04T18:57:11Z","date_updated":"2026-10-16T12:15:28Z","APC_amount":"4863,6 EUR","issue":"3","intvolume":"        14","fulldoi":"https://doi.org/10.1103/physrevx.14.031035","project":[{"call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899"}],"language":[{"iso":"eng"}],"scopus_import":"1","oa":1,"department":[{"_id":"MaSe"}],"author":[{"first_name":"Benoît","last_name":"Vermersch","full_name":"Vermersch, Benoît"},{"orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","last_name":"Ljubotina","full_name":"Ljubotina, Marko"},{"first_name":"J. Ignacio","last_name":"Cirac","full_name":"Cirac, J. Ignacio"},{"full_name":"Zoller, Peter","last_name":"Zoller","first_name":"Peter"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn"},{"last_name":"Piroli","full_name":"Piroli, Lorenzo","first_name":"Lorenzo"}],"OA_type":"gold","article_processing_charge":"Yes","article_number":"031035"}]