Pages that link to "Item:Q2973249"
From MaRDI portal
The following pages link to Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249):
Displayed 12 items.
- Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Testing Boolean Functions Properties (Q5025054) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)