• Publications
  • Influence
Quantum Computation and Information
TLDR
The problem of minimizing the number of qubits in quantum automata is presented in detail at a level appropriate for non-specialists in order to illustrate some key issues in quantum computation.
Semiquantum key distribution without invoking the classical party’s measurement capability
TLDR
It is proved that the proposed SQKD protocol is completely robust against joint attacks, and the number of the quantum states sent by Alice and Bob is decreased.
QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
TLDR
A sound and complete axiomatization of QCTL is given and the standard CTL model-checking algorithm with the dEQPL model- checking algorithm is combined to obtain a model- Checking algorithm for QCTl.
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
TLDR
It is shown that the states minimization problem of multi-letter QFAs is solvable in EXPSPACE and the decidability of the equivalence and minimization problems ofMulti-letter quantum finite automata is studied.
Exogenous Semantics Approach to Enriching Logics
The exogenous semantics approach to enriching a logic consists in defining each model in the enrichment as a set of models in the original logic plus some relevant structure. We illustrate the
Fair and optimistic quantum contract signing
TLDR
This work presents a fair and optimistic quantum-contract-signing protocol between two clients that requires no communication with the third trusted party during the exchange phase and shows that it is possible to generalize this protocol to an arbitrary number of clients.
...
...