Workshop on Models, Algorithms, Computability and Discrete Structures (WMACS) 2026
Embedded Files
23 April 2026 - University of Immaculate Conception, Davao City
WMACS 2026: Tutorial Workshop – 2026 UIC – Bajada Campus, Davao
Program
23 April 2026, JHS Complab 1
8:00am – 9:00am Opening Ceremonies
Welcome Remarks:
Beyond the Turing Machine- Computability, Complexity,
and Unconventional Models
Henry Adorna (UP Diliman)
9:00am – 10:30am Tutorial 1 (Part 1):
Spiking neural P systems: parallel and brain-inspired model of computation
Francis Cabarle (UP Diliman)
10:30am – 10:45am Coffee Break
10:45am – 12:15pm Tutorial 1 (Part 2):
Spiking neural P systems: parallel and brain-inspired model of computation
Francis Cabarle (UP Diliman)
12:00nn – 1:00pm Lunch Break
1:00pm – 2:30pm Tutorial 2 (Part 1):
Introduction to Recursion Theory
Alfonso Labao (UP Diliman)
2:30pm – 2:45pm Coffee Break
2:45pm – 4:15pm Tutorial 2 (Part 2):
Introduction to Recursion Theory
Alfonso Labao (UP Diliman)
4:15pm – 5:00pm Short Talks (15 minute-Talk)
An Introduction to Level-Synchronized Tree Automata for Verification of Quantum Circuits
Marc Jermaine Pontiveros <mcpontiveros@up.edu.ph>
Comparison of Different Quantum LRCs and the Hermitian construction
Immanuel Josiah Balete <baletejosiah@gmail.com>
LLM-Based Neurosymbolic AI
Junel Alje Isanan <jbisanan@up.edu.ph>
5:00pm Closing Ceremonies
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
WMACS 2026: Short Talks (15 minute-Talk)
UIC – Bajada Campus, Davao
4:15pm - 4:30pm
An Introduction to Level-Synchronized Tree Automata for Verification of Quantum Circuits
Marc Jermaine Pontiveros <mcpontiveros@up.edu.ph>
Extended Abstract:
In this talk, we present an automata-theoretic approach to the formal verification of quantum circuits, based on the observation that quantum states and circuit actions admit structured symbolic representations. In the standard linear-algebraic view, an n-qubit state is represented by a vector with 2^n amplitudes, making even small verification tasks difficult to perform explicitly. As an alternative, we represent an n-qubit state as a perfect binary tree of height n, where each leaf corresponds to an amplitude. The sets of quantum states can then be described symbolically by tree automata rather than by explicit enumeration.
The talk is organized into three parts. The first part introduces the tree representation of quantum states and explains how basic quantum gates can be interpreted as subtree transformations. The second part discusses the limitations of ordinary tree automata and motivates the need for level synchronization. The third part shows how Level-Synchronized Tree Automata (LSTAs) support the formal verification of quantum circuits, together with illustrative examples. Overall, the talk presents LSTAs as a bridge between linear-algebraic semantics, automata theory, and formal verification.
Reference:
P. A. Abdulla, Y.-G. Chen, Y.-F. Chen, L. Holík, O. Lengál, J.-A. Lin, F.-Y. Lo, and W.-L. Tsai, “Verifying Quantum Circuits with Level-Synchronized Tree Automata,” in Proceedings of the ACM on Programming Languages 9 (POPL), 2025, pp. 923–953.
4:30pm - 4:45pm
Comparison of Different Quantum LRCs and the Hermitian construction
Immanuel Josiah Balete <baletejosiah@gmail.com>
Abstract
Quantum locally recoverable codes (qLRCs) aim to protect distributed quantum data while keeping recovery local: an erased qudit should be recoverable by acting on a small neighborhood rather than the full block. Several constructions now achieve near-optimal trade-offs among rate, distance, and locality, but they rely on distinct algebraic mechanisms and lead to distinct parameter regimes. We compare three representative approaches. The first is the CSS-based quantum Tamo–Barg (qTB) construction of Golowich and Guruswami, which enforces locality through structured parity checks in polynomial evaluation codes. The second is the Hermitian construction of Ashikhmin and Knill, which produces stabilizer codes from Hermitian self-orthogonal codes over Fq2 . The third is the Hermitian dual-containing framework of Galindo et al., which yields optimal quantum (r, δ)-LRCs from dual-containing MDS codes and clarifies how classical locality transfers to the quantum setting. Alongside a side-by-side summary of assumptions, parameters, and decoding considerations, we include small numerical examples to highlight the practical rate–distance–locality trade-offs. Our comparison suggests that Hermitian methods offer conceptual simplicity and parameter flexibility, while qTB provides strong locality with an explicit polynomial-time decoding route; understanding when dual-containing conditions can be relaxed remains a natural direction for further work.
4:45pm - 5:00pm
LLM-Based Neurosymbolic AI
Junel Alje Isanan <jbisanan@up.edu.ph>
Abstract:
While Large Language Models excel at fluency, they often fail at logical consistency. This presentation surveys how Neuro-Symbolic AI bridges this "verification gap" by marrying probabilistic generation with deterministic execution. Through a deep dive into Program-Aided Language Models (PAL) and Toolformer, we demonstrate how offloading reasoning to external symbolic tools creates a more reliable and verifiable AI architecture.
Page updated
Report abuse