Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Trends in logic

Pieces of Quantum Information and Quantum Logical Gates

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini, Giuseppe Sergioli

Published Jan 1, 2018• 0 citations
Publisher
DOI
10.1007/978-3-030-04471-8_2

Related papers

Quantum bits and quantum gates

Jonathan A. Jones, Dieter Jaksch

Cambridge University Press eBooks•Jul 19, 2012•0 citations

Probabilities and Epistemic Operations in the Logics of Quantum Computation

María Luisa Dalla Chiara, Héctor Freytes, Roberto Giuntini +2 more

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”.

Entropy•Oct 31, 2018•7 citations

Quantum Logic Gates

WORLD SCIENTIFIC eBooks•Jul 1, 1998•1 citation

Holistic logical arguments in quantum computation

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Abstract Quantum 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 holistic version of the quantum computational semantics. In contrast with the compositional character of most standard semantic approaches, meanings of formulas are here dealt with as global abstract objects that determine the contextual meanings of the formulas’ components (from the whole to the parts). We present a survey of the most significant logical arguments that are valid or that are possibly violated in the framework of this semantics. Some logical features that may appear prima facie strange seem to reflect pretty well informal arguments that are currently used in our rational activity.

arXiv:1602.07516•Mathematica Slovaca•Apr 1, 2016•18 citations

Quantum Bits and Quantum Computation

Yorick Hardy, Willi-Hans Steeb

Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooks•Jan 1, 2001•0 citations

Quantum logic gates

Shinil Cho

Institute of Physics eBooks•Jul 1, 2022•2 citations
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”.
Abstract Quantum 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 holistic version of the quantum computational semantics. In contrast with the compositional character of most standard semantic approaches, meanings of formulas are here dealt with as global abstract objects that determine the contextual meanings of the formulas’ components (from the whole to the parts). We present a survey of the most significant logical arguments that are valid or that are possibly violated in the framework of this semantics. Some logical features that may appear prima facie strange seem to reflect pretty well informal arguments that are currently used in our rational activity.
Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.