This paper studies 2TFA and proposes a new computing model called two-way two-tape finite automata with quantum and classical states (2TQCFA), and gives efficient 2T FA algorithms for identifying languages which can be recognized by 2TCFA.Expand

A general method is presented and demonstrated that state succinctness results can be derived out of query complexity results, and is shown to be applicable to quantum finite automata.Expand

This work brings together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms.Expand

It is proved that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries and that ANDn is the only n- bit Boolean function, up to isomorphism, that requires n queries.Expand

By using the proposed encoding method, a wide class of problems for which quantum information protocols based on multisystem entanglement can be mapped into much simpler ones involving only one system.Expand

This paper proposes a restricted subtraction game with the subtraction set determined by a specified matrix, and presents an exact quantum algorithm to solve it, showing that the query complexity of the quantum algorithm is O ( n 3 2 ) $O(n^{\frac {3}{2}})$ , while the classical exact query complexity is Î˜ ( n 2 ).Expand

An experimental demonstration of an optical quantum automaton is used to solve the promise problems of determining whether the length of an input string can be divided by a prime number P with no remainder or with a remainder of R.Expand

This study has modeled chemical reactions using two-way quantum finite automata, which are halted in linear time, and it has been proven that computational versatility can be increased by combining chemical accept/reject signatures and quantum automata models.Expand