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

Lecture notes in computer science

Quantum Probabilistic Dyadic Second-Order Logic

Alexandru Baltag, Jort M. Bergfeld, Kohei Kishida, Joshua Sack, Sonja Smets, Shengyang Zhong

Published Jan 1, 2013• 10 citations
Publisher
DOI
10.1007/978-3-642-39992-3_9

Related papers

Probabilistic logic of quantum observations

Amílcar Sernadas, João Rasga, Cristina Sernadas +2 more

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective measurements made on a given quantum state. Simultaneous measurements are assumed to imply that the underlying observables are compatible. A sound and weakly complete axiomatization is provided relying on the decidable first-order theory of real closed ordered fields. The proposed logic is proved to be a conservative extension of classical propositional logic.

arXiv:1607.08369•Logic Journal of IGPL•Sep 24, 2018•4 citations

Probabilistic Logics in Quantum Computation

Héctor Freytes, Antonio Ledda, Giuseppe Sergioli +1 more

Springer eBooks•Jan 1, 2013•3 citations

Quantum logic networks for cloning a quantum state near a given state

Y. H. Zhou

Two quantum logic networks are proposed to simulate a cloning machine that copies the states near a given one. Probabilistic cloning based on the first network is realized and the cloning probability of success based on the second network is 100%. Therefore, the second network is more motivative than the first one.

Chinese Physics B•Aug 1, 2011•4 citations

Cultivating logical catalysts for fault-tolerant dyadic phase rotations

Yichen Xu, Xiao Wang

We introduce a surface-code cultivation protocol for reusable logical catalyst states that implement exact fine dyadic phase gates $Z^{2^{-b}}$ by phase kickback. The catalyst is an eigenstate of a high-period Clifford circuit $U$, with a direct construction supported on $O(2^b)$ logical qubits. Once cultivated, each invocation implements the target phase through a controlled-$U$ gadget, removing Clifford+$T$ synthesis approximation error from the online gate and making the online non-Clifford depth independent of the target logical accuracy. As a concrete demonstration, we construct a catalyst for $\sqrt{T}=Z^{1/8}$, where $U$ is a nine-qubit brickwork Clifford circuit and controlled-$U$ consists of eight controlled-CNOTs. Starting from nine distance-three rotated-surface-code blocks, we cultivate the catalyst through logical-$U$ checks, syndrome extraction and postselection, code growth, and complementary-gap decoding. Due to the intrinsic fault tolerance of the phase read-out, a \emph{single} verification round already reaches the leading error-corrected scaling, in contrast to the repeated logical checks required when cultivating single-qubit magic states. A hybrid tensor-network and stabilizer simulation shows that, at physical error rate $p=10^{-3}$, the postselected catalyst can be grown to distance-seven rotated-surface-code blocks with logical leakage rate $\sim 10^{-6}$ using around seven expected attempts, and can be suppressed further with stronger postselection. Compared with existing protocols, our approach trades offline, phase-specific catalyst cultivation for exactness, reusability, and constant-depth online implementation of fixed fine dyadic phases in codes with restricted transversal gate sets.

quant-pharXiv:2606.27358•Jun 26, 2026•1 citation

Dynamic Logic for Quantum Probability

Tomoaki Kawano

Lecture notes in computer science•Sep 23, 2025•1 citation

Quantum logic and generalized probability theory

Urs Kägi‐Romano

Journal of Philosophical Logic•Jan 1, 1977•16 citations
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective measurements made on a given quantum state. Simultaneous measurements are assumed to imply that the underlying observables are compatible. A sound and weakly complete axiomatization is provided relying on the decidable first-order theory of real closed ordered fields. The proposed logic is proved to be a conservative extension of classical propositional logic.
We introduce a surface-code cultivation protocol for reusable logical catalyst states that implement exact fine dyadic phase gates Z2−bZ^{2^{-b}}Z2−b by phase kickback. The catalyst is an eigenstate of a high-period Clifford circuit UUU, with a direct construction supported on O(2b)O(2^b)O(2b) logical qubits. Once cultivated, each invocation implements the target phase through a controlled-UUU gadget, removing Clifford+TTT synthesis approximation error from the online gate and making the online non-Clifford depth independent of the target logical accuracy. As a concrete demonstration, we construct a catalyst for T=Z1/8\sqrt{T}=Z^{1/8}T​=Z1/8, where UUU is a nine-qubit brickwork Clifford circuit and controlled-UUU consists of eight controlled-CNOTs. Starting from nine distance-three rotated-surface-code blocks, we cultivate the catalyst through logical-UUU checks, syndrome extraction and postselection, code growth, and complementary-gap decoding. Due to the intrinsic fault tolerance of the phase read-out, a \emph{single} verification round already reaches the leading error-corrected scaling, in contrast to the repeated logical checks required when cultivating single-qubit magic states. A hybrid tensor-network and stabilizer simulation shows that, at physical error rate p=10−3p=10^{-3}p=10−3, the postselected catalyst can be grown to distance-seven rotated-surface-code blocks with logical leakage rate ∼10−6\sim 10^{-6}∼10−6 using around seven expected attempts, and can be suppressed further with stronger postselection. Compared with existing protocols, our approach trades offline, phase-specific catalyst cultivation for exactness, reusability, and constant-depth online implementation of fixed fine dyadic phases in codes with restricted transversal gate sets.