quantum computational logics
Recently Published Documents


TOTAL DOCUMENTS

17
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 77 ◽  
Author(s):  
Federico Holik ◽  
Giuseppe Sergioli ◽  
Hector Freytes ◽  
Angel Plastino

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.


Entropy ◽  
2018 ◽  
Vol 20 (11) ◽  
pp. 837 ◽  
Author(s):  
Maria Dalla Chiara ◽  
Hector Freytes ◽  
Roberto Giuntini ◽  
Roberto Leporini ◽  
Giuseppe Sergioli

Quantum computation theory has inspired new forms of quantum logic, called quantum computational logics, where formulas are supposed to denote pieces of quantum information, while logical connectives are interpreted as special examples of quantum logical gates. The most natural semantics for these logics is a form of holistic semantics, where meanings behave in a contextual way. In this framework, the concept of quantum probability can assume different forms. We distinguish an absolute concept of probability, based on the idea of quantum truth, from a relative concept of probability (a form of transition-probability, connected with the notion of fidelity between quantum states). Quantum information has brought about some intriguing epistemic situations. A typical example is represented by teleportation-experiments. In some previous works we have studied a quantum version of the epistemic operations “to know”, “to believe”, “to understand”. In this article, we investigate another epistemic operation (which is informally used in a number of interesting quantum situations): the operation “being probabilistically informed”.


2018 ◽  
Vol 335 ◽  
pp. 94-111 ◽  
Author(s):  
M.L. Dalla Chiara ◽  
R. Giuntini ◽  
G. Sergioli ◽  
R. Leporini

Author(s):  
Maria Luisa Dalla Chiara ◽  
Roberto Giuntini ◽  
Roberto Leporini ◽  
Giuseppe Sergioli

2016 ◽  
Vol 14 (04) ◽  
pp. 1640019 ◽  
Author(s):  
Maria Luisa Dalla Chiara ◽  
Roberto Giuntini ◽  
Giuseppe Sergioli ◽  
Roberto Leporini

Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.


2016 ◽  
Vol 66 (2) ◽  
Author(s):  
Maria Luisa Dalla Chiara ◽  
Roberto Giuntini ◽  
Roberto Leporini ◽  
Giuseppe Sergioli

AbstractQuantum computational logics represent a logical abstraction from the circuit-theory in quantum computation. In these logics formulas are supposed to denote pieces of quantum information (qubits, quregisters or mixtures of quregisters), while logical connectives correspond to (quantum logical) gates that transform quantum information in a reversible way. The characteristic holistic features of the quantum theoretic formalism (which play an essential role in entanglement-phenomena) can be used in order to develop a


2015 ◽  
Vol 21 (6) ◽  
pp. 1391-1400 ◽  
Author(s):  
Giuseppe Sergioli ◽  
Antonio Ledda

Author(s):  
MARIA LUISA DALLA CHIARA ◽  
ROBERTO GIUNTINI ◽  
GIUSEPPE SERGIOLI

Quantum computation and quantum computational logics give rise to some non-standard probability spaces that are interesting from a formal point of view. In this framework, events represent quantum pieces of information (qubits, quregisters, mixtures of quregisters), while operations on events are identified with quantum logic gates (which correspond to dynamic reversible quantum processes). We investigate the notion of Shi–Aharonov quantum computational algebra. This structure plays the role for quantum computation that is played by σ-complete Boolean algebras in classical probability theory.


2012 ◽  
Vol 10 (03) ◽  
pp. 1250036
Author(s):  
CESARINO BERTINI ◽  
ROBERTO LEPORINI

The theory of gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics, where the meaning of a sentence is identified with a system of qubits in a pure or, more generally, mixed state. In this framework, any formula of the language gives rise to a quantum circuit that transforms the state associated to the atomic subformulas into the state associated to the formula and vice versa. On this basis, some holistic semantic situations can be described, where the meaning of whole determines the meaning of the parts, by non-linear and anti-unitary operators. We prove that the semantics with such operators and the semantics with unitary operators turn out to characterize the same logic.


Sign in / Sign up

Export Citation Format

Share Document