The following pages link to Shenggen Zheng (Q391186):
Displaying 27 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← links)
- Global multipartite entanglement dynamics in Grover's search algorithm (Q1700345) (← links)
- The complexity of quantum circuit mapping with fixed parameters (Q2102776) (← links)
- Variational learning the SDC quantum protocol with gradient-based optimization (Q2106013) (← links)
- An exact quantum algorithm for a restricted subtraction game (Q2190513) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- A novel quantum broadcasting multiple blind signature scheme based on multi-particle partial entanglement (Q2322186) (← links)
- A conditional generative model based on quantum circuit and classical optimization (Q2323723) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- Quantum generative adversarial network for generating discrete distribution (Q2666758) (← links)
- The influence of correlated noise on the SDC protocol (Q2677596) (← links)
- Quantum speedup for pool-based active learning (Q2681027) (← links)
- QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution (Q2684300) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- On the state complexity of semi-quantum finite automata (Q5166503) (← links)
- Decohering power of thermal fluctuating electromagnetic field with a boundary (Q5232064) (← links)
- On the State Complexity of Semi-quantum Finite Automata (Q5404947) (← links)
- Performance of Grover's search algorithm with diagonalizable collective noises (Q6098311) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
