Search Results

Documents authored by Backens, Miriam

Document
DOI: 10.4230/DagRep.15.9.58
Quantum Error Correction Meets ZX-Calculus (Dagstuhl Seminar 25382)

Authors: Miriam Backens, Aleks Kissinger, John van de Wetering, Michael Vasmer, and Sarah Meng Li

Published in: Dagstuhl Reports, Volume 15, Issue 9 (2026)

Abstract
This report documents the Dagstuhl Seminar 25382 "Quantum Error Correction Meets ZX-Calculus". The report consists of an executive summary, as well as abstracts on talks, working groups, panel discussions, and open problems.
Cite as

Miriam Backens, Aleks Kissinger, John van de Wetering, Michael Vasmer, and Sarah Meng Li. Quantum Error Correction Meets ZX-Calculus (Dagstuhl Seminar 25382). In Dagstuhl Reports, Volume 15, Issue 9, pp. 58-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@Article{backens_et_al:DagRep.15.9.58,
  author =	{Backens, Miriam and Kissinger, Aleks and van de Wetering, John and Vasmer, Michael and Li, Sarah Meng},
  title =	{{Quantum Error Correction Meets ZX-Calculus (Dagstuhl Seminar 25382)}},
  pages =	{58--70},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2026},
  volume =	{15},
  number =	{9},
  editor =	{Backens, Miriam and Kissinger, Aleks and van de Wetering, John and Vasmer, Michael and Li, Sarah Meng},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.9.58},
  URN =		{urn:nbn:de:0030-drops-249787},
  doi =		{10.4230/DagRep.15.9.58},
  annote =	{Keywords: fault-tolerance, quantum error correction, ZX-calculus}
}
Document
DOI: 10.4230/LIPIcs.ICALP.2018.12
A Complete Dichotomy for Complex-Valued Holant^c

Authors: Miriam Backens

Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)

Abstract
Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, where any function set considered must contain the two unary functions pinning inputs to values 0 or 1. The complexity classification of Holant problems usually takes the form of dichotomy theorems, showing that for any set of functions in the family, the problem is either #P-hard or it can be solved in polynomial time. Previous such results include a dichotomy for real-valued Holant^c and one for Holant^c with complex symmetric functions, i.e. functions which only depend on the Hamming weight of the input. Here, we derive a dichotomy theorem for Holant^c with complex-valued, not necessarily symmetric functions. The tractable cases are the complex-valued generalisations of the tractable cases of the real-valued Holant^c dichotomy. The proof uses results from quantum information theory, particularly about entanglement. This full dichotomy for Holant^c answers a question that has been open for almost a decade.
Cite as

Miriam Backens. A Complete Dichotomy for Complex-Valued Holant^c. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{backens:LIPIcs.ICALP.2018.12,
  author =	{Backens, Miriam},
  title =	{{A Complete Dichotomy for Complex-Valued Holant^c}},
  booktitle =	{45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
  pages =	{12:1--12:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.12},
  URN =		{urn:nbn:de:0030-drops-90168},
  doi =		{10.4230/LIPIcs.ICALP.2018.12},
  annote =	{Keywords: computational complexity, counting complexity, Holant problems, dichotomy, entanglement}
}
Document
DOI: 10.4230/LIPIcs.ICALP.2017.16
A New Holant Dichotomy Inspired by Quantum Computation

Authors: Miriam Backens

Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)

Abstract
Holant problems are a framework for the analysis of counting complexity problems on graphs. This framework is simultaneously general enough to encompass many counting problems on graphs and specific enough to allow the derivation of dichotomy results, partitioning all problems into those which are in FP and those which are #P-hard. The Holant framework is based on the theory of holographic algorithms, which was originally inspired by concepts from quantum computation, but this connection appears not to have been explored before. Here, we employ quantum information theory to explain existing results in a concise way and to derive a dichotomy for a new family of problems, which we call Holant^+. This family sits in between the known families of Holant^*, for which a full dichotomy is known, and Holant^c, for which only a restricted dichotomy is known. Using knowledge from entanglement theory -- both previously existing work and new results of our own -- we prove a full dichotomy theorem for Holant^+, which is very similar to the restricted Holant^c dichotomy and may thus be a stepping stone to a full dichotomy for that family.
Cite as

Miriam Backens. A New Holant Dichotomy Inspired by Quantum Computation. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{backens:LIPIcs.ICALP.2017.16,
  author =	{Backens, Miriam},
  title =	{{A New Holant Dichotomy Inspired by Quantum Computation}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{16:1--16:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.16},
  URN =		{urn:nbn:de:0030-drops-74383},
  doi =		{10.4230/LIPIcs.ICALP.2017.16},
  annote =	{Keywords: computational complexity, counting complexity, Holant, dichotomy, entanglement}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact