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.
Simple, Efficient, and Generic Post-Selection Decoding for qLDPC Codes
Graduate School of China Academy of Engineering Physics（中国工程物理研究院研究生院）；International Center for Elementary Particle Physics, University of Tokyo（东京大学基础粒子物理国际中心）；Department of Applied Physics, University of Tokyo（东京大学应用物理系）
