{ "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-05T00:00:00", "count": 1, "per_page": 100, "pages": 1, "page": 1 }, "projects": [ { "project_id": "639.023.302", "title": "Quantum Information Processing", "funding_scheme_id": 598, "funding_scheme": "NWO-Talentprogramma Vici 2002 EW", "department": "Exacte en Natuurwetenschappen", "sub_department": "Exacte Wetenschappen", "start_date": "2004-04-01T00:00:00", "end_date": "2011-12-20T00:00:00", "reporting_year": 2002, "summary_nl": "Dit project bestudeert de theoretische fundamenten van quantum informatieverwerking. Het onderzoek speelt zich af op het grensgebied van de natuurkunde en de informatica. Informatie verwerking is een fysisch proces dat onderhavig is aan de wetten van de natuurkunde in het bijzonder de quantum mechanica. Deze realisatie resulteert in de ontdekking en ontsluiting van een nieuw en revolutionair onderzoeksgebied: Quantum Computing.\n\n\n\nHet onderzoeksgebied kwam in een stroomversnelling toen in 1994 werd aangetoond dat een quantum computer in staat is op efficiënte wijze een getal in zijn priemfactoren te ontbinden. Op klassieke computers is zo'n efficiënte methode of algoritme niet bekend. Sterker veel van de gebruikte gegevensbeveiligingsmethoden zijn gebaseerd op het niet voorhanden zijn van zo'n efficiënte algoritme. Het bouwen van een quantum computer zal dan ook veel van de huidige beveiligen, zoals gebruikt bij bijvoorbeeld elektronisch betalen op het internet, onveilig maken.\n\n\n\nNa de ontdekking van het factorisatie algoritme is gebleken dat quantum computing op een aantal gebieden superieur is aan klassieke informatieverwerking. Zo is bv het op een quantum wijze genereren van een gedistribueerde geheime sleutel, quantum key distribution, commercieel verkrijgbaar. Het grootste probleem van het vakgebied is dat op dit moment slecht wordt begrepen wat de kracht van een quantum computer is. Dit komt tot uiting door het kleine aantal efficiënte quantum algoritme dat bekend is. Dit voorstel spitst zich toe op het ontwikkelen van nieuwe efficiënte quantum programma's en algoritmen.\n\n", "summary_en": "Dit project bestudeert de theoretische fundamenten van quantum informatieverwerking. Het onderzoek speelt zich af op het grensgebied van de natuurkunde en de informatica. Informatie verwerking is een fysisch proces dat onderhavig is aan de wetten van de natuurkunde in het bijzonder de quantum mechanica. Deze realisatie resulteert in de ontdekking en ontsluiting van een nieuw en revolutionair onderzoeksgebied: Quantum Computing.\n\n\n\nHet onderzoeksgebied kwam in een stroomversnelling toen in 1994 werd aangetoond dat een quantum computer in staat is op efficiënte wijze een getal in zijn priemfactoren te ontbinden. Op klassieke computers is zo'n efficiënte methode of algoritme niet bekend. Sterker veel van de gebruikte gegevensbeveiligingsmethoden zijn gebaseerd op het niet voorhanden zijn van zo'n efficiënte algoritme. Het bouwen van een quantum computer zal dan ook veel van de huidige beveiligen, zoals gebruikt bij bijvoorbeeld elektronisch betalen op het internet, onveilig maken.\n\n\n\nNa de ontdekking van het factorisatie algoritme is gebleken dat quantum computing op een aantal gebieden superieur is aan klassieke informatieverwerking. Zo is bv het op een quantum wijze genereren van een gedistribueerde geheime sleutel, quantum key distribution, commercieel verkrijgbaar. Het grootste probleem van het vakgebied is dat op dit moment slecht wordt begrepen wat de kracht van een quantum computer is. Dit komt tot uiting door het kleine aantal efficiënte quantum algoritme dat bekend is. Dit voorstel spitst zich toe op het ontwikkelen van nieuwe efficiënte quantum programma's en algoritmen.\n\n", "project_members": [ { "role": "Researcher", "member_id": 220320, "last_name": "Matsliah", "degree_pre_nominal": "dr.", "initials": "A.", "first_name": "Arie", "organisation": "Onbekend", "organisation_id": 5229, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 169141, "last_name": "Schaffner", "degree_pre_nominal": "dr.", "initials": "C.", "first_name": "Christian", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 204057, "last_name": "García Soriano", "degree_pre_nominal": "dr.", "initials": "D.", "first_name": "David", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 148870, "last_name": "Unger", "degree_pre_nominal": "dr.", "initials": "F.P.", "first_name": "Falk", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 195091, "last_name": "Briët", "degree_pre_nominal": "dr.", "initials": "J.", "first_name": "Jop", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica", "organisation_id": 42388, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 157233, "last_name": "Koucky", "degree_pre_nominal": "dr.", "initials": "M.", "first_name": "Michal", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 220836, "last_name": "Chakraborty", "degree_pre_nominal": "dr.", "initials": "S.", "first_name": "Sourav", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 227413, "last_name": "Stojevic", "degree_pre_nominal": "dr.", "initials": "V.", "first_name": "Vid", "organisation": "Onbekend", "organisation_id": 5229, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 220835, "last_name": "Kotlowski", "degree_pre_nominal": "dr.", "initials": "W.T.", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 222836, "last_name": "Gulik", "degree_pre_nominal": "drs.", "initials": "P.T.S.", "first_name": "Peter", "prefix": "van der", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica", "organisation_id": 42388, "ror": "-", "active": false }, { "role": "Project leader", "member_id": 99949, "last_name": "Buhrman", "degree_pre_nominal": "prof. dr.", "initials": "H.M.", "first_name": "Harry", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 99949, "last_name": "Buhrman", "degree_pre_nominal": "prof. dr.", "initials": "H.M.", "first_name": "Harry", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Researcher", "member_id": 148873, "last_name": "Wehner", "degree_pre_nominal": "prof. dr.", "initials": "S.D.C.", "first_name": "Stephanie", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Information Access (IA)", "organisation_id": 59632, "ror": "-", "active": false }, { "role": "Main Applicant", "member_id": 99949, "last_name": "Buhrman", "degree_pre_nominal": "prof. dr.", "initials": "H.M.", "first_name": "Harry", "organisation": "NWO-institutenorganisatie||CWI - Centrum Wiskunde & Informatica||Probability, Networks and Algorithms", "organisation_id": 72325, "ror": "-", "active": true } ], "products": [ { "title": "Implications of superstrong non-locality for cryptography", "year": 2006, "edition": "462", "start": 1919, "end": 1932, "type": "Wetenschappelijk artikel", "journal_title": "Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences", "authors": [ { "last_name": "Winter", "initials": "A.", "first_name": "Andreas", "role": "Auteur", "index_number": 0 }, { "last_name": "Unger", "initials": "F.P.", "first_name": "Falk", "role": "Auteur", "index_number": 0 }, { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 }, { "last_name": "Christandl", "initials": "M", "role": "Auteur", "index_number": 0 } ] }, { "title": "State discrimination with post-measurement information", "year": 2007, "type": "Wetenschappelijk artikel", "journal_title": "QIP", "authors": [ { "last_name": "Winter", "initials": "A.", "first_name": "Andreas", "role": "Auteur", "index_number": 0 }, { "last_name": "Ballester Sanchez", "initials": "M.A.", "first_name": "Manuel", "role": "Auteur", "index_number": 0 }, { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 } ] }, { "title": "Query-efficient computation in property testing and learning theory", "year": 2012, "edition": "1", "type": "Proefschrift", "journal_title": "Universiteit van Amsterdam", "isbn": "978-94-6191-233-6", "city": "AMSTERDAM ZUIDOOST", "authors": [ { "last_name": "García Soriano", "initials": "D.", "first_name": "David", "role": "Auteur", "index_number": 1 } ] }, { "title": "Limit on nonlocality in any world in which communication complexity is not trivial", "year": 2006, "edition": "96", "type": "Wetenschappelijk artikel", "journal_title": "Phys. Rev. Lett", "authors": [ { "last_name": "Unger", "initials": "F.P.", "first_name": "Falk", "role": "Auteur", "index_number": 0 }, { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Methot", "initials": "A", "role": "Auteur", "index_number": 0 }, { "last_name": "Tapp", "initials": "A", "role": "Auteur", "index_number": 0 }, { "last_name": "Brassard", "initials": "G", "role": "Auteur", "index_number": 0 }, { "last_name": "Linden", "initials": "N", "role": "Auteur", "index_number": 0 } ] }, { "title": "Sparse selfreducible sets and polynomial size circuit lower bounds.", "year": 2006, "start": 455, "end": 468, "type": "Wetenschappelijk artikel", "journal_title": "The 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006)", "authors": [ { "last_name": "Unger", "initials": "F.P.", "first_name": "Falk", "role": "Auteur", "index_number": 0 }, { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 } ] }, { "title": "Noise in quantum and classical computation & non-locality", "year": 2008, "edition": "1", "type": "Proefschrift", "journal_title": "Centrum voor Wiskunde en Informatica", "isbn": "90-6196-547-0", "city": "AMSTERDAM", "authors": [ { "last_name": "Unger", "initials": "F.P.", "first_name": "Falk", "role": "Auteur", "index_number": 1 } ] }, { "title": "Robust polynomials and quantum algorithms\nSpecial issue for STACS 2005", "sub_title": "Special issue for STACS 2005", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "Theory of Computing Systems", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Röhrig", "initials": "H.P.", "first_name": "Hein", "role": "Auteur", "index_number": 0 }, { "last_name": "Wolf", "initials": "R.M.", "first_name": "Ronald", "prefix": "de", "role": "Auteur", "index_number": 0 }, { "last_name": "Newman", "initials": "I.", "role": "Auteur", "index_number": 0 } ] }, { "title": "New limits on fault-tolerant quantum computation", "year": 2006, "start": 411, "end": 419, "type": "Wetenschappelijk artikel", "journal_title": "IEEE 47th Annual Symposium on Foundations of Computer Science (FOCS 2006)", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Schrijver", "initials": "A.", "first_name": "Lex", "role": "Auteur", "index_number": 0 }, { "last_name": "Laurent", "initials": "M.", "first_name": "Monique", "role": "Auteur", "index_number": 0 }, { "last_name": "Linden", "initials": "N.", "first_name": "Noah", "role": "Auteur", "index_number": 0 }, { "last_name": "Cleve", "initials": "R.E.", "first_name": "Richard", "role": "Auteur", "index_number": 0 } ] }, { "title": "Power from random strings", "year": 2006, "edition": "35", "start": 1467, "end": 1493, "type": "Wetenschappelijk artikel", "journal_title": "SIAM J. Comput", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Koucky", "initials": "M.", "first_name": "Michal", "role": "Auteur", "index_number": 0 }, { "last_name": "Melkebeek", "initials": "D.", "prefix": "van", "role": "Auteur", "index_number": 0 }, { "last_name": "Ronneburger", "initials": "D.", "role": "Auteur", "index_number": 0 }, { "last_name": "Allender", "initials": "E.", "role": "Auteur", "index_number": 0 } ] }, { "title": "What can be efficiently reduced to the kolmogorov-random strings?", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "Ann. Pure Appl. Logic", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Koucky", "initials": "M.", "first_name": "Michal", "role": "Auteur", "index_number": 0 }, { "last_name": "Allender", "initials": "E.", "role": "Auteur", "index_number": 0 } ] }, { "title": "On the importance of having an identity or, is consensus really universal?", "year": 2006, "edition": "18", "start": 167, "end": 176, "type": "Wetenschappelijk artikel", "journal_title": "Distributed Computing", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Vitanyi", "initials": "P.M.B.", "first_name": "Paul", "role": "Auteur", "index_number": 0 }, { "last_name": "Panconesi", "initials": "A", "role": "Auteur", "index_number": 0 }, { "last_name": "Silvestri", "initials": "R", "role": "Auteur", "index_number": 0 } ] }, { "title": "Security of quantum bit string commitment depends on the information measure", "year": 2006, "edition": "97", "type": "Wetenschappelijk artikel", "journal_title": "Physical Review Letters", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 }, { "last_name": "Lo", "initials": "H-K", "role": "Auteur", "index_number": 0 }, { "last_name": "Christandl", "initials": "M", "role": "Auteur", "index_number": 0 }, { "last_name": "Hayden", "initials": "P", "role": "Auteur", "index_number": 0 } ] }, { "title": "Quantum verification of matrix products", "year": 2006, "start": 880, "end": 889, "type": "Wetenschappelijk artikel", "journal_title": "17th ACM-SIAM SODA", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Auteur", "index_number": 0 }, { "last_name": "Spalek", "initials": "R.", "role": "Auteur", "index_number": 0 } ] }, { "title": "Toveren met kwantum informatie\nIn boek: Het Raadsel van de Informatie, naar aanleiding van de Paradiso lezingen.", "sub_title": "In boek: Het Raadsel van de Informatie, naar aanleiding van de Paradiso lezingen.", "year": 2006, "type": "Publicatie", "authors": [ { "last_name": "Buhrman", "initials": "H.M.", "first_name": "Harry", "role": "Maker", "index_number": 0 } ] }, { "title": "Entropic uncertainty relations and locking: tight bounds for mutually unbiased bases", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "Physical Review A, 2006.", "authors": [ { "last_name": "Ballester Sanchez", "initials": "M.A.", "first_name": "Manuel", "role": "Auteur", "index_number": 0 }, { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 } ] }, { "title": "Locking with three mutually unbiased bases", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "quantph", "authors": [ { "last_name": "Ballester Sanchez", "initials": "M.A.", "first_name": "Manuel", "role": "Auteur", "index_number": 0 }, { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 } ] }, { "title": "Optimal estimation of su(d) using exact and approximate 2-designs", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "quantph", "authors": [ { "last_name": "Ballester Sanchez", "initials": "M.A.", "first_name": "Manuel", "role": "Auteur", "index_number": 0 } ] }, { "title": "Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval", "year": 2005, "edition": "3580", "start": 1424, "end": 1436, "type": "Wetenschappelijk artikel", "journal_title": "Proceedings of the 32nd ICALP", "authors": [ { "last_name": "Wolf", "initials": "R.M.", "first_name": "Ronald", "prefix": "de", "role": "Auteur", "index_number": 0 }, { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 } ] }, { "title": "Quantum Anonymous Transmissions", "year": 2005, "edition": "3788", "start": 217, "end": 235, "type": "Wetenschappelijk artikel", "journal_title": "Proceedings of 11th ASIACRYPT", "authors": [ { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 }, { "last_name": "Christandl", "initials": "M", "role": "Auteur", "index_number": 0 } ] }, { "title": "Entanglement in Interactive Proof Systems with Binary Answers", "year": 2006, "edition": "3884", "start": 162, "end": 171, "type": "Wetenschappelijk artikel", "journal_title": "Proceedings of STACS 2006", "authors": [ { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 } ] }, { "title": "Tsirelson bounds for generalized {C}lauser-{H}orne-{S}himony-{H}olt inequalities", "year": 2006, "edition": "73", "type": "Wetenschappelijk artikel", "journal_title": "Physical Review A", "authors": [ { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 0 } ] }, { "title": "Cryptography in a quantum world", "year": 2008, "edition": "1", "type": "Proefschrift", "journal_title": "Centrum voor Wiskunde en Informatica", "isbn": "90-6196-544-6", "city": "AMSTERDAM", "authors": [ { "last_name": "Wehner", "initials": "S.D.C.", "first_name": "Stephanie", "role": "Auteur", "index_number": 1 } ] }, { "title": "Enumerations of the kolmogorov function", "year": 2006, "edition": "7", "start": 501, "end": 528, "type": "Wetenschappelijk artikel", "journal_title": "Journal on Symbolic Logic", "authors": [ { "last_name": "Muchnik", "initials": "A", "role": "Auteur", "index_number": 0 }, { "last_name": "Stephan", "initials": "F", "role": "Auteur", "index_number": 0 }, { "last_name": "Buhrman", "initials": "H", "role": "Auteur", "index_number": 0 }, { "last_name": "Fortnow", "initials": "L", "role": "Auteur", "index_number": 0 }, { "last_name": "Longpre", "initials": "L", "role": "Auteur", "index_number": 0 }, { "last_name": "Torenvliet", "initials": "L", "role": "Auteur", "index_number": 0 }, { "last_name": "Grabowski", "initials": "P", "role": "Auteur", "index_number": 0 }, { "last_name": "Beigel", "initials": "R.", "role": "Auteur", "index_number": 0 }, { "last_name": "Feijer", "initials": "p", "role": "Auteur", "index_number": 0 } ] }, { "title": "Complexity of ring morphism problems.", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "Conference on Computational Complexity", "authors": [ { "last_name": "Kayal", "initials": "N", "role": "Auteur", "index_number": 0 }, { "last_name": "Saxena", "initials": "N.C.", "role": "Auteur", "index_number": 0 } ] }, { "title": "Polynomial identity testing for depth 3 circuits.", "year": 2006, "type": "Wetenschappelijk artikel", "journal_title": "Conference on Computational Complexity", "authors": [ { "last_name": "Kayal", "initials": "N", "role": "Auteur", "index_number": 0 }, { "last_name": "Saxena", "initials": "N.C.", "role": "Auteur", "index_number": 0 } ] }, { "title": "Quantum Algorithms, Lower Bounds, and Time-Space Tradeoffs.", "year": 2007, "edition": "1", "type": "Proefschrift", "journal_title": "???", "authors": [ { "last_name": "Spalek", "initials": "R.", "role": "Auteur", "index_number": 0 } ] }, { "title": "Kolmogorov Complexity and Formula Size Lower Bounds.", "year": 2007, "edition": "1", "type": "Proefschrift", "journal_title": "???", "authors": [ { "last_name": "Lee", "initials": "T.J.", "role": "Auteur", "index_number": 0 } ] } ] } ] }