Abstract
In quantum information science, a major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields. It has been shown that the quantum version of automaton can solve certain problem using a much smaller state space compared to the classical automaton. Here we report an experimental demonstration of an optical quantum automaton, which 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. Our quantum automaton can solve such problem using a state space with only three orthonormal states, whereas the classical automaton needs no less than P states. Our results demonstrate the quantum benefits of a quantum automaton over its classical counterpart and paves the way for implementing quantum automaton for more complicated and practical applications.
Highlights
Quantum information science is a research field focused on enhancing problem-solving efficiency by utilizing quantum effects
We have proven that a quantum finite automaton (QFA) composed with a three-dimensional quantum state suffice to solve a promise problem whereas a classical Finite automaton (FA) needs much larger state space to solve the same problem
Deterministic refers to the fact that a deterministic finite automaton (DFA) only produces a unique computation for each input string
Summary
A major task is to find the quantum models that can outperform their classical counterparts. Automaton is a fundamental computing model that has wide applications in many fields. It has been shown that the quantum version of automaton can solve certain problem using a much smaller state space compared to the classical automaton. We report an experimental demonstration of an optical quantum automaton, which 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. Our results demonstrate the quantum benefits of a quantum automaton over its classical counterpart and paves the way for implementing quantum automaton for more complicated and practical applications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have