The paper introduces QXymb, a framework for building observational declarative twins of quantum circuits, and presents its first complete order‑0 specialization, QILP‑0. QILP‑0 transforms observed circuit behavior into a finite multi‑valued propositional logic program by incrementally traversing a declared family of quantum observables, quantifying progress via reference‑relative coverage, and preserving observational semantics through deterministic mapping back to original observable columns. Validation on Bars & Stripes and MNIST quantum machine learning settings shows that the induced QILP‑0 theory achieves perfect, conflict‑free reconstruction of the discrete relations, with logical exactness separated from numerical and discretization uncertainties. whyItMatters":"The work demonstrates a method to construct exact observational declarative twins of quantum circuits, enabling precise logical reconstruction of quantum behavior independent of numerical uncertainties."
arXiv:2607. 20377v1 Announce Type: cross Abstract: Quantum-kernel methods encode a dataset's geometry in a Gram matrix, so learning claims on hardware kernels assume the intended geometry survives execution.
arXiv:2607. 09632v1 Announce Type: cross Abstract: Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error correction.
arXiv:2607. 04598v1 Announce Type: cross Abstract: Expressive parameterized quantum circuits (PQCs) are often designed under a dilemma: the growth of expressibility and entangling power (EP) that improves Hilbert-space coverage is also expected to randomize an ansatz and activate barren-plateau (BP) conditions.
Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates. We study this problem using a compact 44.
arXiv:2605. 30358v2 Announce Type: replace Abstract: Quantum computing remains in the Noisy Intermediate-Scale Quantum (NISQ) era, with performance constrained by noise.
QEncodeBench evaluates whether large language models can translate classical constraint problems into verified quantum phase oracles. The benchmark measures the correctness of generated circuits using an adversarial self‑validated verifier that checks full solution‑set equivalence while enforcing resource limits. Results show that models lacking a reasoning mode perform poorly, whereas enabling native reasoning improves accuracy tenfold; semantic errors dominate, and neuro‑symbolic pipelines close most gaps by delegating critical composition to deterministic procedures.
The study reports on three separate executions of a four‑qubit ZZ feature map on the ibm_fez backend, each using 1024 shots per circuit. The authors compare the resulting hardware‑reconstructed Gram matrices to an exact statevector reference, finding off‑diagonal RMSE values of 0.0878, 0.0864, and 0.0427 for the baseline, dynamical decoupling, and gate‑twirling jobs respectively, and centered kernel alignment scores ranging from 0.933 to 0.989. The gate‑twirling job shows the smallest deviation across all metrics, while the baseline job’s contrasts remain stable under deletion‑stable diagnostics; the study notes that sampling alone cannot explain the observed errors and that implementation fidelity and task relevance are distinct diagnostic axes.
The paper investigates whether quantum reinforcement learning algorithms can be matched by efficient classical methods. It focuses on a simplified reinforcement learning setting with a uniform generative model, providing finite‑sample guarantees for classical kernelized Fitted Q‑Iteration that uses kernels aligned with parameterized quantum circuits. The authors identify sufficient conditions on data encoding, kernel choice, and problem structure under which this classical approach dequantizes quantum Q‑learning, and suggest using kernelized Fitted Q‑Iteration as a heuristic when those conditions cannot be verified.
arXiv:2607. 12780v1 Announce Type: cross Abstract: Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates.
arXiv:2608. 12936v1 Announce Type: cross Abstract: As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks.
arXiv:2607. 20943v1 Announce Type: cross Abstract: Quantum Phase Estimation (QPE) is a foundational algorithm for molecular ground-state energy estimation, but its deep circuit requirements make direct hardware execution impractical on Noisy Intermediate-Scale Quantum (NISQ) devices.
The paper proposes reverse n‑wise output‑oriented testing for AI/ML and quantum computing systems, a method that builds covering arrays over output equivalence classes, confidence buckets, decision boundaries, fairness partitions, embedding clusters, ranking stability bands, quantum measurement distributions, and error syndrome patterns. It then uses gradient‑free metaheuristic optimization to solve the inverse mapping problem, generating input configurations or quantum circuit parameters that trigger specific behavioral signatures in opaque models. The framework claims to provide explicit coverage guarantees, higher fault detection rates for calibration, boundary, and error syndromes, improved test suite efficiency, and automated partition discovery for MLOps and quantum validation pipelines.