SearcharxivSearch

arXiv · 2605.16044

Quantum Feature Amplification Network (QFAN) as An Autoregressive Quantum Generative Model

Abstract

Simulating calorimeter showers is among the largest computational costs in high-energy physics, and quantum generative models have been proposed as alternatives to classical surrogates. Their progress is hindered by a resource problem. In existing gate-model proposals, the quantum register grows with the image size. Benchmark data sets have thousands of cells and are therefore out of reach. We introduce the Quantum Feature Amplification Network (QFAN), which breaks the link between register size and image size. QFAN splits an image into consecutive blocks of pixels and generates them one block at a time, each produced by the same small circuit conditioned on a fixed-length summary of the pixels already generated. The number of qubits is set by the block size, not by the image dimension. The circuit is used as a sampler. Each block is decoded from a finite set of Born measurement records, so the stochasticity of the generated shower arises from measurement randomness rather than classical noise. A tunable fraction of the records is shared among the pixels within a block to control their correlations. Fast training is performed on a noiseless simulator using analytic gradients, and the resulting model is then deployed on IBM's Heron QPU. Using only three qubits and 12 (18) shared quantum-circuit parameters, QFAN reproduces pixel-intensity spectra, inter-pixel correlations, and total deposited energy for 12- and 25-pixel benchmarks. We quantify the contribution of the quantum component through an ablation study in which individual pipeline elements are removed and the remainder refitted. Replacing the sampled records by their conditional means, which removes only the measurement randomness, collapses the model to a single deterministic image. Leaving the circuit untrained while refitting every classical stage reproduces neither the pixel spectra nor the correlations at either image size.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jamal Slim, Saverio Monaco, Florian Rehm, Dirk Kruecker, Kerstin Borras. 2026-05-15. Quantum Feature Amplification Network (QFAN) as An Autoregressive Quantum Generative Model. https://arxiv.org/abs/2605.16044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph