{ "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-03T00:00:00", "count": 1, "per_page": 100, "pages": 1, "page": 1 }, "projects": [ { "project_id": "VI.Vidi.192.109", "title": "Mathematics of Quantum Algorithms", "funding_scheme_id": 3628, "funding_scheme": "NWO-Talentprogramma Vidi ENW 2018", "department": "Exacte en Natuurwetenschappen", "sub_department": "Exacte en Natuurwetenschappen", "start_date": "2020-04-01T00:00:00", "end_date": "2025-03-31T00:00:00", "reporting_year": 2019, "summary_nl": "Het ontdekken van nieuwe kwantumalgoritmen is meer een kunst dan wetenschap. Terwijl men doorgaans zoekt naar een kwantumalgoritme dat een specifiek probleem kan oplossen, richt dit project zich op het creëren van algemene kwantumsubroutines. Net als Lego-blokken kunnen ze potentieel worden gebruikt om veel nieuwe kwantumalgoritmen te bouwen. Onze belangrijkste focus ligt op het creëren van subroutines voor problemen met een zeer hoge mate van symmetrie.", "summary_en": "Discovering new quantum algorithms is more of an art than science. While typically one looks for a quantum algorithm that can solve a specific problem, this project focuses on creating general quantum subroutines. Just like Lego blocks, they can potentially be used to build many new quantum algorithms. Our main focus is on creating subroutines for problems with a very high degree of symmetry.", "award_amount": 800000, "grant_id": "https://doi.org/10.61686/SBYZY26003", "summary_updates": [ { "submission_date": "2022-11-01T15:06:30", "update_en": "Consider the following simple problem: given a list of numbers, determine which of the numbers occurs the most often. This problem, known as \"majority vote\", becomes more difficult when instead of numbers you are given quantum states. Indeed, in general you cannot even determine which quantum state you have since looking at the state will also disturb it! Despite this, we have developed a quantum algorithm that can solve the \"quantum majority vote\" problem. The key idea is to look at the state in such a way that only the part that does not affect the answer is destroyed.", "update_nl": "Overweeg het volgende eenvoudige probleem: bepaal, gegeven een lijst met getallen, welk van de getallen het vaakst voorkomt. Dit probleem, bekend als \"meerderheidsstemming\", wordt moeilijker wanneer je in plaats van getallen kwantumtoestanden krijgt. In het algemeen kun je zelfs niet eens bepalen welke kwantumtoestand je hebt, aangezien kijken naar de toestand deze ook zal verstoren! Desondanks hebben we een kwantumalgoritme ontwikkeld dat het probleem van de \"kwantum meerderheidsstem\" kan oplossen. Het belangrijkste idee is om zo naar de staat te kijken dat alleen het deel dat het antwoord niet beïnvloedt, wordt vernietigd." }, { "submission_date": "2025-08-18T15:14:44", "update_en": "This project studied quantum algorithms for problems with very high degree of symmetry. We developed new quantum algorithms and subroutines for efficiently processing quantum information, as well as new mathematical tools and software for solving a large class of symmetric problems in quantum information. These results have applications in quantum information, such as for port-based teleportation.", "update_nl": "Dit project onderzocht kwantumalgoritmen voor problemen met een zeer hoge mate van symmetrie. We ontwikkelden nieuwe kwantumalgoritmen en subroutines voor het efficiënt verwerken van kwantuminformatie, evenals nieuwe wiskundige hulpmiddelen en software voor het oplossen van een grote klasse symmetrische problemen in kwantuminformatie. Deze resultaten hebben toepassingen in kwantuminformatie, zoals voor poortgebaseerde teleportatie." }, { "submission_date": "2025-08-18T15:14:44", "update_en": "This project studied quantum algorithms for problems with very high degree of symmetry. We developed new quantum algorithms and subroutines for efficiently processing quantum information, as well as new mathematical tools and software for solving a large class of symmetric problems in quantum information. These results have applications in quantum information, such as for port-based teleportation.", "update_nl": "Dit project onderzocht kwantumalgoritmen voor problemen met een zeer hoge mate van symmetrie. We ontwikkelden nieuwe kwantumalgoritmen en subroutines voor het efficiënt verwerken van kwantuminformatie, evenals nieuwe wiskundige hulpmiddelen en software voor het oplossen van een grote klasse symmetrische problemen in kwantuminformatie. Deze resultaten hebben toepassingen in kwantuminformatie, zoals voor poortgebaseerde teleportatie.\n\n\n\nVertaald met DeepL.com (gratis versie)" } ], "project_members": [ { "role": "Researcher", "member_id": 522358, "last_name": "Burchardt", "degree_pre_nominal": "dr.", "initials": "A.", "first_name": "Adam", "organisation": "Universiteit van Amsterdam||Faculteit der Natuurwetenschappen, Wiskunde en Informatica (Faculty of Science)||Institute for Logic, Language and Computation (ILLC)", "organisation_id": 57871, "ror": "https://ror.org/04dkp9463", "active": false }, { "role": "Researcher", "member_id": 522357, "last_name": "Grinko", "degree_pre_nominal": "dr.", "initials": "D.A.", "first_name": "Dmitry", "organisation": "Universiteit van Amsterdam||Faculteit der Natuurwetenschappen, Wiskunde en Informatica (Faculty of Science)||Institute for Logic, Language and Computation (ILLC)", "organisation_id": 57871, "ror": "https://ror.org/04dkp9463", "active": false }, { "role": "Researcher", "member_id": 363896, "last_name": "Ozols", "degree_pre_nominal": "dr.", "initials": "M.", "first_name": "Maris", "organisation": "Universiteit van Amsterdam||Faculteit der Natuurwetenschappen, Wiskunde en Informatica (Faculty of Science)||Institute for Logic, Language and Computation (ILLC)", "organisation_id": 57871, "ror": "https://ror.org/04dkp9463", "active": false, "orcid": "https://orcid.org/0000-0002-3238-8594" }, { "role": "Main Applicant", "member_id": 363896, "last_name": "Ozols", "degree_pre_nominal": "dr.", "initials": "M.", "first_name": "Maris", "organisation": "Universiteit van Amsterdam||Faculteit der Geesteswetenschappen||Institute for Logic, Language and Computation (ILLC)", "organisation_id": 323577, "ror": "https://ror.org/04dkp9463", "active": true, "orcid": "https://orcid.org/0000-0002-3238-8594" }, { "role": "Project leader", "member_id": 363896, "last_name": "Ozols", "degree_pre_nominal": "dr.", "initials": "M.", "first_name": "Maris", "organisation": "Universiteit van Amsterdam||Faculteit der Natuurwetenschappen, Wiskunde en Informatica (Faculty of Science)||Institute for Logic, Language and Computation (ILLC)", "organisation_id": 57871, "ror": "https://ror.org/04dkp9463", "active": true, "orcid": "https://orcid.org/0000-0002-3238-8594" } ], "products": [ { "title": "Distinguishing graph states by the properties of their marginals", "year": 2025, "edition": "5", "start": 52449, "end": 52449, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1103/PhysRevA.111.052449", "journal_title": "Physical Review A", "authors": [ { "last_name": "Burchardt", "initials": "A", "first_name": "Adam", "role": "Auteur" }, { "last_name": "Pappa", "initials": "A", "first_name": "Anna", "role": "Auteur" }, { "last_name": "Hahn", "initials": "F", "first_name": "Frederik", "role": "Auteur" }, { "last_name": "Jong", "initials": "J", "first_name": "Jarn", "prefix": "de", "role": "Auteur" }, { "last_name": "Vandré", "initials": "L", "first_name": "Lina", "role": "Auteur" }, { "last_name": "Gühne", "initials": "O", "first_name": "Otfried", "role": "Auteur" } ] }, { "title": "General stabilizer approach for constructing highly entangled graph states", "year": 2022, "edition": "6", "start": 62424, "end": 62424, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1103/PhysRevA.106.062424", "journal_title": "Physical Review A", "authors": [ { "last_name": "Burchardt", "initials": "A", "first_name": "Adam", "role": "Auteur" }, { "last_name": "Barnes", "initials": "E", "first_name": "Edwin", "role": "Auteur" }, { "last_name": "Raissi", "initials": "Z", "first_name": "Zahra", "role": "Auteur" } ] }, { "title": "The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States", "year": 2025, "edition": "9", "start": 1720, "end": 1720, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.22331/q-2025-04-24-1720", "journal_title": "Quantum", "authors": [ { "last_name": "Burchardt", "initials": "A", "first_name": "Adam", "role": "Auteur" }, { "last_name": "Hahn", "initials": "F", "first_name": "Frederik", "role": "Auteur" } ] }, { "title": "Entanglement classification via a single entanglement measure", "year": 2024, "edition": "3", "start": 32424, "end": 32424, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1103/PhysRevA.109.032424", "journal_title": "Physical Review A", "authors": [ { "last_name": "Burchardt", "initials": "A", "first_name": "Adam", "role": "Auteur" }, { "last_name": "M. Quinta", "initials": "GM", "first_name": "Gonçalo", "role": "Auteur" }, { "last_name": "André", "initials": "R", "first_name": "Rui", "role": "Auteur" } ] }, { "title": "Orthonormal bases of extreme quantumness", "year": 2024, "edition": "8", "start": 1234, "end": 1234, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.22331/q-2024-01-25-1234", "journal_title": "Quantum", "authors": [ { "last_name": "Burchardt", "initials": "A", "first_name": "Adam", "role": "Auteur" }, { "last_name": "Życzkowski", "initials": "K", "first_name": "Karol", "role": "Auteur" }, { "last_name": "Rudziński", "initials": "M", "first_name": "Marcin", "role": "Auteur" } ] }, { "title": "Span programs and quantum time complexity", "year": 2020, "edition": "1", "start": 26, "end": 26, "type": "Productbijdrage", "url_open_access": "https://doi.org/10.4230/LIPIcs.MFCS.2020.26", "journal_title": "Schloss Dagstuhl--Leibniz-Zentrum für Informatik", "city": "Dagstuhl, Germany", "authors": [ { "last_name": "Piedrafita", "initials": "A", "first_name": "Alvaro", "role": "Auteur" }, { "last_name": "Cornelissen", "initials": "A", "first_name": "Arjan", "role": "Auteur" }, { "last_name": "Kráľ", "initials": "D", "first_name": "Daniel", "role": "Editor" }, { "last_name": "Esparza", "initials": "J", "first_name": "Javier", "role": "Editor" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Jeffery", "initials": "S", "first_name": "Stacey", "role": "Auteur" } ] }, { "title": "Streaming quantum state purification", "year": 2025, "edition": "9", "start": 1603, "end": 1603, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.22331/q-2025-01-21-1603", "journal_title": "Quantum", "authors": [ { "last_name": "Childs", "initials": "AM", "first_name": "Andrew", "role": "Auteur" }, { "last_name": "Leung", "initials": "D", "first_name": "Debbie", "role": "Auteur" }, { "last_name": "Fu", "initials": "H", "first_name": "Honghao", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Vyas", "initials": "V", "first_name": "Vedang", "role": "Auteur" }, { "last_name": "Li", "initials": "Z", "first_name": "Zhi", "role": "Auteur" } ] }, { "title": "Simulating large quantum circuits on a small quantum computer", "year": 2020, "edition": "15", "start": 150504, "end": 150504, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1103/PhysRevLett.125.150504", "journal_title": "Physical Review Letters", "authors": [ { "last_name": "Harrow", "initials": "A", "first_name": "Aram", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Peng", "initials": "T", "first_name": "Tianyi", "role": "Auteur" }, { "last_name": "Wu", "initials": "X", "first_name": "Xiaodi", "role": "Auteur" } ] }, { "title": "Quantum Policy Gradient Algorithms", "year": 2023, "start": 13, "end": 13, "type": "Productbijdrage", "url_open_access": "https://doi.org/10.4230/LIPIcs.TQC.2023.13", "journal_title": "Schloss Dagstuhl – Leibniz-Zentrum für Informatik", "city": "Dagstuhl, Germany", "authors": [ { "last_name": "Cornelissen", "initials": "A", "first_name": "Arjan", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Walter", "initials": "M", "first_name": "Michael", "role": "Editor" }, { "last_name": "Fawzi", "initials": "O", "first_name": "Omar", "role": "Editor" }, { "last_name": "Jerbi", "initials": "S", "first_name": "Sofiene", "role": "Auteur" }, { "last_name": "Dunjko", "initials": "V", "first_name": "Vedran", "role": "Auteur" } ] }, { "title": "Developing subroutines for the future quantum computer", "year": 2022, "edition": "19", "start": 18, "end": 18, "type": "Publicatie", "url_open_access": "https://ict-research.nl/wordpress/wp-content/uploads/2022/09/IO-magazine-NR3-2022_v3.pdf", "journal_title": "I/O Magazine", "authors": [ { "last_name": "Mols", "initials": "B", "first_name": "Bennie", "role": "Maker" } ] }, { "title": "Quantum-access security of the Winternitz one-time signature scheme", "year": 2021, "edition": "1", "start": 21, "end": 21, "type": "Productbijdrage", "url_open_access": "https://doi.org/10.4230/LIPIcs.ITC.2021.21", "journal_title": "Schloss Dagstuhl--Leibniz-Zentrum für Informatik", "city": "Dagstuhl, Germany", "authors": [ { "last_name": "Manfouo", "initials": "C", "first_name": "Chanelle", "role": "Auteur" }, { "last_name": "Majenz", "initials": "C", "first_name": "Christian", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Tessaro", "initials": "S", "first_name": "Stefano", "role": "Editor" } ] }, { "title": "Local simultaneous state discrimination", "year": 2024, "edition": "5", "start": 52217, "end": 52217, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1103/PhysRevA.109.052217", "journal_title": "Physical Review A", "authors": [ { "last_name": "Majenz", "initials": "C", "first_name": "Christian", "role": "Auteur" }, { "last_name": "Schaffner", "initials": "C", "first_name": "Christian", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Tahmasbi", "initials": "M", "first_name": "Mehrdad", "role": "Auteur" } ] }, { "title": "Parallel repetition of local simultaneous state discrimination", "year": 2025, "edition": "9", "start": 1706, "end": 1706, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.22331/q-2025-04-15-1706", "journal_title": "Quantum", "authors": [ { "last_name": "Schaffner", "initials": "C", "first_name": "Christian", "role": "Auteur" }, { "last_name": "Has", "initials": "J", "first_name": "Jaròn", "role": "Auteur" }, { "last_name": "Escolà-Farràs", "initials": "L", "first_name": "Llorenç", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" }, { "last_name": "Tahmasbi", "initials": "M", "first_name": "Mehrdad", "role": "Auteur" } ] }, { "title": "Linear Programming with Unitary-Equivariant Constraints", "year": 2024, "edition": "12", "start": 278, "end": 278, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1007/s00220-024-05108-1", "journal_title": "Communications in Mathematical Physics", "authors": [ { "last_name": "Grinko", "initials": "D", "first_name": "Dmitry", "role": "Auteur" }, { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Auteur" } ] }, { "title": "Bosonic Randomized Benchmarking with Passive Transformations", "year": 2025, "edition": "2", "start": 20305, "end": 20305, "type": "Wetenschappelijk artikel", "url_open_access": "https://doi.org/10.1103/PRXQuantum.6.020305", "journal_title": "PRX Quantum", "authors": [ { "last_name": "Grinko", "initials": "D", "first_name": "Dmitry", "role": "Auteur" }, { "last_name": "Heinrich", "initials": "M", "first_name": "Markus", "role": "Auteur" }, { "last_name": "Kliesch", "initials": "M", "first_name": "Martin", "role": "Auteur" }, { "last_name": "Arienzo", "initials": "M", "first_name": "Mirko", "role": "Auteur" } ] }, { "title": "Mixed Schur–Weyl duality in quantum information", "year": 2025, "type": "Proefschrift", "url_open_access": "https://hdl.handle.net/11245.1/d9e16c26-ef20-40c5-b847-53c13d1a8a1a", "journal_title": "Universiteit van Amsterdam", "isbn": "978–94–6473–674–8", "city": "Amsterdam", "authors": [ { "last_name": "Grinko", "initials": "D", "first_name": "Dmitry", "role": "Auteur" } ] }, { "title": "What exactly would a full-scale quantum computer be useful for?", "year": 2025, "type": "Publicatie", "url_open_access": "https://www.newscientist.com/article/mg26635393-100-what-exactly-would-a-full-scale-quantum-computer-be-useful-for/", "journal_title": "New Scientist", "authors": [ { "last_name": "Padavic-Callaghan", "initials": "KPC", "first_name": "Karmela", "role": "Maker" } ] }, { "title": "Quantum Quest", "year": 2021, "type": "Overige Output", "url_open_access": "https://www.quantum-quest.nl/", "authors": [ { "last_name": "Ozols", "initials": "M", "first_name": "Maris", "role": "Maker" }, { "last_name": "Walter", "initials": "M", "first_name": "Michael", "role": "Maker" } ] } ] } ] }