complexity analysis 1explorable automata 1history-deterministic automata 1infinite-word acceptance 1parity automata 1
From the 1 of 2 papers with an AI index.
10 citations
- École Normale Supérieure de LyonFR2 papers
- Aix-Marseille UniversitéFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- École Polytechnique Fédérale de LausanneCH1 paper
- Fraunhofer Institute for Telecommunications, Heinrich Hertz InstituteDE1 paper
- Freie Universität BerlinDE1 paper
- Institut de Recherche en Informatique FondamentaleFR1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- Laboratoire d’Informatique et SystèmesFR1 paper
- LIP6FR1 paper
- Lyon 1 UniversitéFR1 paper
- Massachusetts Institute of TechnologyUS1 paper
2 papers
cs.FL2026
Explorable Parity Automata
Emile Hazard, Olivier Idir, Denis Kuperberg
The paper introduces explorable automata, a generalization of history‑deterministic automata that resolves nondeterminism using multiple simultaneous runs, and studies their decisi…
quant-ph2026★ 10 cited
Noise-induced shallow circuits and absence of barren plateaus
Antonio Anna Mele, Armando Angrisani, Soumik Ghosh +4
Motivated by realistic hardware considerations of the pre-fault-tolerant era, we comprehensively study the impact of uncorrected noise on quantum circuits. We first show that in th…