Abstract
Secure multiparty computation (SMC) provides collaboration among multiple parties, ensuring the confidentiality of their private information. However, classical SMC implementations encounter significant security and efficiency challenges. Resorting to the entangled Greenberger-Horne-Zeilinger (GHZ) state, we propose a quantum-based two-party protocol to compute binary Boolean functions, with the help of a third party. We exploit a technique in which a random Z-phase rotation on the GHZ state is performed to achieve higher security. The security and complexity analyses demonstrate the feasibility and improved security of our scheme compared to other SMC Boolean function computation methods. Additionally, we implemented the proposed protocol on the IBM QisKit and found consistent outcomes that validate the protocol's correctness.

Abstract
Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible simplifications in experimental demonstrations. In this paper we study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We propose new constructions for the deterministic computation of arbitrary Boolean functions, drawing on correlations present in multi-qubit Greenberger, Horne, and Zeilinger (GHZ) states. We characterize the necessary measurement complexity using the Clifford hierarchy, and also generally decrease the number of qubits needed with respect to previous constructions. In particular, we identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible, featuring quantum advantage in width and number of gates with respect to classical circuits.

Abstract
The need for more flexible and robust models to reason about systems in the presence of conflicting information is becoming more and more relevant in different contexts. This has prompted the introduction of paraconsistent transition systems, where transitions are characterized by two pairs of weights: one representing the evidence that the transition effectively occurs and the other its absence. Such a pair of weights can express scenarios of vagueness and inconsistency. . This paper establishes a foundation for a compositional and structured specification approach of paraconsistent transition systems, framed as paraconsistent institution. . The proposed methodology follows the stepwise implementation process outlined by Sannella and Tarlecki.