#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2009

2017

- This year (3)
- Last 5 years (13)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Enrico G. Beltrametti, Maria Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini, Giuseppe Sergioli
- Fundam. Inform.
- 2012

Quantum computation and quantum computational logics are intrinsically connected with some puzzling epistemic problems. In the framework of a quantum computational approach to epistemic logic we investigate the following question: is it possible to interpret the basic epistemic operations (having information, knowing) as special kinds of Hilbert-space… (More)

Some critical open problems of epistemic logics can be investigated in the framework of a quantum computational approach. The basic idea is to interpret sentences like “Alice knows that Bob does not understand that π is irrational” as pieces of quantum information (generally represented by density operators of convenient Hilbert spaces). Logical epistemic… (More)

- Maria Luisa Dalla Chiara, Roberto Giuntini, Giuseppe Sergioli
- Mathematical Structures in Computer Science
- 2014

Quantum computation and quantum computational logics give rise to some non-standard 12 probability spaces that are interesting from a formal point of view. In this framework, events 13 represent quantum pieces of information (qubits , quregisters , mixtures of quregisters), while 14 operations on events are identified with quantum logic gates (which… (More)

- Roberto Giuntini, Antonio Ledda, Giuseppe Sergioli, Francesco Paoli
- Int. J. General Systems
- 2011

Quantum computational logics provide a fertile common ground for a uni ed treatment of vagueness and uncertainty. In this paper we describe an approach to the logic of quantum computation that has been recently taken up and developed by the present authors. Special attention will be devoted to a generalisation of Chang's MV algebras (called quasi-MV… (More)

- Giuseppe Sergioli, Antonio Ledda, +5 authors Claudio Marini
- Inf. Sci.
- 2009

We investigate two cooperative variants (with and without lies) of the Guessing Secrets Problem, introduced in [4] in the attempt to model an interactive situation arising in the World Wide Web, in relation to the e¢ cient delivery of Internet content. After placing bounds on the cardinality of the smallest set of questions needed to win the game, we… (More)

- Maria Luisa Dalla Chiara, Antonio Ledda, Giuseppe Sergioli, Roberto Giuntini
- J. Philosophical Logic
- 2013

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. The basic algebraic properties of this system have been studied in Dalla Chiara et al. (Foundations of Physics 39(6):559–572, 2009), where we have introduced the notion of Shi-Aharonov quantum computational… (More)

- Maria L. Dalla Chiara, Roberto Giuntini, Roberto Leporini, Eleonora Negri, Giuseppe Sergioli
- Front. Psychol.
- 2015

Parallelism represents an essential aspect of human mind/brain activities. One can recognize some common features between psychological parallelism and the characteristic parallel structures that arise in quantum theory and in quantum computation. The article is devoted to a discussion of the following questions: a comparison between classical probabilistic… (More)

- Maria Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini, Giuseppe Sergioli
- Fuzzy Sets and Systems
- 2016

Quantum computation has suggested new forms of quantum logic, called quantum computational logics. In these logics wellformed formulas are supposed to denote pieces of quantum information: possible pure states of quantum systems that can store the information in question. At the same time, the logical connectives are interpreted as quantum logical gates:… (More)

- Amit Hagar, Giuseppe Sergioli
- ArXiv
- 2011

We propose a new interpretation of objective deterministic chances in statistical physics based on physical computational complexity. This notion applies to a single physical system (be it an experimental set– up in the lab, or a subsystem of the universe), and quantifies (1) the difficulty to realize a physical state given another, (2) the ‘distance’ (in… (More)

At the end of the XIX century, classical physics was in a position to solve a very large number of problems [33]: Maxwell's equations and classical statistical mechanics were able to provide a good description of electromagnetic and thermodynamic phenomena, but were considered only as a pragmatic approximation to the true laws of physics. For instance,… (More)