Synthesis and optimization of reversible circuits—a survey

M Saeedi, IL Markov - ACM Computing Surveys (CSUR), 2013 - dl.acm.org
Reversible logic circuits have been historically motivated by theoretical research in low-
power electronics as well as practical improvement of bit manipulation transforms in …

Quantum computation, quantum theory and AI

M Ying - Artificial Intelligence, 2010 - Elsevier
The main purpose of this paper is to examine some (potential) applications of quantum
computation in AI and to review the interplay between quantum theory and AI. For the …

On the power of quantum finite state automata

A Kondacs, J Watrous - Proceedings 38th annual symposium …, 1997 - ieeexplore.ieee.org
In this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and
2qfa's), which are the quantum analogues of deterministic, nondeterministic and …

[图书][B] Foundations of quantum programming

M Ying - 2024 - books.google.com
Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

Dense quantum coding and quantum finite automata

A Ambainis, A Nayak, A Ta-Shma… - Journal of the ACM (JACM …, 2002 - dl.acm.org
We consider the possibility of encoding m classical bits into many fewer n quantum bits
(qubits) so that an arbitrary bit from the original m bits can be recovered with good …

Optimal lower bounds for quantum automata and random access codes

A Nayak - 40th Annual Symposium on Foundations of …, 1999 - ieeexplore.ieee.org
Consider the finite regular language L/sub n/={w0| w/spl isin/{0, 1}*,| w|/spl les/n}. A.
Ambainis et al.(1999) showed that while this language is accepted by a deterministic finite …

1-way quantum finite automata: strengths, weaknesses and generalizations

A Ambainis, R Freivalds - Proceedings 39th Annual Symposium …, 1998 - ieeexplore.ieee.org
We study 1-way quantum finite automata (QFAs). First, we compare them with their classical
counterparts. We show that, if an automaton is required to give the correct answer with a …

Two-way finite automata with quantum and classical states

A Ambainis, J Watrous - Theoretical Computer Science, 2002 - Elsevier
We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a
variant on the 2-way quantum finite automata (2qfa) model which may be simpler to …

[PDF][PDF] Dense quantum coding and a lower bound for 1-way quantum automata

A Ambainis, A Nayak, A Ta-Shma… - Proceedings of the thirty …, 1999 - dl.acm.org
We consider the possibility of encoding m classical bits into much fewer n quantum bits so
that an arbitrary bit from the original m bits can be recovered with a good probability, and we …

Characterizations of 1-way quantum finite automata

A Brodsky, N Pippenger - SIAM Journal on Computing, 2002 - SIAM
The 2-way quantum finite automaton introduced by Kondacs and Watrous [Proceedings of
the 38 th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer …