Margherita Zorzi

Dr. Margherita Zorzi

Department of Computer Science, University of Verona, Italy
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 June 2012 in RAIRO - Theoretical Informatics and Applications
Verified
Journal Article
Closed access
PDF file
ULUgo Dal Lago
Ugo Dal Lago
Margherita ZorziMargherita Zorzi
Margherita Zorzi
Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics, inductively and coinductively defined, are given. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by-value and in call-by-name. Plotkin’s CPS translation is extended to accommodate the choice operator and shown correct with respect to the operational semantics. Finally, the expressive power of the obtained system is studied: the calculus is shown to be sound and complete with respect to computable probability distributions.

17 November 2014 in Mathematical Structures in Computer Science
Verified
Journal Article
Closed access
PDF file
Margherita ZorziMargherita Zorzi
Margherita Zorzi
In this paper, we propose an approach to quantum λ-calculi. The ‘quantum data-classical control’ paradigm is considered. Starting from a measurement-free untyped quantum λ-calculus calledQ, we will study standard properties such as confluence and subject reduction, and some good quantum properties. We will focus on the expressive power, analysing the relationship with other quantum computational models. Successively, we will add an explicit measurement operator toQ. On the resulting calculus, calledQ*, we will propose a complete study of reduction sequences regardless of their finiteness, proving confluence results. Moreover, since the stronger motivation behind quantum computing is the research of new results in computational complexity, we will also propose a calculus which captures the three classes of quantum polytime complexity, showing an ICC-like approach in the quantum setting.

1 January 2010 in Theoretical Computer Science
Verified
Journal Article
Closed access
ULUgo Dal Lago
Ugo Dal Lago
AMAndrea Masini
Andrea Masini
Margherita ZorziMargherita Zorzi
Margherita Zorzi

1 August 2018 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
CCCarlo Combi
Carlo Combi
Margherita ZorziMargherita Zorzi
Margherita Zorzi
GPGabriele Pozzani
Gabriele Pozzani
UMUgo Moretti
Ugo Moretti
EAElena Arzenton
Elena Arzenton

1 April 2009 in Mathematical Structures in Computer Science
Verified
Journal Article
Closed access
PDF file
ULUgo Dal Lago
Ugo Dal Lago
Andrea MasiniAndrea Masini
Andrea Masini
Margherita ZorziMargherita Zorzi
Margherita Zorzi
We study a measurement-free, untyped λ-calculus with quantum data and classical control. This work arises from previous proposals by Selinger and Valiron, and Van Tonder. We focus on operational and expressiveness issues, rather than (denotational) semantics. We prove subject reduction and confluence, and a standardisation theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class of quantum circuit families.

1 April 2016 in Theoretical Computer Science
Verified
Journal Article
Closed access
FAFederico Aschieri
Federico Aschieri
Margherita ZorziMargherita Zorzi
Margherita Zorzi