Skip to content

QILP-0: Constructing Observational Declarative Twins of Quantum Circuits

Sep 2026 · 0 citations · 73 references
Computer Science Physics

TL;DR

This paper introduces QXymb, a general framework for constructing observational declarative twins of quantum circuits, and develops QILP-0, its first complete order-0 specialization, which constructs a finite multi-valued propositional logic program from observed circuit behaviour within a declared observational scope.

Abstract

This paper introduces QXymb, a general framework for constructing observational declarative twins of quantum circuits, and develops QILP-0, its first complete order-0 specialization. QILP-0 constructs a finite multi-valued propositional logic program from observed circuit behaviour within a declared observational scope. The pipeline traverses a declared family of quantum observables incrementally according to a reproducible structural grading and a declared observational reference horizon. Progress is quantified through reference-relative coverage against a fixed target-independent reference. Observable responses are organized through target-independent geometry, while retained latent structure is mapped deterministically back to original observable columns before symbolic processing, preserving observational semantics and provenance. Selected observable profiles are converted into a finite relation through admissible target-independent discretization. The target is used only afterwards to audit twin-admissibility and induce the declarative theory. A theory is certified as an exact observational declarative twin when it completely and correctly reconstructs the resulting finite task-conditioned discrete relation. Logical exactness is therefore separated from numerical, backend, provider, and discretization uncertainty, which is retained as audit metadata. Validation uses two complementary QML settings. Exhaustive Bars&Stripes experiments compare product and grid-CZ embeddings from 16 to 100 qubits and exercise the native-discrete branch. Low-Depth MNIST analyses all 14,708 digit-0/1 instances before and after a trained variational quantum transformation and exercises continuous discretization. In every reported relation, the induced QILP-0 theory achieves complete, conflict-free reconstruction with strict accuracy equal to one.

View source

Similar papers

Preprint Sep 2026

Unifying and Extending Strong Simulation of Quantum Circuits

We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits. A circuit becomes a sum-product query: factors encode gates, internal wire variables are aggregated, and free boundary variables index transition amplitudes. The central insight is that distinct s...

F. Geerts, Rihan Hai, Matthias Lanzinger et al. · 0 citations
Preprint Oct 2026

Sufficient quantum provenance: retained fields and certified recording precision

Which execution details must a quantum computation retain, and to what precision, to support a declared comparison? We define a sufficient record by the largest Hellinger distance between outcome laws that share it. Our main result is a circuit-derived certificate for continuous recording precision: independent channel...

G. Kourousias, Sergio Carrato, Roberto Pugliese et al. · 0 citations
Preprint Aug 2026

Quantum-Logic Tsetlin Machines: Interpretable Quantum Machine Learning with Commuting Projector Clauses

Tsetlin Machines (TMs) learn interpretable Boolean clauses using finite-state automata. We introduce the Quantum-Logic Tsetlin Machine (QL-TM), which replaces Boolean literals with quantum propositions represented by projectors while retaining classical include/exclude automata. Clauses are restricted to commuting meas...

Krish Bhatia · 0 citations
Preprint Sep 2026

Structured Hamiltonian Learning for Multiqubit Conditional Phase Gates

Accurate measurement of an intended conditional phase does not by itself place a multiqubit phase gate in its declared generalized-gate equivalence class. We cast the diagnosis as structured Hamiltonian learning of the diagonal successful block in a known basis: Ramsey measurements on a connected graph reconstruct a ta...

Xiu-Hao Deng · 0 citations
Preprint Sep 2026

Universal Inductive Inference of Quantum States

Solomonoff's universal inductive inference [Inf. Control. 1964] is one of the most general frameworks for learning from sequential data and predicting future observations. It provides prediction guarantees for any computable stochastic source. We ask whether an analogous universal theory of induction can be developed f...

Taiga Hiroka, Min-Hsiu Hsieh, Yuki Shirakawa · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.