The following pages link to (Q4542521):
Displaying 50 items.
- Quantum homomorphisms (Q257001) (← links)
- Experimental multipartner quantum communication complexity employing just one qubit (Q269058) (← links)
- Conic formulations of graph homomorphisms (Q295829) (← links)
- Deterministic quantum non-locality and graph colorings (Q387022) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Towards characterizing the non-locality of entangled quantum states (Q387027) (← links)
- Optimal joint remote state preparation of arbitrary equatorial multi-qudit states (Q522579) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- The communication complexity of the Hamming distance problem (Q845704) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- Bell inequalities and the separability criterion (Q997627) (← links)
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Quantum entanglement as a new information processing resource (Q1880335) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- Quantum search with variable times (Q1959400) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Quantum pseudo-telepathy (Q2505724) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Specified intersections (Q2862137) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Streaming Algorithms with One-Sided Estimation (Q3088116) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas (Q3453313) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- (Q4637980) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5090396) (← links)
- (Q5090500) (← links)
- (Q5092483) (← links)
- (Q5121902) (← links)
- On decomposable correlation matrices (Q5158087) (← links)
- Noise and the Mermin-GHZ Game (Q5170273) (← links)
- Noisy Interactive Quantum Communication (Q5232323) (← links)
- Quantum versus Classical Information (Q5271358) (← links)
