Strong Direct Product Theorems for Quantum Communication and Query Complexity (Q4907578): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5419073
 
aliases / en / 0aliases / en / 0
 
Strong direct product theorems for quantum communication and query complexity
description / endescription / en
 
scientific article; zbMATH DE number 6301127
Property / title
 
Strong direct product theorems for quantum communication and query complexity (English)
Property / title: Strong direct product theorems for quantum communication and query complexity (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1288.68076 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/1993636.1993643 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the forty-third annual ACM symposium on Theory of computing / rank
 
Normal rank
Property / publication date
 
5 June 2014
Timestamp+2014-06-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 June 2014 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6301127 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074456199 / rank
 
Normal rank

Latest revision as of 10:20, 6 May 2024

scientific article; zbMATH DE number 6301127
  • Strong direct product theorems for quantum communication and query complexity
Language Label Description Also known as
English
Strong Direct Product Theorems for Quantum Communication and Query Complexity
scientific article; zbMATH DE number 6301127
  • Strong direct product theorems for quantum communication and query complexity

Statements

Strong Direct Product Theorems for Quantum Communication and Query Complexity (English)
0 references
Strong direct product theorems for quantum communication and query complexity (English)
0 references
0 references
0 references
0 references
4 February 2013
0 references
5 June 2014
0 references
0 references
0 references
0 references
0 references
0 references
0 references
quantum communication
0 references
query complexity
0 references
XOR lemmas
0 references
strong direct product theorems
0 references
quantum query complexity
0 references
quantum communication complexity
0 references
0 references
0 references
0 references