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.
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. For both near-term and early fault-tolerant settings, the measurement protocol must balance statistical efficiency against implementation resources such as circuit depth, connectivity, and entangling-gate count.
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.
The paper introduces HamQASBench, a structure‑aware benchmark for quantum architecture search that includes eleven molecular Hamiltonians up to fourteen qubits, exact references, and a comprehensive evaluation protocol. The protocol combines energy accuracy, success rates, reference‑relative circuit cost, local entropy profiles for non‑degenerate targets, and state identification within degenerate ground subspaces. Experiments with five methods across four search paradigms show that energy‑only comparisons miss important differences, such as varying gate counts, distinct spin components in degenerate cases, and differing entanglement profiles, while still achieving chemical accuracy on a near‑product instance.
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
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.
arXiv:2512. 01317v3 Announce Type: replace-cross Abstract: Measurement-induced entanglement (MIE) captures how local measurements generate long-range quantum correlations and drive dynamical phase transitions in many-body systems.
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.
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.
Circuit cutting lets a large quantum neural network (QNN) run as independent subcircuits on small devices, but rebuilding its outputs by reconstruction carries a classical sampling overhead exponential in the number of cuts - the dominant runtime cost in prior work. We ask whether, for machine-learning tasks, this step is necessary, and replace it with late fusion: each subcircuit is trained and measured independently, and a small classical head combines their outputs - a linear-cost, decision-level combination borrowed from multimodal learning.
arXiv:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
arXiv:2604. 01197v4 Announce Type: replace-cross Abstract: Learning quantum states from measurement data is a central problem in quantum information and computational complexity.
Quantum MeanFlow (QMF) is a new quantum generative sampling method that enables single‑step sample generation by learning an average velocity field over a time interval, unlike the multi‑step quantum flow matching (QFM) which requires sequential integration of an ordinary differential equation. Using parameterized quantum circuits, the authors benchmark QMF and QFM on the MNIST dataset, finding that QMF produces lower image quality than multi‑step QFM but outperforms single‑step QFM at every shot count. Both models were executed on IBM quantum computers, and best‑of‑N rejection sampling mitigates device noise without circuit modification, demonstrating QMF’s practicality for efficient single‑step quantum generative sampling.