Pages that link to "Item:Q4638074"
From MaRDI portal
The following pages link to Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication (Q4638074):
Displaying 10 items.
- Entanglement distillation from Greenberger-Horne-Zeilinger shares (Q525121) (← links)
- Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity (Q1654117) (← links)
- Tensor rank is not multiplicative under the tensor product (Q1698592) (← links)
- Computing images of polynomial maps (Q2305553) (← links)
- Tensor surgery and tensor rank (Q2422765) (← links)
- Asymptotic tensor rank of graph tensors: beyond matrix multiplication (Q2422766) (← links)
- The Relationship between Inner Product and Counting Cycles (Q2894505) (← links)
- Matrix product states and the quantum max-flow/min-cut conjectures (Q4556631) (← links)
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (Q5091777) (← links)
- Border Rank Is Not Multiplicative under the Tensor Product (Q5382574) (← links)
