The paper introduces the Quantum Scrambling Born Machine, a quantum generative model that uses a fixed entangling unitary—acting as a scrambling reservoir—to generate multi‑qubit entanglement while only optimizing single‑qubit rotations. Three types of entanglers are examined: a Haar random unitary, a finite‑depth brickwork random circuit, and analog time evolution under nearest‑neighbor spin‑chain Hamiltonians. The study finds that once the entangler achieves near‑Haar‑typical entanglement, the model can learn benchmark distributions with little sensitivity to the specific scrambler, and that making the Hamiltonian couplings trainable turns the task into a variational Hamiltonian problem with performance competitive with classical generative models at comparable parameter counts.
arXiv:2608. 05110v1 Announce Type: cross Abstract: Near-term quantum hardware limits circuit depth and often imposes geometrically local connectivity for quantum generative models, restricting the output distributions accessible to shallow unitary Born models.
arXiv:2602.22061v3 Announce Type: replace-cross Abstract: Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum phys...
The paper investigates quantum reservoir computing using highly scrambling quantum systems modeled by high‑order unitary designs. It shows that in noiseless settings, measurement readouts become exponentially concentrated as the reservoir size grows, but this concentration does not worsen with repeated iterations, while memory of early inputs decays exponentially with both reservoir size and iterations. In noisy environments, memory also decays exponentially over time for local noisy channels, and the study introduces new proof techniques for bounding concentration in temporal quantum models. Numerical results indicate that even physical reservoirs, such as an Ising model in a quantum‑chaotic phase, can exhibit exponential concentration, whereas reservoirs in a many‑body localized phase or at the edge of chaos do not.
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.
arXiv:2411. 19896v2 Announce Type: replace-cross Abstract: Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous.
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.
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:2508. 19857v3 Announce Type: replace Abstract: Many successful families of generative models leverage a low-dimensional latent distribution that is mapped to a data distribution.
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:2606. 20504v1 Announce Type: cross Abstract: We present a systematic study of von Neumann entropy estimation in multi-qutrit quantum systems using two complementary approaches: variational quantum algorithms (VQAs) and classical convolutional neural networks (CNNs), evaluated using an ideal (noise-free) quantum simulator.
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:2606. 29636v1 Announce Type: cross Abstract: An important task in quantum computing is unitary circuit synthesis compatible with physical hardware constraints.