# Optimal lower bounds for quantum automata and random access codes

@article{Nayak1999OptimalLB,
title={Optimal lower bounds for quantum automata and random access codes},
author={Ashwin Nayak},
journal={40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)},
year={1999},
pages={369-376}
}
• A. Nayak
• Published 27 April 1999
• Computer Science
• 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
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 automaton of size O(n), any one-way quantum finite automaton (QFA) for it has size 2/sup /spl Omega/(n/logn)/. This was based on the fact that the evolution of a QFA is required to be reversible. When arbitrary intermediate measurements are allowed, this intuition breaks down. Nonetheless, we show a 2/sup /spl Omega…
293 Citations

## Figures from this paper

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages
• Computer Science
ICTCS
• 2003
It is proved the existence of n-periodic languages requiring $$\Omega (\sqrt{\frac{n}{log n}})$$ states to be recognized, and the number of states of automata accepting the finite language L < n = {a k ∈ L | k < n}, for a given L.
On the Lower Bounds for One-Way Quantum Automata
• Computer Science
MFCS
• 2000
It is proved that for MO-QFA Q that (1=2+Ɛ)-accepts (Ɛ ∈ (0, 1=2) regular language L it holds that dim(Q) = Ω (log dim (A)/log log dim(A)).
Quantum Information and the PCP Theorem
• R. Raz
• Computer Science
FOCS
• 2005
Our main result is that the membership x /spl epsi/ SAT (for x of length n) can be proved by a logarithmic-size quantum state |/spl Psi/>, together with a polynomial-size classical proof consisting
Lower Bounds for Generalized Quantum Finite Automata
Several lower bounds on the language recognition power of Nayak's generalized quantum finite automata (GQFA) are obtained, implying that the class of languages recognized by GQFAs is not closed under union.
Quantum finite automata with control language
• Computer Science
RAIRO Theor. Informatics Appl.
• 2006
This work provides algorithms for constructing 1qfc's accepting the inverse homomorphic images and quotients of languages accepted by 1qFC's and gives instances of binary regular languages on which 1qfa's are proved to be more succinct than the corresponding classical (deterministic) automata.
Research report: State complexity of operations on two-way quantum finite automata
A number of non-regular languages are presented and it is proved that these languages can be accepted by 2qfa's with one-sided error probabilities within linear time.
Lower bounds for quantum computation and communication
• Computer Science
• 1999
This dissertation establishes limitations on the ways in which the exponentially many degrees of freedom hidden in quantum states may be accessed, and derives nearly optimal lower bounds for several problems in this model, including that of approximating the median.
Some Observations on Two-Way Finite Automata with Quantum and Classical States
It is proved that the Boolean operations (intersection, union, and complement) and the reversal operation of the class of languages recognized by 2qcfa's with error probabilities are closed; also, it is verified that the catenation operation of suchclass of languages is closed under certain restricted condition.
The Limitations of Few Qubits: One-way and Two-way Quantum Finite Automata and the Group Word Problem
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they

## References

SHOWING 1-10 OF 41 REFERENCES
On the power of quantum finite state automata
• Computer Science
Proceedings 38th Annual Symposium on Foundations of Computer Science
• 1997
It is proved that the class of languages recognizing by linear time, bounded error 2qfa's properly includes the regular languages, and 1-way and 2-way quantum finite state automata are introduced, which are the quantum analogues of deterministic, nondeterministic and probabilistic 1- way and2-way finite state Automata.
1-way quantum finite automata: strengths, weaknesses and generalizations
• Computer Science
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
• 1998
This work constructs a 1-way QFA that is exponentially smaller than any equivalent classical (even randomized) finite automaton, and thinks that this construction may be useful for design of other space-efficient quantum algorithms.
The quantum communication complexity of sampling
• Computer Science
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
• 1998
An exponential gap is established between quantum and classical sampling complexity, for the set disjointness function, which is the first exponential gap for any task where the classical probabilistic algorithm is allowed to err.
Dense quantum coding and a lower bound for 1-way quantum automata
• Computer Science
STOC '99
• 1999
An exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automaton is proved.
Quantum circuits with mixed states
• Computer Science
STOC '98
• 1998
A solution for the subroutine problem: the general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations.
Quantum Circuit Complexity
• A. Yao
• Computer Science
FOCS
• 1993
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them.
Quantum automata and quantum grammars
• Computer Science
Theor. Comput. Sci.
• 2000
Private information retrieval
• Computer Science
JACM
• 1998
This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user.
Elements of Information Theory
• Computer Science
• 1991
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
General properties of entropy
This paper discusses properties of entropy, as well as related concepts such as relative entropy, skew entropy, dynamical entropy, etc, in detail with reference to their implications in statistical mechanics, to get a glimpse of systems with infinitely many degrees of freedom.