Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Stefano Guerrini"'
Autor:
Stefano Guerrini
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 238, Iss Proc. LINEARITY 2016, Pp 44-53 (2017)
Linear head reduction is a key tool for the analysis of reduction machines for lambda-calculus and for game semantics. Its definition requires a notion of redex at a distance named primary redex in the literature. Nevertheless, a clear and complete s
Externí odkaz:
https://doaj.org/article/97f4c6b4a3514637ac2c3f06e88d8c08
Publikováno v:
Applied Sciences, Vol 10, Iss 16, p 5551 (2020)
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not been fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example being the
Externí odkaz:
https://doaj.org/article/19dc75abb6944c448a01a2618877cf97
Quantum state discrimination (QSD) is a key enabler in quantum sensing and networking, for which we envision the utility of non-coherent quantum states such as photon-added coherent states (PACSs). This paper addresses the problem of discriminating b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1175d1c11ec056dc01049917c2ff113
https://hdl.handle.net/11585/788053
https://hdl.handle.net/11585/788053
Autor:
Stefano Guerrini, Andrea Masini
We propose a new direct presentation of full (propositional) classical logic by means of proof nets, for which strong normalization and confluence hold true. Our proposal is based on the breaking of symmetry between propositional connectives, combine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04df77a62a3983f8478ef0dc22520d1a
http://hdl.handle.net/11562/1044766
http://hdl.handle.net/11562/1044766
Publikováno v:
GLOBECOM (Workshops)
This paper introduces the use of photon-added squeezed states (PASSs) for quantum pulse position modulation (QPPM). It is shown that the use of PASSs in QPPM communication systems can reduce the symbol error probability (SEP) with respect to the use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d42989a6fbddffbe3964d12ffd402ff7
http://hdl.handle.net/11585/863404
http://hdl.handle.net/11585/863404
Publikováno v:
GLOBECOM Workshops
Quantum key distribution (QKD) protocols are designed to distribute secure keys between two remote parties. Current QKD systems require the presence of a trusted relay to distribute the keys over intercontinental distances, due to technological limit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe5cb6a3f785a5935ceb12ab23fcfca7
http://hdl.handle.net/11392/2407784
http://hdl.handle.net/11392/2407784
Publikováno v:
GLOBECOM Workshops
Quantum communication systems exploit the quantum features of light to enhance the reliability of a classically described communication system. This paper proposes the use of photon-added coherent states (PACSs), instead of coherent states, for quant
Publikováno v:
Mathematical Structures in Computer Science, 27, 557-559
Mathematical Structures in Computer Science, 27, 5, pp. 557-559
Mathematical Structures in Computer Science, 27, 5, pp. 557-559
We are very proud and honoured to dedicate this volume to Corrado Böhm, who has been for us a teacher, mentor, colleague, and friend. But most of all, he was a brilliant role-model to follow.
Autor:
Stefano Guerrini
Publikováno v:
Theoretical Computer Science. 412(20):1958-1978
The paper presents in full detail the first linear algorithm given in the literature (Guerrini (1999) [6]) implementing proof structure correctness for multiplicative linear logic without units. The algorithm is essentially a reformulation of the Dan
Autor:
Stefano Guerrini, Andrea Masini
Publikováno v:
ACM Transactions on Computational Logic. 10:1-34
The concept of syntactical duality is central in logic. In particular, the duality defined by classical negation, or more syntactically by left and right in sequents, has been widely used to relate logic and computations. We study the proof/test dual