Time-Space Complexity Advantages for Quantum Computing

It has been proved that quantum computing has advantages in query complexity, communication complexity and also other computing models. However, it is hard to prove strictly that quantum computing has advantage in the Turing machine models in time complexity. For example, we do not know how to prove that Shor’s algorithm is strictly better than any classical algorithm, since we do not know the lower bound of time complexity of the factoring problem in Turing machine. In this paper, we consider the time-space complexity and prove strictly that quantum computing has advantages compared to their classical counterparts. We prove: (1) a time-space upper bound for recognition of the languages \(L_{INT}(n)\) on two-way finite automata with quantum and classical states (2QCFA): \(TS=\mathbf{O}(n^{3/2}\log n)\), whereas a lower bound on probabilistic Turing machine is \(TS=\mathbf{\Omega }(n^2)\); (2) a time-space upper bound for recognition of the languages \(L_{NE}(n)\) on exact 2QCFA: \(TS=\mathbf{O}(n^{1.87} \log n)\), whereas a lower bound on probabilistic Turing machine is \(TS=\mathbf{\Omega }(n^2)\).

[1]  Juraj Hromkovič.  Design and Analysis of Randomized Algorithms , 2005 .

[2]  Shenggen Zheng,et al.  One-Way Finite Automata with Quantum and Classical States , 2011, Languages Alive.

[3]  Roland Vollmar,et al.  QUANTUM FINITE AUTOMATA , 2000 .

[4]  Toniann Pitassi,et al.  Randomized Communication vs. Partition Number , 2015, Electron. Colloquium Comput. Complex..

[5]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[6]  Hartmut Klauck,et al.  Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs , 2007, SIAM J. Comput..

[7]  Yuan Feng,et al.  On hybrid models of quantum finite automata , 2012, J. Comput. Syst. Sci..

[8]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[9]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[10]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[11]  A. C. Cem Say,et al.  Succinctness of two-way probabilistic and quantum finite automata , 2009, Discret. Math. Theor. Comput. Sci..

[12]  Hartmut Klauck,et al.  On quantum and probabilistic communication: Las Vegas and one-way protocols , 2000, STOC '00.

[13]  Allan Borodin,et al.  A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation , 1982, SIAM J. Comput..

[14]  Andris Ambainis,et al.  Superlinear advantage for exact quantum algorithms , 2012, STOC '13.

[15]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[16]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[17]  Shenggen Zheng,et al.  From Quantum Query Complexity to State Complexity , 2014, Computing with New Resources.

[18]  Hartmut Klauck,et al.  Quantum time-space tradeoffs for sorting , 2002, STOC '03.

[19]  Andris Ambainis,et al.  1-way quantum finite automata: strengths, weaknesses and generalizations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[20]  Toniann Pitassi,et al.  Deterministic Communication vs. Partition Number , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[21]  Andris Ambainis,et al.  Two-way finite automata with quantum and classical state , 1999, Theor. Comput. Sci..

[22]  Scott Aaronson,et al.  Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..

[23]  Robin Kothari.  Nearly optimal separations between communication (or query) complexity and partitions , 2015, Computational Complexity Conference.

[24]  Shenggen Zheng,et al.  Generalizations of the distributed Deutsch–Jozsa promise problem , 2014, Mathematical Structures in Computer Science.

[25]  Shenggen Zheng,et al.  On the state complexity of semi-quantum finite automata , 2014, RAIRO Theor. Informatics Appl..

[26]  Rusins Freivalds,et al.  Probabilistic Two-Way Machines , 1981, MFCS.

[27]  Andris Ambainis,et al.  Separations in query complexity based on pointer functions , 2015, STOC.

[28]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[29]  Andris Ambainis,et al.  Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[30]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..