arXiv:2608. 14941v1 Announce Type: new Abstract: Counting the global optima of a classical optimization problem is a #P-hard task.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
arXiv:2607. 20225v1 Announce Type: cross Abstract: While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces.
arXiv:2607. 04845v1 Announce Type: cross Abstract: Quantum Architecture Search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms, yet existing benchmarks organize instances by molecular identity or qubit count -- criteria agnostic to Hamiltonian structure -- and rely solely on energy accuracy, which cannot detect structural failures such as over-parameterization on near-product ground states.
arXiv:2609.39164v1 Announce Type: new Abstract: Score-based variational inference (VI) provides an alternative to Kullback--Leibler (KL)-based VI by minimizing the Fisher divergence between the varia...
arXiv:2608. 11396v1 Announce Type: cross Abstract: Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget.
Quantum Architecture Search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms, yet existing benchmarks organize instances by molecular identity or qubit count -- criteria agnostic to Hamiltonian structure -- and rely solely on energy accuracy, which cannot detect structural failures such as over-parameterization on near-product ground states. We introduce HamQASBench, a Hamiltonian-informed diagnostic benchmark organizing 11 molecules into five structural tiers via fingerprints derived from the Pauli operator basis, computational basis representation, and ground-state entanglement.
The paper introduces Fermi-Dirac thermal measurements as a new framework for quantum hypothesis testing and semidefinite optimization. By treating measurement eigenmodes as independent fermionic modes, the authors show that minimizing fermionic free energy yields optimal measurements whose eigenvalues follow Fermi‑Dirac distributions. These measurements can be learned with classical or hybrid quantum‑classical algorithms, leading to a new quantum machine‑learning model—Fermi‑Dirac machines—and a novel approach to semidefinite optimization on quantum computers.