--- _id: '7900' abstract: - lang: eng text: Hartree–Fock theory has been justified as a mean-field approximation for fermionic systems. However, it suffers from some defects in predicting physical properties, making necessary a theory of quantum correlations. Recently, bosonization of many-body correlations has been rigorously justified as an upper bound on the correlation energy at high density with weak interactions. We review the bosonic approximation, deriving an effective Hamiltonian. We then show that for systems with Coulomb interaction this effective theory predicts collective excitations (plasmons) in accordance with the random phase approximation of Bohm and Pines, and with experimental observation. article_number: '2060009' article_processing_charge: No article_type: original author: - first_name: Niels P full_name: Benedikter, Niels P id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87 last_name: Benedikter orcid: 0000-0002-1071-6091 citation: ama: Benedikter NP. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 2021;33(1). doi:10.1142/s0129055x20600090 apa: Benedikter, N. P. (2021). Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. World Scientific. https://doi.org/10.1142/s0129055x20600090 chicago: Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews in Mathematical Physics. World Scientific, 2021. https://doi.org/10.1142/s0129055x20600090. ieee: N. P. Benedikter, “Bosonic collective excitations in Fermi gases,” Reviews in Mathematical Physics, vol. 33, no. 1. World Scientific, 2021. ista: Benedikter NP. 2021. Bosonic collective excitations in Fermi gases. Reviews in Mathematical Physics. 33(1), 2060009. mla: Benedikter, Niels P. “Bosonic Collective Excitations in Fermi Gases.” Reviews in Mathematical Physics, vol. 33, no. 1, 2060009, World Scientific, 2021, doi:10.1142/s0129055x20600090. short: N.P. Benedikter, Reviews in Mathematical Physics 33 (2021). date_created: 2020-05-28T16:47:55Z date_published: 2021-01-01T00:00:00Z date_updated: 2023-09-05T16:07:40Z day: '01' department: - _id: RoSe doi: 10.1142/s0129055x20600090 ec_funded: 1 external_id: arxiv: - '1910.08190' isi: - '000613313200010' intvolume: ' 33' isi: 1 issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1910.08190 month: '01' oa: 1 oa_version: Preprint project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: Reviews in Mathematical Physics publication_identifier: eissn: - 1793-6659 issn: - 0129-055X publication_status: published publisher: World Scientific quality_controlled: '1' scopus_import: '1' status: public title: Bosonic collective excitations in Fermi gases type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 33 year: '2021' ... --- _id: '10852' abstract: - lang: eng text: ' We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass.' acknowledgement: This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227). article_number: '2060012' article_processing_charge: No article_type: original author: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Seiringer R. The polaron at strong coupling. Reviews in Mathematical Physics. 2021;33(01). doi:10.1142/s0129055x20600120 apa: Seiringer, R. (2021). The polaron at strong coupling. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x20600120 chicago: Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical Physics. World Scientific Publishing, 2021. https://doi.org/10.1142/s0129055x20600120. ieee: R. Seiringer, “The polaron at strong coupling,” Reviews in Mathematical Physics, vol. 33, no. 01. World Scientific Publishing, 2021. ista: Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012. mla: Seiringer, Robert. “The Polaron at Strong Coupling.” Reviews in Mathematical Physics, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:10.1142/s0129055x20600120. short: R. Seiringer, Reviews in Mathematical Physics 33 (2021). date_created: 2022-03-18T08:11:34Z date_published: 2021-02-01T00:00:00Z date_updated: 2023-09-05T16:08:02Z day: '01' department: - _id: RoSe doi: 10.1142/s0129055x20600120 ec_funded: 1 external_id: arxiv: - '1912.12509' isi: - '000613313200013' intvolume: ' 33' isi: 1 issue: '01' keyword: - Mathematical Physics - Statistical and Nonlinear Physics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1912.12509 month: '02' oa: 1 oa_version: Preprint project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: Reviews in Mathematical Physics publication_identifier: eissn: - 1793-6659 issn: - 0129-055X publication_status: published publisher: World Scientific Publishing quality_controlled: '1' scopus_import: '1' status: public title: The polaron at strong coupling type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 33 year: '2021' ... --- _id: '9056' abstract: - lang: eng text: "In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Georg F full_name: Osang, Georg F id: 464B40D6-F248-11E8-B48F-1D18A9856A87 last_name: Osang orcid: 0000-0002-8882-5116 citation: ama: Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:10.15479/AT:ISTA:9056 apa: Osang, G. F. (2021). Multi-cover persistence and Delaunay mosaics. Institute of Science and Technology Austria, Klosterneuburg. https://doi.org/10.15479/AT:ISTA:9056 chicago: Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9056. ieee: G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021. ista: 'Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria.' mla: Osang, Georg F. Multi-Cover Persistence and Delaunay Mosaics. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9056. short: G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021. date_created: 2021-02-02T14:11:06Z date_published: 2021-02-01T00:00:00Z date_updated: 2023-09-07T13:29:01Z day: '01' ddc: - '006' - '514' - '516' degree_awarded: PhD department: - _id: HeEd - _id: GradSch doi: 10.15479/AT:ISTA:9056 file: - access_level: closed checksum: bcf27986147cab0533b6abadd74e7629 content_type: application/zip creator: patrickd date_created: 2021-02-02T14:09:25Z date_updated: 2021-02-03T10:37:28Z file_id: '9063' file_name: thesis_source.zip file_size: 13446994 relation: source_file - access_level: open_access checksum: 9cc8af266579a464385bbe2aff6af606 content_type: application/pdf creator: patrickd date_created: 2021-02-02T14:09:18Z date_updated: 2021-02-02T14:09:18Z file_id: '9064' file_name: thesis_pdfA2b.pdf file_size: 5210329 relation: main_file success: 1 file_date_updated: 2021-02-03T10:37:28Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '02' oa: 1 oa_version: Published Version page: '134' place: Klosterneuburg publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '187' relation: part_of_dissertation status: public - id: '8703' relation: part_of_dissertation status: public status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Multi-cover persistence and Delaunay mosaics tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9022' abstract: - lang: eng text: "In the first part of the thesis we consider Hermitian random matrices. Firstly, we consider sample covariance matrices XX∗ with X having independent identically distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences of linear statistics of XX∗ and its minor after removing the first column of X. Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics near cusp singularities of the limiting density of states are universal and that they form a Pearcey process. Since the limiting eigenvalue distribution admits only square root (edge) and cubic root (cusp) singularities, this concludes the third and last remaining case of the Wigner-Dyson-Mehta universality conjecture. The main technical ingredients are an optimal local law at the cusp, and the proof of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp regime.\r\nIn the second part we consider non-Hermitian matrices X with centred i.i.d. entries. We normalise the entries of X to have variance N −1. It is well known that the empirical eigenvalue density converges to the uniform distribution on the unit disk (circular law). In the first project, we prove universality of the local eigenvalue statistics close to the edge of the spectrum. This is the non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck flow for very long time\r\n(up to t = +∞). In the second project, we consider linear statistics of eigenvalues for macroscopic test functions f in the Sobolev space H2+ϵ and prove their convergence to the projection of the Gaussian Free Field on the unit disk. We prove this result for non-Hermitian matrices with real or complex entries. The main technical ingredients are: (i) local law for products of two resolvents at different spectral parameters, (ii) analysis of correlated Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically rigorous application of supersymmetric techniques (SUSY ) to give a lower tail estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we use superbosonisation formula to give an integral representation of the resolvent of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex and real case, respectively. The rigorous analysis of these integrals is quite challenging since simple saddle point analysis cannot be applied (the main contribution comes from a non-trivial manifold). Our result\r\nimproves classical smoothing inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality for i.i.d. non-Hermitian matrices." acknowledgement: I gratefully acknowledge the financial support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 citation: ama: Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022 apa: Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022 chicago: Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022. ieee: G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute of Science and Technology Austria, 2021. ista: Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute of Science and Technology Austria. mla: Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022. short: G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute of Science and Technology Austria, 2021. date_created: 2021-01-21T18:16:54Z date_published: 2021-01-25T00:00:00Z date_updated: 2023-09-07T13:29:32Z day: '25' ddc: - '510' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/AT:ISTA:9022 ec_funded: 1 file: - access_level: open_access checksum: 5a93658a5f19478372523ee232887e2b content_type: application/pdf creator: gcipollo date_created: 2021-01-25T14:19:03Z date_updated: 2021-01-25T14:19:03Z file_id: '9043' file_name: thesis.pdf file_size: 4127796 relation: main_file success: 1 - access_level: closed checksum: e8270eddfe6a988e92a53c88d1d19b8c content_type: application/zip creator: gcipollo date_created: 2021-01-25T14:19:10Z date_updated: 2021-01-25T14:19:10Z file_id: '9044' file_name: Thesis_files.zip file_size: 12775206 relation: source_file file_date_updated: 2021-01-25T14:19:10Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '380' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: Fluctuations in the spectrum of random matrices type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9416' abstract: - lang: eng text: 'We study the inductive bias of two-layer ReLU networks trained by gradient flow. We identify a class of easy-to-learn (`orthogonally separable'') datasets, and characterise the solution that ReLU networks trained on such datasets converge to. Irrespective of network width, the solution turns out to be a combination of two max-margin classifiers: one corresponding to the positive data subset and one corresponding to the negative data subset. The proof is based on the recently introduced concept of extremal sectors, for which we prove a number of properties in the context of orthogonal separability. In particular, we prove stationarity of activation patterns from some time onwards, which enables a reduction of the ReLU network to an ensemble of linear subnetworks.' article_processing_charge: No author: - first_name: Phuong full_name: Bui Thi Mai, Phuong id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87 last_name: Bui Thi Mai - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable data. In: 9th International Conference on Learning Representations. ; 2021.' apa: Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on orthogonally separable data. In 9th International Conference on Learning Representations. Virtual. chicago: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” In 9th International Conference on Learning Representations, 2021. ieee: M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally separable data,” in 9th International Conference on Learning Representations, Virtual, 2021. ista: 'Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally separable data. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on Orthogonally Separable Data.” 9th International Conference on Learning Representations, 2021. short: M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations, 2021. conference: end_date: 2021-05-07 location: Virtual name: ' ICLR: International Conference on Learning Representations' start_date: 2021-05-03 date_created: 2021-05-24T11:16:46Z date_published: 2021-05-01T00:00:00Z date_updated: 2023-09-07T13:29:50Z day: '01' ddc: - '000' department: - _id: GradSch - _id: ChLa file: - access_level: open_access checksum: f34ff17017527db5ba6927f817bdd125 content_type: application/pdf creator: bphuong date_created: 2021-05-24T11:15:57Z date_updated: 2021-05-24T11:15:57Z file_id: '9417' file_name: iclr2021_conference.pdf file_size: 502356 relation: main_file file_date_updated: 2021-05-24T11:15:57Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/pdf?id=krz7T0xU9Z_ month: '05' oa: 1 oa_version: Published Version publication: 9th International Conference on Learning Representations publication_status: published quality_controlled: '1' related_material: record: - id: '9418' relation: dissertation_contains status: public scopus_import: '1' status: public title: The inductive bias of ReLU networks on orthogonally separable data type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _id: '9225' abstract: - lang: eng text: "The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere, we provide a class of initial data for which the associated effective Hamiltonian\r\nhas a uniform spectral gap for all times. For such initial data, this allows us to extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations and their derivation\r\nfrom the Fröhlich model obtained in previous works to larger times." acknowledgement: Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged. Open Access funding provided by Institute of Science and Technology (IST Austria) article_number: '19' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 - first_name: Simone Anna Elvira full_name: Rademacher, Simone Anna Elvira id: 856966FE-A408-11E9-977E-802DE6697425 last_name: Rademacher orcid: 0000-0001-5059-4466 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 2021;111. doi:10.1007/s11005-020-01350-5 apa: Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (2021). Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-020-01350-5 chicago: Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-020-01350-5. ieee: D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the spectral gap for the Landau–Pekar equations,” Letters in Mathematical Physics, vol. 111. Springer Nature, 2021. ista: Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19. mla: Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in Mathematical Physics, vol. 111, 19, Springer Nature, 2021, doi:10.1007/s11005-020-01350-5. short: D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical Physics 111 (2021). date_created: 2021-03-07T23:01:25Z date_published: 2021-02-11T00:00:00Z date_updated: 2023-09-07T13:30:11Z day: '11' ddc: - '510' department: - _id: RoSe doi: 10.1007/s11005-020-01350-5 ec_funded: 1 external_id: isi: - '000617195700001' file: - access_level: open_access checksum: ffbfe1aad623bce7ff529c207e343b53 content_type: application/pdf creator: dernst date_created: 2021-03-09T11:44:34Z date_updated: 2021-03-09T11:44:34Z file_id: '9232' file_name: 2021_LettersMathPhysics_Feliciangeli.pdf file_size: 391205 relation: main_file success: 1 file_date_updated: 2021-03-09T11:44:34Z has_accepted_license: '1' intvolume: ' 111' isi: 1 language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Letters in Mathematical Physics publication_identifier: eissn: - '15730530' issn: - '03779017' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '9733' relation: dissertation_contains status: public scopus_import: '1' status: public title: Persistence of the spectral gap for the Landau–Pekar equations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 111 year: '2021' ... --- _id: '9787' abstract: - lang: eng text: We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging. acknowledgement: "Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n" article_number: '2101.12566' article_processing_charge: No author: - first_name: Dario full_name: Feliciangeli, Dario id: 41A639AA-F248-11E8-B48F-1D18A9856A87 last_name: Feliciangeli orcid: 0000-0003-0754-8530 - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv.' apa: 'Feliciangeli, D., & Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv.' chicago: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, n.d.' ieee: 'D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” arXiv. .' ista: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.' mla: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, 2101.12566.' short: D. Feliciangeli, R. Seiringer, ArXiv (n.d.). date_created: 2021-08-06T08:25:57Z date_published: 2021-02-01T00:00:00Z date_updated: 2023-09-07T13:30:10Z day: '01' ddc: - '510' department: - _id: RoSe ec_funded: 1 external_id: arxiv: - '2101.12566' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2101.12566 month: '02' oa: 1 oa_version: Preprint project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: arXiv publication_status: submitted related_material: record: - id: '10224' relation: later_version status: public - id: '9733' relation: dissertation_contains status: public status: public title: 'The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 year: '2021' ... --- _id: '9987' abstract: - lang: eng text: 'Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thread interleavings, SMC attempts to partition this space into equivalence classes and explore only a few representatives from each class. The efficiency of this approach depends on two factors: (a) the coarseness of the partitioning, and (b) the time to generate representatives in each class. For this reason, the search for coarse partitionings that are efficiently explorable is an active research challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are deemed equivalent if they agree on the value obtained in each read event, and read events induce consistent causal orderings between them. The RVF partitioning is provably coarser than recent approaches based on Mazurkiewicz and “reads-from” partitionings. Our experimental evaluation reveals that RVF is quite often a very effective equivalence, as the underlying partitioning is exponentially coarser than other approaches. Moreover, RVF-SMC generates representatives very efficiently, as the reduction in the partitioning is often met with significant speed-ups in the model checking task.' acknowledgement: The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science and Technology Fund (WWTF) through project ICT15-003. alternative_title: - LNCS article_processing_charge: Yes author: - first_name: Pratyush full_name: Agarwal, Pratyush last_name: Agarwal - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Shreya full_name: Pathak, Shreya last_name: Pathak - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16' apa: 'Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16' chicago: Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.” In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16. ieee: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366. ista: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless model checking under a reads-value-from equivalence. 33rd International Conference on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol. 12759, 341–366.' mla: Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16. short: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366. conference: end_date: 2021-07-23 location: Virtual name: 'CAV: Computer Aided Verification ' start_date: 2021-07-20 date_created: 2021-09-05T22:01:24Z date_published: 2021-07-15T00:00:00Z date_updated: 2023-09-07T13:30:27Z day: '15' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-030-81685-8_16 ec_funded: 1 external_id: arxiv: - '2105.06424' isi: - '000698732400016' file: - access_level: open_access checksum: 4b346e5fbaa8b9bdf107819c7b2aadee content_type: application/pdf creator: dernst date_created: 2022-05-13T07:00:20Z date_updated: 2022-05-13T07:00:20Z file_id: '11368' file_name: 2021_LNCS_Agarwal.pdf file_size: 1516756 relation: main_file success: 1 file_date_updated: 2022-05-13T07:00:20Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 341-366 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: '33rd International Conference on Computer-Aided Verification ' publication_identifier: eisbn: - 978-3-030-81685-8 eissn: - 1611-3349 isbn: - 978-3-030-81684-1 issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: Stateless model checking under a reads-value-from equivalence tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: '12759 ' year: '2021' ... --- _id: '10007' abstract: - lang: eng text: The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 citation: ama: 'Hensel S. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. 2021. doi:10.15479/at:ista:10007' apa: 'Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007' chicago: 'Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10007.' ieee: 'S. Hensel, “Curvature driven interface evolution: Uniqueness properties of weak solution concepts,” Institute of Science and Technology Austria, 2021.' ista: 'Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties of weak solution concepts. Institute of Science and Technology Austria.' mla: 'Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10007.' short: 'S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of Weak Solution Concepts, Institute of Science and Technology Austria, 2021.' date_created: 2021-09-13T11:12:34Z date_published: 2021-09-14T00:00:00Z date_updated: 2023-09-07T13:30:45Z day: '14' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JuFi doi: 10.15479/at:ista:10007 ec_funded: 1 file: - access_level: closed checksum: c8475faaf0b680b4971f638f1db16347 content_type: application/x-zip-compressed creator: shensel date_created: 2021-09-13T11:03:24Z date_updated: 2021-09-15T14:37:30Z file_id: '10008' file_name: thesis_final_Hensel.zip file_size: 15022154 relation: source_file - access_level: open_access checksum: 1a609937aa5275452822f45f2da17f07 content_type: application/pdf creator: shensel date_created: 2021-09-13T14:18:56Z date_updated: 2021-09-14T09:52:47Z file_id: '10014' file_name: thesis_final_Hensel.pdf file_size: 6583638 relation: main_file file_date_updated: 2021-09-15T14:37:30Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '300' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10012' relation: part_of_dissertation status: public - id: '10013' relation: part_of_dissertation status: public - id: '7489' relation: part_of_dissertation status: public status: public supervisor: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X title: 'Curvature driven interface evolution: Uniqueness properties of weak solution concepts' type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10191' abstract: - lang: eng text: "In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task.\r\n\r\n" acknowledgement: "The research was partially funded by the ERC CoG 863818 (ForM-SMArt) and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003." article_number: '164' article_processing_charge: No article_type: original author: - first_name: Truc Lam full_name: Bui, Truc Lam last_name: Bui - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Tushar full_name: Gautam, Tushar last_name: Gautam - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Viktor full_name: Toman, Viktor id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87 last_name: Toman orcid: 0000-0001-9036-063X citation: ama: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541 apa: Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541 chicago: Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485541. ieee: T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021. ista: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 5(OOPSLA), 164. mla: Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541. short: T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021). date_created: 2021-10-27T15:05:34Z date_published: 2021-10-15T00:00:00Z date_updated: 2023-09-07T13:30:27Z day: '15' ddc: - '000' department: - _id: GradSch - _id: KrCh doi: 10.1145/3485541 ec_funded: 1 external_id: arxiv: - '2011.11763' file: - access_level: open_access checksum: 9d6dce7b611853c529bb7b1915ac579e content_type: application/pdf creator: cchlebak date_created: 2021-11-04T07:24:48Z date_updated: 2021-11-04T07:24:48Z file_id: '10215' file_name: 2021_ProcACMPL_Bui.pdf file_size: 2903485 relation: main_file success: 1 file_date_updated: 2021-11-04T07:24:48Z has_accepted_license: '1' intvolume: ' 5' issue: OOPSLA keyword: - safety - risk - reliability and quality - software language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '10199' relation: dissertation_contains status: public scopus_import: '1' status: public title: The reads-from equivalence for the TSO and PSO memory models tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 5 year: '2021' ... --- _id: '10013' abstract: - lang: eng text: We derive a weak-strong uniqueness principle for BV solutions to multiphase mean curvature flow of triple line clusters in three dimensions. Our proof is based on the explicit construction of a gradient-flow calibration in the sense of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster. This extends the two-dimensional construction to the three-dimensional case of surfaces meeting along triple junctions. acknowledgement: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. article_number: '2108.01733' article_processing_charge: No author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tim full_name: Laux, Tim last_name: Laux citation: ama: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. doi:10.48550/arXiv.2108.01733 apa: Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733 chicago: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733. ieee: S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow of double bubbles,” arXiv. . ista: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double bubbles. arXiv, 2108.01733. mla: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733. short: S. Hensel, T. Laux, ArXiv (n.d.). date_created: 2021-09-13T12:17:11Z date_published: 2021-08-03T00:00:00Z date_updated: 2023-09-07T13:30:45Z day: '03' department: - _id: JuFi doi: 10.48550/arXiv.2108.01733 ec_funded: 1 external_id: arxiv: - '2108.01733' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2108.01733 month: '08' oa: 1 oa_version: Preprint project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication: arXiv publication_status: submitted related_material: record: - id: '13043' relation: later_version status: public - id: '10007' relation: dissertation_contains status: public status: public title: Weak-strong uniqueness for the mean curvature flow of double bubbles type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _id: '9928' abstract: - lang: eng text: There are two elementary superconducting qubit types that derive directly from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear Josephson junction to realize the widely used charge qubits with a compact phase variable and a discrete charge wave function. In the other, the junction is added in parallel, which gives rise to an extended phase variable, continuous wave functions, and a rich energy-level structure due to the loop topology. While the corresponding rf superconducting quantum interference device Hamiltonian was introduced as a quadratic quasi-one-dimensional potential approximation to describe the fluxonium qubit implemented with long Josephson-junction arrays, in this work we implement it directly using a linear superinductor formed by a single uninterrupted aluminum wire. We present a large variety of qubits, all stemming from the same circuit but with drastically different characteristic energy scales. This includes flux and fluxonium qubits but also the recently introduced quasicharge qubit with strongly enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion. The use of a geometric inductor results in high reproducibility of the inductive energy as guaranteed by top-down lithography—a key ingredient for intrinsically protected superconducting qubits. acknowledged_ssus: - _id: NanoFab - _id: M-Shop acknowledgement: We thank W. Hughes for analytic and numerical modeling during the early stages of this work, J. Koch for discussions and support with the scqubits package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros for equipment support, as well as the MIBA workshop and the Institute of Science and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise, and E. Flurin for discussions. This work was supported by a NOMIS Foundation research grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria. M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria. article_processing_charge: No article_type: original author: - first_name: Matilda full_name: Peruzzo, Matilda id: 3F920B30-F248-11E8-B48F-1D18A9856A87 last_name: Peruzzo orcid: 0000-0002-3415-4628 - first_name: Farid full_name: Hassani, Farid id: 2AED110C-F248-11E8-B48F-1D18A9856A87 last_name: Hassani orcid: 0000-0001-6937-5773 - first_name: Gregory full_name: Szep, Gregory last_name: Szep - first_name: Andrea full_name: Trioni, Andrea id: 42F71B44-F248-11E8-B48F-1D18A9856A87 last_name: Trioni - first_name: Elena full_name: Redchenko, Elena id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87 last_name: Redchenko - first_name: Martin full_name: Zemlicka, Martin id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87 last_name: Zemlicka - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: 'Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2021;2(4):040341. doi:10.1103/PRXQuantum.2.040341' apa: 'Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M., & Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. American Physical Society. https://doi.org/10.1103/PRXQuantum.2.040341' chicago: 'Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko, Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” PRX Quantum. American Physical Society, 2021. https://doi.org/10.1103/PRXQuantum.2.040341.' ieee: 'M. Peruzzo et al., “Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction,” PRX Quantum, vol. 2, no. 4. American Physical Society, p. 040341, 2021.' ista: 'Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM. 2021. Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction. PRX Quantum. 2(4), 040341.' mla: 'Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase Delocalization across a Single Josephson Junction.” PRX Quantum, vol. 2, no. 4, American Physical Society, 2021, p. 040341, doi:10.1103/PRXQuantum.2.040341.' short: M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M. Fink, PRX Quantum 2 (2021) 040341. date_created: 2021-08-17T08:14:18Z date_published: 2021-11-24T00:00:00Z date_updated: 2023-09-07T13:31:22Z day: '24' ddc: - '530' department: - _id: JoFi - _id: NanoFab - _id: M-Shop doi: 10.1103/PRXQuantum.2.040341 ec_funded: 1 external_id: arxiv: - '2106.05882' isi: - '000723015100001' file: - access_level: open_access checksum: 36eb41ea43d8ca22b0efab12419e4eb2 content_type: application/pdf creator: cchlebak date_created: 2022-01-18T11:29:33Z date_updated: 2022-01-18T11:29:33Z file_id: '10641' file_name: 2021_PRXQuantum_Peruzzo.pdf file_size: 4247422 relation: main_file success: 1 file_date_updated: 2022-01-18T11:29:33Z has_accepted_license: '1' intvolume: ' 2' isi: 1 issue: '4' keyword: - quantum physics - mesoscale and nanoscale physics language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: '040341' project: - _id: 26927A52-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: F07105 name: Integrating superconducting quantum circuits - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 2622978C-B435-11E9-9278-68D0E5697425 name: Hybrid Semiconductor - Superconductor Quantum Devices publication: PRX Quantum publication_identifier: eissn: - 2691-3399 publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: record: - id: '13057' relation: research_data status: public - id: '9920' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Geometric superinductance qubits: Controlling phase delocalization across a single Josephson junction' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 2 year: '2021' ... --- _id: '10030' abstract: - lang: eng text: "This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning\r\nnon-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces." acknowledged_ssus: - _id: M-Shop - _id: NanoFab acknowledgement: The author gratefully acknowledges support by the Austrian Science Fund (FWF), grants No W1245. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lorenzo full_name: Portinale, Lorenzo id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87 last_name: Portinale citation: ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. 2021. doi:10.15479/at:ista:10030 apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10030 chicago: Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10030. ieee: L. Portinale, “Discrete-to-continuum limits of transport problems and gradient flows in the space of measures,” Institute of Science and Technology Austria, 2021. ista: Portinale L. 2021. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures. Institute of Science and Technology Austria. mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10030. short: L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient Flows in the Space of Measures, Institute of Science and Technology Austria, 2021. date_created: 2021-09-21T09:14:15Z date_published: 2021-09-22T00:00:00Z date_updated: 2023-09-07T13:31:06Z day: '22' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JaMa doi: 10.15479/at:ista:10030 file: - access_level: closed checksum: 8cd60dcb8762e8f21867e21e8001e183 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-09-21T09:17:34Z date_updated: 2022-03-10T12:14:42Z file_id: '10032' file_name: tex_and_pictures.zip file_size: 3876668 relation: source_file - access_level: open_access checksum: 9789e9d967c853c1503ec7f307170279 content_type: application/pdf creator: cchlebak date_created: 2021-09-27T11:14:31Z date_updated: 2021-09-27T11:14:31Z file_id: '10047' file_name: thesis_portinale_Final (1).pdf file_size: 2532673 relation: main_file file_date_updated: 2022-03-10T12:14:42Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 260788DE-B435-11E9-9278-68D0E5697425 call_identifier: FWF name: Dissipation and Dispersion in Nonlinear Partial Differential Equations - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '10022' relation: part_of_dissertation status: public - id: '9792' relation: part_of_dissertation status: public - id: '7573' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 title: Discrete-to-continuum limits of transport problems and gradient flows in the space of measures tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9920' abstract: - lang: eng text: 'This work is concerned with two fascinating circuit quantum electrodynamics components, the Josephson junction and the geometric superinductor, and the interesting experiments that can be done by combining the two. The Josephson junction has revolutionized the field of superconducting circuits as a non-linear dissipation-less circuit element and is used in almost all superconducting qubit implementations since the 90s. On the other hand, the superinductor is a relatively new circuit element introduced as a key component of the fluxonium qubit in 2009. This is an inductor with characteristic impedance larger than the resistance quantum and self-resonance frequency in the GHz regime. The combination of these two elements can occur in two fundamental ways: in parallel and in series. When connected in parallel the two create the fluxonium qubit, a loop with large inductance and a rich energy spectrum reliant on quantum tunneling. On the other hand placing the two elements in series aids with the measurement of the IV curve of a single Josephson junction in a high impedance environment. In this limit theory predicts that the junction will behave as its dual element: the phase-slip junction. While the Josephson junction acts as a non-linear inductor the phase-slip junction has the behavior of a non-linear capacitance and can be used to measure new Josephson junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch oscillations. The latter experiment allows for a direct link between frequency and current which is an elusive connection in quantum metrology. This work introduces the geometric superinductor, a superconducting circuit element where the high inductance is due to the geometry rather than the material properties of the superconductor, realized from a highly miniaturized superconducting planar coil. These structures will be described and characterized as resonators and qubit inductors and progress towards the measurement of phase-locked Bloch oscillations will be presented.' acknowledged_ssus: - _id: NanoFab - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Matilda full_name: Peruzzo, Matilda id: 3F920B30-F248-11E8-B48F-1D18A9856A87 last_name: Peruzzo orcid: 0000-0002-3415-4628 citation: ama: Peruzzo M. Geometric superinductors and their applications in circuit quantum electrodynamics. 2021. doi:10.15479/at:ista:9920 apa: Peruzzo, M. (2021). Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9920 chicago: Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9920. ieee: M. Peruzzo, “Geometric superinductors and their applications in circuit quantum electrodynamics,” Institute of Science and Technology Austria, 2021. ista: Peruzzo M. 2021. Geometric superinductors and their applications in circuit quantum electrodynamics. Institute of Science and Technology Austria. mla: Peruzzo, Matilda. Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9920. short: M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum Electrodynamics, Institute of Science and Technology Austria, 2021. date_created: 2021-08-16T09:44:09Z date_published: 2021-08-19T00:00:00Z date_updated: 2023-09-07T13:31:22Z day: '19' ddc: - '539' degree_awarded: PhD department: - _id: GradSch - _id: JoFi doi: 10.15479/at:ista:9920 file: - access_level: closed checksum: 3cd1986efde5121d7581f6fcf9090da8 content_type: application/x-zip-compressed creator: mperuzzo date_created: 2021-08-16T09:33:21Z date_updated: 2021-09-06T08:39:47Z file_id: '9924' file_name: GeometricSuperinductorsForCQED.zip file_size: 151387283 relation: source_file - access_level: open_access checksum: 50928c621cdf0775d7a5906b9dc8602c content_type: application/pdf creator: mperuzzo date_created: 2021-08-18T14:20:06Z date_updated: 2021-09-06T08:39:47Z file_id: '9939' file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf file_size: 17596344 relation: main_file - access_level: closed checksum: 37f486aa1b622fe44af00d627ec13f6c content_type: application/pdf creator: mperuzzo date_created: 2021-08-18T14:20:09Z date_updated: 2021-09-06T08:39:47Z description: Extra copy of the thesis as PDF/A-2b file_id: '9940' file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf file_size: 17592425 relation: other file_date_updated: 2021-09-06T08:39:47Z has_accepted_license: '1' keyword: - quantum computing - superinductor - quantum metrology language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '149' publication_identifier: isbn: - 978-3-99078-013-8 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9928' relation: part_of_dissertation status: public - id: '8755' relation: part_of_dissertation status: public status: public supervisor: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X title: Geometric superinductors and their applications in circuit quantum electrodynamics type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10432' abstract: - lang: eng text: One key element behind the recent progress of machine learning has been the ability to train machine learning models in large-scale distributed shared-memory and message-passing environments. Most of these models are trained employing variants of stochastic gradient descent (SGD) based optimization, but most methods involve some type of consistency relaxation relative to sequential SGD, to mitigate its large communication or synchronization costs at scale. In this paper, we introduce a general consistency condition covering communication-reduced and asynchronous distributed SGD implementations. Our framework, called elastic consistency, decouples the system-specific aspects of the implementation from the SGD convergence requirements, giving a general way to obtain convergence bounds for a wide variety of distributed SGD methods used in practice. Elastic consistency can be used to re-derive or improve several previous convergence bounds in message-passing and shared-memory settings, but also to analyze new models and distribution schemes. As a direct application, we propose and analyze a new synchronization-avoiding scheduling scheme for distributed SGD, and show that it can be used to efficiently train deep convolutional models for image classification. acknowledgement: "We would like to thank Christopher De Sa for his feedback on an earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful comments. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus)." article_processing_charge: No author: - first_name: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Bapi full_name: Chatterjee, Bapi id: 3C41A08A-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-2742-4028 - first_name: 'Vyacheslav ' full_name: 'Kungurtsev, Vyacheslav ' last_name: Kungurtsev - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. ; 2021:9037-9045.' apa: 'Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2021). Elastic consistency: A practical consistency model for distributed stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 9037–9045). Virtual.' chicago: 'Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:9037–45, 2021.' ieee: 'G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Elastic consistency: A practical consistency model for distributed stochastic gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.' ista: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic consistency: A practical consistency model for distributed stochastic gradient descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.' mla: 'Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.' short: G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045. conference: end_date: 2021-02-09 location: Virtual name: 'AAAI: Association for the Advancement of Artificial Intelligence' start_date: 2021-02-02 date_created: 2021-12-09T09:21:35Z date_published: 2021-05-18T00:00:00Z date_updated: 2023-09-07T13:31:39Z day: '18' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '2001.05918' intvolume: ' 35' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://ojs.aaai.org/index.php/AAAI/article/view/17092 month: '05' oa: 1 oa_version: Published Version page: 9037-9045 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the AAAI Conference on Artificial Intelligence publication_status: published quality_controlled: '1' related_material: record: - id: '10429' relation: dissertation_contains status: public status: public title: 'Elastic consistency: A practical consistency model for distributed stochastic gradient descent' type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 35 year: '2021' ... --- _id: '10041' abstract: - lang: eng text: Yao’s garbling scheme is one of the most fundamental cryptographic constructions. Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security in the selective setting where the adversary chooses the challenge inputs before seeing the garbled circuit assuming secure symmetric-key encryption (and hence one-way functions). This was followed by results, both positive and negative, concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto 2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s scheme (where the output mapping is sent in the online phase, together with the garbled input) that circumvents this negative result, and proved that it is adaptively secure, at least for shallow circuits. In particular, they showed that for the class of circuits of depth δ , the loss in security is at most exponential in δ . The above results all concern the simulation-based notion of security. In this work, we show that the upper bound of Jafargholi and Wichs is basically optimal in a strong sense. As our main result, we show that there exists a family of Boolean circuits, one for each depth δ∈N , such that any black-box reduction proving the adaptive indistinguishability of the natural adaptation of Yao’s scheme from any symmetric-key encryption has to lose a factor that is exponential in δ√ . Since indistinguishability is a weaker notion than simulation, our bound also applies to adaptive simulation. To establish our results, we build on the recent approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction with oracle separations to prove fine-grained lower bounds on loss in cryptographic security. acknowledgement: We would like to thank the anonymous reviewers of Crypto’21 whose detailed comments helped us considerably improve the presentation of the paper. alternative_title: - LCNS article_processing_charge: No author: - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Daniel full_name: Wichs, Daniel last_name: Wichs citation: ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17' apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II (Vol. 12826, pp. 486–515). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-84245-1_17' chicago: 'Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In 41st Annual International Cryptology Conference, Part II , 12826:486–515. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-84245-1_17.' ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515. ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.' mla: Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17. short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515. conference: end_date: 2021-08-20 location: Virtual name: 'CRYPTO: Annual International Cryptology Conference' start_date: 2021-08-16 date_created: 2021-09-23T14:06:15Z date_published: 2021-08-11T00:00:00Z date_updated: 2023-09-07T13:32:11Z day: '11' department: - _id: KrPi doi: 10.1007/978-3-030-84245-1_17 ec_funded: 1 intvolume: ' 12826' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2021/945 month: '08' oa: 1 oa_version: Preprint page: 486-515 place: Cham project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: '41st Annual International Cryptology Conference, Part II ' publication_identifier: eisbn: - 978-3-030-84245-1 eissn: - 1611-3349 isbn: - 978-3-030-84244-4 issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '10035' relation: dissertation_contains status: public status: public title: Limits on the Adaptive Security of Yao’s Garbling type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 12826 year: '2021' ... --- _id: '10049' abstract: - lang: eng text: While messaging systems with strong security guarantees are widely used in practice, designing a protocol that scales efficiently to large groups and enjoys similar security guarantees remains largely open. The two existing proposals to date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer Security Protocol, draft). TreeKEM is the currently considered candidate by the IETF MLS working group, but dynamic group operations (i.e. adding and removing users) can cause efficiency issues. In this paper we formalize and analyze a variant of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying TTKEM was suggested by Millican (MLS mailing list, February 2018). This version is more efficient than TreeKEM for some natural distributions of group operations, we quantify this through simulations.Our second contribution is two security proofs for TTKEM which establish post compromise and forward secrecy even against adaptive attackers. The security loss (to the underlying PKE) in the Random Oracle Model is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like protocol establishing tight security against an adversary who can adaptively choose the sequence of operations was known. We also are the first to prove (or even formalize) active security where the server can arbitrarily deviate from the protocol specification. Proving fully active security – where also the users can arbitrarily deviate – remains open. acknowledgement: The first three authors contributed equally to this work. Funded by the European Research Council (ERC) under the European Union’s Horizon2020 research and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.665385. article_processing_charge: No author: - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein - first_name: Guillermo full_name: Pascual Perez, Guillermo id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87 last_name: Pascual Perez orcid: 0000-0001-8630-415X - first_name: Michael full_name: Walter, Michael id: 488F98B0-F248-11E8-B48F-1D18A9856A87 last_name: Walter orcid: 0000-0003-3186-2482 - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg - first_name: Margarita full_name: Capretto, Margarita last_name: Capretto - first_name: Miguel full_name: Cueto Noval, Miguel id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc last_name: Cueto Noval - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Michelle X full_name: Yeo, Michelle X id: 2D82B818-F248-11E8-B48F-1D18A9856A87 last_name: Yeo - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035' apa: 'Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy (pp. 268–284). San Francisco, CA, United States: IEEE. https://doi.org/10.1109/sp40001.2021.00035' chicago: 'Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035.' ieee: 'K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.' ista: 'Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.' mla: 'Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.' short: K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284. conference: end_date: 2021-05-27 location: San Francisco, CA, United States name: 'SP: Symposium on Security and Privacy' start_date: 2021-05-24 date_created: 2021-09-27T13:46:27Z date_published: 2021-08-26T00:00:00Z date_updated: 2023-09-07T13:32:11Z day: '26' department: - _id: KrPi - _id: DaAl doi: 10.1109/sp40001.2021.00035 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/1489 month: '08' oa: 1 oa_version: Preprint page: 268-284 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: '2021 IEEE Symposium on Security and Privacy ' publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '10035' relation: dissertation_contains status: public status: public title: 'Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement' type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2021' ... --- _id: '10044' abstract: - lang: eng text: We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity. acknowledgement: 'We would like to thank Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. ' article_number: 2021/926 article_processing_charge: No author: - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg - first_name: Karen full_name: Klein, Karen id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87 last_name: Klein - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.' apa: 'Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.' chicago: Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021. ieee: C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021. ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.' mla: Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021. short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021. conference: end_date: 2021-11-11 location: Raleigh, NC, United States name: 'TCC: Theory of Cryptography Conference' start_date: 2021-11-08 date_created: 2021-09-24T12:01:34Z date_published: 2021-07-08T00:00:00Z date_updated: 2023-09-07T13:32:11Z day: '08' department: - _id: KrPi ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2021/926 month: '07' oa: 1 oa_version: Preprint project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 19th Theory of Cryptography Conference 2021 publication_status: published publisher: International Association for Cryptologic Research quality_controlled: '1' related_material: record: - id: '10409' relation: later_version status: public - id: '10035' relation: dissertation_contains status: public status: public title: On treewidth, separators and Yao's garbling type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2021' ... --- _id: '10422' abstract: - lang: eng text: Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems. alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Anton full_name: Piankov, Anton id: 865E3C26-AA8C-11E9-A409-C4C4E5697425 last_name: Piankov citation: ama: Piankov A. Towards designer materials using customizable particle shape. 2021. doi:10.15479/at:ista:10422 apa: Piankov, A. (2021). Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422 chicago: Piankov, Anton. “Towards Designer Materials Using Customizable Particle Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422. ieee: A. Piankov, “Towards designer materials using customizable particle shape,” Institute of Science and Technology Austria, 2021. ista: Piankov A. 2021. Towards designer materials using customizable particle shape. Institute of Science and Technology Austria. mla: Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422. short: A. Piankov, Towards Designer Materials Using Customizable Particle Shape, Institute of Science and Technology Austria, 2021. date_created: 2021-12-07T10:48:06Z date_published: 2021-12-07T00:00:00Z date_updated: 2023-09-07T13:34:12Z day: '07' ddc: - '530' degree_awarded: MS department: - _id: GradSch - _id: CaGo doi: 10.15479/at:ista:10422 file: - access_level: closed checksum: 114e8f4b2c002c6c352416c12de2c695 content_type: application/x-zip-compressed creator: cchlebak date_created: 2021-12-07T11:13:52Z date_updated: 2022-03-10T12:10:25Z file_id: '10424' file_name: Thesis.zip file_size: 394018 relation: source_file - access_level: closed checksum: cd15ae991ced352a9959815f794e657c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2021-12-07T11:14:01Z date_updated: 2022-03-10T12:10:25Z file_id: '10425' file_name: Preliminary_pages_Piankov.docx file_size: 47638 relation: source_file - access_level: open_access checksum: e6899c798b75ba42fab9822bce309050 content_type: application/pdf creator: cchlebak date_created: 2021-12-07T11:20:35Z date_updated: 2021-12-07T11:20:35Z file_id: '10426' file_name: 2021_Piankov_combined.pdf file_size: 484965 relation: main_file success: 1 file_date_updated: 2022-03-10T12:10:25Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 title: Towards designer materials using customizable particle shape type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10803' abstract: - lang: eng text: Given the abundance of applications of ranking in recent years, addressing fairness concerns around automated ranking systems becomes necessary for increasing the trust among end-users. Previous work on fair ranking has mostly focused on application-specific fairness notions, often tailored to online advertising, and it rarely considers learning as part of the process. In this work, we show how to transfer numerous fairness notions from binary classification to a learning to rank setting. Our formalism allows us to design methods for incorporating fairness objectives with provable generalization guarantees. An extensive experimental evaluation shows that our method can improve ranking fairness substantially with no or only little loss of model quality. article_number: '2102.05996' article_processing_charge: No author: - first_name: Nikola H full_name: Konstantinov, Nikola H id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87 last_name: Konstantinov - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0002-4561-241X citation: ama: Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv. doi:10.48550/arXiv.2102.05996 apa: Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996 chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996. ieee: N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning to rank,” arXiv. . ista: Konstantinov NH, Lampert C. Fairness through regularization for learning to rank. arXiv, 2102.05996. mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996. short: N.H. Konstantinov, C. Lampert, ArXiv (n.d.). date_created: 2022-02-28T14:13:59Z date_published: 2021-06-07T00:00:00Z date_updated: 2023-09-07T13:42:08Z day: '07' department: - _id: ChLa doi: 10.48550/arXiv.2102.05996 external_id: arxiv: - '2102.05996' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2102.05996 month: '06' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted related_material: record: - id: '10799' relation: dissertation_contains status: public status: public title: Fairness through regularization for learning to rank type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ...