Pages that link to "Item:Q1853475"
From MaRDI portal
The following pages link to Quantum communication and complexity. (Q1853475):
Displaying 14 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems (Q2828234) (← links)
- Equality, Revisited (Q2946382) (← links)
- Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial (Q3107878) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- (Q5090500) (← links)
- (Q5092483) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- The improvement of decision tree construction algorithm based on quantum heuristic algorithms (Q6043930) (← links)
- Exact distributed quantum algorithm for generalized Simon's problem (Q6541034) (← links)
