Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (Q5091777): Difference between revisions

Latest revision as of 09:23, 30 July 2024

scientific article; zbMATH DE number 7564425

Language	Label	Description	Also known as
English	Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision	scientific article; zbMATH DE number 7564425

Statements

0 references

0 references

0 references

27 July 2022

0 references

full work available at URL

https://arxiv.org/abs/1905.11635

0 references

zbMATH Keywords

quantum complexity theory

0 references

non-local game

0 references

multi-prover interactive proof

0 references

entanglement

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Proof verification and the hardness of approximation problems

0 references

Probabilistic checking of proofs

0 references

Perfect commuting-operator strategies for linear system games

0 references

Characterization of Binary Constraint System Games

0 references

Interactive Proofs with Approximately Commuting Provers

0 references

Q4273694

0 references

Compression of quantum multi-prover interactive proofs

0 references

Q4145882

0 references

Tsirelson's problem and asymptotically commuting unitary matrices

0 references

Isoperimetric and isodiametric functions of groups

0 references

Tsirelson’s problem and an embedding theorem for groups arising from non-local games

0 references

Entanglement in non-local games and the hyperlinear profile of groups

0 references

title

Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (English)

0 references

Identifiers

DOI

10.4230/LIPIcs.CCC.2019.25

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091777

@@ label / en / label / en @@
+Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect commuting-operator strategies for linear system games
+Normal rank
@@ Property / cites work @@
+Characterization of Binary Constraint System Games
+Normal rank
@@ Property / cites work @@
+Interactive Proofs with Approximately Commuting Provers
+Normal rank
@@ Property / cites work @@
+Q4273694
@@ Property / cites work: Q4273694 / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of quantum multi-prover interactive proofs
+Normal rank
@@ Property / cites work @@
+Q4145882
@@ Property / cites work: Q4145882 / rank @@
+Normal rank
@@ Property / cites work @@
+Tsirelson's problem and asymptotically commuting unitary matrices
+Normal rank
@@ Property / cites work @@
+Isoperimetric and isodiametric functions of groups
+Normal rank
@@ Property / cites work @@
+Tsirelson’s problem and an embedding theorem for groups arising from non-local games
+Normal rank
@@ Property / cites work @@
+Entanglement in non-local games and the hyperlinear profile of groups
+Normal rank
@@ Property / OpenAlex ID @@
+W2966029787
@@ Property / OpenAlex ID: W2966029787 / rank @@
+Normal rank
@@ Property / title @@
+Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (English)
+Normal rank