Lvzhou Li

Frontiers Comput. Sci., August, 2024

Lifting query complexity to time-space complexity for two-way finite automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., May, 2024

Small Multi-Attitude Soft Amphibious Robot.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., February, 2024

Quantum algorithms for learning hidden strings with applications to matroid problems.

[BibT_eX]

[DOI]

Xiaowei Huang

Shihao Zhang

Theor. Comput. Sci., January, 2024

Verifiable Blind Quantum Computation With Identity Authentication for Multi-Type Clients.

[BibT_eX]

[DOI]

Junyu Quan

Qin Li

IEEE Trans. Inf. Forensics Secur., 2024

Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem.

[BibT_eX]

[DOI]

Guanzhong Li

Jingquan Luo

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Training-Free Quantum Architecture Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions.

[BibT_eX]

[DOI]

Zekun Ye

J. Comput. Sci. Technol., December, 2023

Programmable Design and Fabrication of 3D Variable-Stiffness Structure Based on Patterned Graphene-Heating Network.

[BibT_eX]

[DOI]

Adv. Intell. Syst., July, 2023

Deterministic quantum search with adjustable parameters: Implementations and applications.

[BibT_eX]

[DOI]

Guanzhong Li

Inf. Comput., June, 2023

Quantum and classical query complexities for determining connectedness of matroids.

[BibT_eX]

[DOI]

Xiaowei Huang

Shiguang Feng

CoRR, 2023

2022

Sample complexity of hidden subgroup problem.

[BibT_eX]

[DOI]

Zekun Ye

Theor. Comput. Sci., 2022

Deterministic algorithms for the hidden subgroup problem.

[BibT_eX]

[DOI]

Zekun Ye

Inf. Comput., 2022

Continual learning of quantum state classification with gradient episodic memory.

[BibT_eX]

[DOI]

CoRR, 2022

A brief introduction to quantum algorithms.

[BibT_eX]

[DOI]

Shihao Zhang

CCF Trans. High Perform. Comput., 2022

2021

Load Sharing Design of a Multi-legged Adaptable Gripper With Gecko-Inspired Controllable Adhesion.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2021

Query complexity of generalized Simon's problem.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Variational quantum compiling with double Q-learning.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Security improvements of several basic quantum private query protocols with O(log N) communication complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A query-based quantum eigensolver.

[BibT_eX]

[DOI]

Quantum Eng., 2020

Quantum generative adversarial network for generating discrete distribution.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Online Convex Optimization with Classical and Quantum Evaluation Oracles.

[BibT_eX]

[DOI]

CoRR, 2020

Quantum speedup of twin support vector machines.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2020

2019

Quantum speedup for pool-based active learning.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2019

Almost tight bound on the query complexity of generalized Simon's problem.

[BibT_eX]

[DOI]

CoRR, 2019

2018

An approach for quantitatively analyzing the genuine tripartite nonlocality of general three-qubit states.

[BibT_eX]

[DOI]

Zhaofeng Su

Jie Ling

Quantum Inf. Process., 2018

Experimental demonstration of conflicting interest nonlocal games using superconducting qubits.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2018

Limited resource semiquantum secret sharing.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2018

Quantum-enhanced feature selection with forward selection and backward elimination.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2018

A Quantum Electronic Voting Scheme with d-Level Single Particles.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computing Methodologies - 14th International Conference, 2018

2017

Triangle Extension: Efficient Localizability Detection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2017

Promise problems solved by quantum and classical finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Coherence of one-dimensional quantum walk on cycles.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2017

Application of distributed semi-quantum computing model in phase estimation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Image Encryption Algorithms Based on Non-uniform Second-Order Reversible Cellular Automata with Balanced Rules.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computing Theories and Application, 2017

2016

Lower bounds on the size of semi-quantum finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

On the State Minimization of Fuzzy Automata.

[BibT_eX]

[DOI]

IEEE Trans. Fuzzy Syst., 2015

Exponentially more concise quantum recognition of non-RMM regular languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

On hybrid models of quantum finite automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Quantum Markov chains: Description of hybrid systems, decidability of equivalence, and model checking linear-time properties.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Lower bounds on the size of semi-quantum automata.

[BibT_eX]

[DOI]

CoRR, 2015

Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework.

[BibT_eX]

[DOI]

Jozef Gruska

Shenggen Zheng

CoRR, 2014

2013

State succinctness of two-way finite automata with quantum and classical states.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Decidability of minimization of fuzzy automata

[BibT_eX]

[DOI]

CoRR, 2013

2012

Quantum Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Characterizations of one-way general quantum finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States.

[BibT_eX]

[DOI]

Shenggen Zheng

Int. J. Found. Comput. Sci., 2012

On the complexity of minimizing probabilistic and quantum automata.

[BibT_eX]

[DOI]

Paulo Mateus

Inf. Comput., 2012

On hybrid models of quantum finite automata

[BibT_eX]

[DOI]

CoRR, 2012

State Succinctness of two-Way finite Automata with quantum and Classical States.

[BibT_eX]

[DOI]

Shenggen Zheng

Proceedings of the Quantitative Logic and Soft Computing, 2012

One-Way Finite Automata with Quantum and Classical States.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

2011

Multi-letter quantum finite automata: decidability of the equivalence and minimization of states.

[BibT_eX]

[DOI]

Acta Informatica, 2011

Quantum Information Splitting Using GHZ-Type and W-Type States.

[BibT_eX]

[DOI]

Proceedings of the Bio-Inspired Computing and Applications, 2011

2010

Revisiting the Power and Equivalence of One-Way Quantum Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2010

2009

A note on quantum sequential machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On mathematical theory of the duality computers.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2009

2008

Determining the equivalence for one-way quantum finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

An overview of quantum computation models: quantum automata.

[BibT_eX]

[DOI]

Frontiers Comput. Sci. China, 2008

2006

Determination of equivalence between quantum sequential machines.

[BibT_eX]

[DOI]