{
  "meta": {
    "api_type": "NWO Projects API",
    "version": "1.0.2",
    "licence": {
      "name": "CC0 1.0 Universal",
      "url": "https://creativecommons.org/publicdomain/zero/1.0",
      "description": "To the extent possible under law, all copyright and related or neighbouring rights have been waived worldwide to the data made available through this API."
    },
    "documentation": "https://doi.org/10.5281/zenodo.14918287",
    "release_date": "2025-08-20T00:00:00",
    "funder": "https://doi.org/10.13039/501100003246",
    "ror_id": "https://ror.org/04jsz6e67",
    "date": "2026-11-04T00:00:00",
    "count": 1,
    "per_page": 100,
    "pages": 1,
    "page": 1
  },
  "projects": [
    {
      "project_id": "680-50-1208",
      "title": "Simultaneous progress in coding theory, quantum entanglement, optimization and tensors",
      "funding_scheme_id": 173,
      "funding_scheme": "Rubicon bètawetenschappen 2012 N",
      "department": "Exacte en Natuurwetenschappen",
      "sub_department": "Natuurkunde",
      "start_date": "2013-04-01T00:00:00",
      "end_date": "2015-09-25T00:00:00",
      "reporting_year": 2012,
      "summary_nl": "My proposal is about connections between four seemingly unrelated topics: coding theory, quantum entanglement, optimization and tensors. The first of these topics is relevant to information theory, the second to quantum information theory, the third to computational complexity and combinatorics, and the fourth to geometry and functional analysis. As such, these topics lie at the crossroads of mathematics, computer science and physics, three areas with great potential for cross-fertilization. \n\nI propose to further exploit and expand connections between these four topics with the goal of tackling problems concerning storage and communication of data, which society produces at a tremendous rate. Currently used error-correcting codes protect our data against loss and ambiguity, but leave small data packages poorly accessible and cause delayed communication. These problems will be addressed through the analysis of state-of-the-art codes and communication augmented with quantum entanglement, the most counterintuitive phenomenon of quantum mechanics.\n\nThe innovative steps of my proposed approach are based on novel links to problems about tensors (mathematical objects that feature in functional analysis) and to celebrated work of Alexander Grothendieck, one of last century's most influential mathematicians.",
      "summary_en": "My proposal is about connections between four seemingly unrelated topics: coding theory, quantum entanglement, optimization and tensors. The first of these topics is relevant to information theory, the second to quantum information theory, the third to computational complexity and combinatorics, and the fourth to geometry and functional analysis. As such, these topics lie at the crossroads of mathematics, computer science and physics, three areas with great potential for cross-fertilization. \n\nI propose to further exploit and expand connections between these four topics with the goal of tackling problems concerning storage and communication of data, which society produces at a tremendous rate. Currently used error-correcting codes protect our data against loss and ambiguity, but leave small data packages poorly accessible and cause delayed communication. These problems will be addressed through the analysis of state-of-the-art codes and communication augmented with quantum entanglement, the most counterintuitive phenomenon of quantum mechanics.\n\nThe innovative steps of my proposed approach are based on novel links to problems about tensors (mathematical objects that feature in functional analysis) and to celebrated work of Alexander Grothendieck, one of last century's most influential mathematicians.",
      "project_members": [
        {
          "role": "Main Applicant",
          "member_id": 195091,
          "last_name": "Briët",
          "degree_pre_nominal": "dr.",
          "initials": "J.",
          "first_name": "Jop",
          "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Probability, Networks and Algorithms",
          "organisation_id": 72325,
          "ror": "-",
          "active": true
        },
        {
          "role": "Project leader",
          "member_id": 195091,
          "last_name": "Briët",
          "degree_pre_nominal": "dr.",
          "initials": "J.",
          "first_name": "Jop",
          "organisation": "New York University||Courant Institute of Mathematic Sciences",
          "organisation_id": 54294,
          "ror": "-",
          "active": true
        },
        {
          "role": "Researcher",
          "member_id": 195091,
          "last_name": "Briët",
          "degree_pre_nominal": "dr.",
          "initials": "J.",
          "first_name": "Jop",
          "organisation": "New York University||Courant Institute of Mathematic Sciences",
          "organisation_id": 54294,
          "ror": "-",
          "active": true
        }
      ],
      "products": [
        {
          "title": "Lower bounds on approximate locally decodable codes",
          "year": 2014,
          "type": "Productbijdrage",
          "journal_title": "Springer-Verlag",
          "authors": [
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur",
              "index_number": 1
            },
            {
              "last_name": "Esparza",
              "initials": "J",
              "role": "Editor",
              "index_number": 1
            },
            {
              "last_name": "Fraigniaud",
              "initials": "P",
              "role": "Editor",
              "index_number": 2
            },
            {
              "last_name": "Dvir",
              "initials": "Z",
              "role": "Auteur",
              "index_number": 2
            },
            {
              "last_name": "Koutsoupias",
              "initials": "E",
              "role": "Editor",
              "index_number": 3
            },
            {
              "last_name": "Hu",
              "initials": "G",
              "role": "Auteur",
              "index_number": 3
            },
            {
              "last_name": "Saraf",
              "initials": "S",
              "role": "Auteur",
              "index_number": 4
            }
          ]
        },
        {
          "title": "On the existence of 0/1 polytopes with high semidefinite extension complexity",
          "year": 2014,
          "start": 1,
          "end": 21,
          "type": "Wetenschappelijk artikel",
          "journal_title": "Mathematical Programming, Ser.~B",
          "authors": [
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur",
              "index_number": 1
            },
            {
              "last_name": "Dadush",
              "initials": "D",
              "role": "Auteur",
              "index_number": 2
            },
            {
              "last_name": "Pokutta",
              "initials": "S",
              "role": "Auteur",
              "index_number": 3
            }
          ]
        },
        {
          "title": "Round elimination in exact quantum communication complexity",
          "year": 2015,
          "type": "Productbijdrage",
          "journal_title": "LIPIcs?Leibniz International Proceedings in Inform",
          "authors": [
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur",
              "index_number": 1
            },
            {
              "last_name": "Buhrman",
              "initials": "H M",
              "role": "Auteur",
              "index_number": 2
            },
            {
              "last_name": "Leung",
              "initials": "D",
              "role": "Auteur",
              "index_number": 3
            },
            {
              "last_name": "Piovesan",
              "initials": "T",
              "role": "Auteur",
              "index_number": 4
            },
            {
              "last_name": "Speelman",
              "initials": "F",
              "role": "Auteur",
              "index_number": 5
            }
          ]
        },
        {
          "title": "Entanglement-Assisted Zero-Error Source-Channel Coding",
          "year": 2015,
          "edition": "61",
          "start": 1,
          "end": 15,
          "type": "Wetenschappelijk artikel",
          "journal_title": "Information Theory, IEEE Transactions on",
          "authors": [
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur",
              "index_number": 1
            },
            {
              "last_name": "Buhrman",
              "initials": "H M",
              "role": "Auteur",
              "index_number": 2
            },
            {
              "last_name": "Laurent",
              "initials": "M",
              "role": "Auteur",
              "index_number": 3
            },
            {
              "last_name": "Piovesan",
              "initials": "T",
              "role": "Auteur",
              "index_number": 4
            },
            {
              "last_name": "Scarpa",
              "initials": "G",
              "role": "Auteur",
              "index_number": 5
            }
          ]
        },
        {
          "title": "Tight Hardness of the Non-commutative Grothendieck Problem",
          "year": 2015,
          "type": "Productbijdrage",
          "journal_title": "IEEE",
          "authors": [
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur",
              "index_number": 1
            },
            {
              "last_name": "Regev",
              "initials": "O",
              "role": "Auteur",
              "index_number": 2
            },
            {
              "last_name": "Saket",
              "initials": "R",
              "role": "Auteur",
              "index_number": 3
            }
          ]
        },
        {
          "title": "On the existence of 0/1 polytopes with high semidefinite extension complexity",
          "year": 2013,
          "edition": "1",
          "start": 217,
          "end": 228,
          "type": "Productbijdrage",
          "url_open_access": "https://www.springer.com/gp/book/9783642404498",
          "journal_title": "Springer",
          "authors": [
            {
              "last_name": "Dadush",
              "initials": "D",
              "role": "Auteur"
            },
            {
              "last_name": "Italiano",
              "initials": "G",
              "role": "Editor"
            },
            {
              "last_name": "Bodlaender",
              "initials": "H",
              "role": "Editor"
            },
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur"
            },
            {
              "last_name": "Pokutta",
              "initials": "S",
              "role": "Auteur"
            }
          ]
        },
        {
          "title": "Tight Hardness of the Non-Commutative {G}rothendieck Problem",
          "year": 2017,
          "edition": "15",
          "start": 1,
          "end": 24,
          "type": "Wetenschappelijk artikel",
          "url_open_access": "10.4086/toc.2017.v013a015",
          "journal_title": "Theory of Computing",
          "authors": [
            {
              "last_name": "Briët",
              "initials": "J",
              "role": "Auteur"
            },
            {
              "last_name": "Regev",
              "initials": "O",
              "role": "Auteur"
            },
            {
              "last_name": "Saket",
              "initials": "R",
              "role": "Auteur"
            }
          ]
        }
      ]
    }
  ]
}