Discrete-Query Quantum Algorithm for NAND Trees

This is a comment on the article “A Quantum Algorithm for the Hamiltonian NAND Tree” by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann, Theory of Computing 4 (2008) 169--190. That paper gave a quantum algorithm for evaluating NAND trees with running time O(√N) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using N^[1/2 + o(1)] queries in the conventional (discrete) quantum query model

Generalized Asynchronous Systems

The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asynchronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns time intervals to events. It is proved that the time distributed asynchronous automata are generalized the time Petri nets and asynchronous systems.Comment: 8 page

On limiting distributions of quantum Markov chains

In a quantum Markov chain, the temporal succession of states is modeled by the repeated action of a "bistochastic quantum operation" on the density matrix of a quantum system. Based on this conceptual framework, we derive some new results concerning the evolution of a quantum system, including its long-term behavior. Among our findings is the fact that the Ces$\grave{a}$ro limit of any quantum Markov chain always exists and equals the orthogonal projection of the initial state upon the eigenspace of the unit eigenvalue of the bistochastic quantum operation. Moreover, if the unit eigenvalue is the only eigenvalue on the unit circle, then the quantum Markov chain converges in the conventional sense to the said orthogonal projection. As a corollary, we offer a new derivation of the classic result describing limiting distributions of unitary quantum walks on finite graphs \cite{AAKV01}