arXiv:2605. 28690v2 Announce Type: replace-cross Abstract: Many applications in quantum simulation, quantum chemistry, and quantum machine learning require not a single quantum state but an ensemble of states characterizing the heterogeneity of a target system.
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: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:2609.06307v1 Announce Type: cross Abstract: We study variational quantum distribution learning through a hierarchy of Walsh--Fourier approximations on the Boolean cube. At each level, a selecte...
arXiv:2608. 14941v1 Announce Type: new Abstract: Counting the global optima of a classical optimization problem is a #P-hard task.
arXiv:2509. 14026v2 Announce Type: replace-cross Abstract: Variational quantum circuits (VQCs) are central to quantum machine learning, while recent progress in Kolmogorov-Arnold networks (KANs) highlights the power of learnable activation functions.
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:2606. 09734v1 Announce Type: cross Abstract: Training parameterised quantum circuits (PQCs) on quantum hardware is bottlenecked by the measurement cost of gradient estimation, which under the parameter-shift rule scales linearly in the number of trainable parameters and dominates the total shot budget of training at scale.
arXiv:2607. 20585v1 Announce Type: cross Abstract: Sample-based Quantum Diagonalization (SQD), an extension of Quantum Selected Configuration Interaction (QSCI), has emerged as a promising hybrid quantum-classical paradigm for computing molecular ground state energies.
The paper proposes a quantum federated learning framework that extends parameter-space geometry to mixed states, using the Bures metric as a local preconditioner and the mean Uhlmann curvature to create an aggregation rule that down‑weights unreliable clients. It provides theoretical convergence guarantees and demonstrates through trapped‑ion quantum emulator experiments that the method retains high accuracy under device heterogeneity and outperforms standard federated averaging, which suffers under strong noise.
arXiv:2607. 05000v1 Announce Type: cross Abstract: Canonical quantization provides a systematic procedure for constructing quantum models from classical Hamiltonians.
arXiv:2512. 17893v2 Announce Type: replace-cross Abstract: Neural Quantum States (NQS) are powerful variational representations of quantum many-body wavefunctions, yet their performance depends sensitively on the chosen basis.