Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Symmetry-Aware Independent Bit-Flip: Identifiability-Guided Distribution Learning for Quantum Noise Simulation

Yi Pan, Meng Hsiu Tsai, Hanqi Jiang, Junhao Chen, Weihang You, Yifan Zhou, Wei Zhang, Isaac Lyngaas, Yingfeng Wang, Tianming Liu

Published May 19, 2026• 0 citations
Publisher

Abstract

Abstract Quantum and hybrid quantum-classical workflows repeatedly need to predict how ideal circuit distributions appear as finite-shot noisy hardware histograms, but refitting high-dimensional noise simulators at each calibration point can be costly. We cast this task as finite-shot distribution learning for structured quantum outputs: given ideal distributions and noisy counts, learn a low-dimensional Markov surrogate and evaluate held-out distributional risk. Existing fast closed-form kernels lack identifiability guarantees, while richer physics-motivated simulators fit approximately 20 BO-tuned noise parameters without parameter-identifiability guarantees. We instantiate this middle ground with SA-IBF, a two-parameter closed-form kernel mixing independent bit-flip noise with a Hamming-sector-preserving component. For the support-face regimes induced by symmetry-preserving circuits, we show a support-face bridge and a rank-conditioned local guarantee at fitted operating points; open-interior genericity establishes non-degeneracy of the full-simplex model. We also show a small-q Fisher upper bound in which the Fisher information for alpha conditional on q scales on the order of N times q squared for N shots and per-qubit flip rate q, certified for 2 to 8 qubits, yielding Cramer-Rao divergence as q approaches zero; analytic-Jacobian diagnostics verify the fitted-point rank premise at all seven representative operating points and all 230 panel fits. On an 890-execution IBM Heron hardware dataset spanning four backends, SA-IBF gives a diagnosable accuracy-cost Pareto point: in matched fitted-physics comparisons, it meets the sector-aware 21-parameter Ji-BO Hellinger accuracy budget on three of four molecular qubit settings while reducing refit cost by 231-447 times under matched implementations. The remaining setting flags a uniform-flip-rate boundary where the tested Ji-BO comparator's heterogeneous parameters lower risk. Supporting calibration evidence shows lower held-out Hellinger distance than plain bit-flip noise on all seven primary configurations and throughout a 400-execution cross-backend molecular panel. These results make SA-IBF a lightweight, identifiability-guided learned distribution-level surrogate for repeated quantum noise simulation in symmetry-structured quantum and hybrid quantum-classical workloads, including symmetry-preserving quantum-machine-learning settings.

DOI
10.21203/rs.3.rs-9740811/v1

Related papers

Efficient and identifiable noise models for symmetry-preserving quantum circuits

Yi Pan, Meng Hsiu Tsai, Hanqi Jiang +7 more

Abstract Noise models support quantum-circuit simulation and need recalibration as hardware and workloads change. For circuits whose ideal outputs occupy one Hamming-weight sector, independent bit-flip (IBF) models tie leakage from the sector to the flip rate. We introduce SA-IBF, a two-parameter closed-form model whose sector-preserving weight mixes independent bit flips with flips conditioned on the sector to control this leakage separately. For nonzero weights, no mixture of product bit-flip channels reproduces its kernel. Given ideal distributions, we derive local identifiability conditions and a rank diagnostic for each fit. Across two data sets on four IBM Heron processors, SA-IBF predicts test data with lower Hellinger distance than IBF on every execution. On molecular quantum-autoencoder circuits, it matches a 21-parameter noise model fitted by Bayesian optimization to within 0.01 in Hellinger distance at three of four qubit numbers, at over 200-fold lower computational cost. This enables low-cost noise modeling of small symmetry-preserving circuits.

•Oct 2, 2026•0 citations

An Analytically Trained Variational Surrogate for Quantum Phase Estimation on NISQ Hardware

Mousumi Kundu, Ashish Kumar Patra, Anurag K. S. V. +4 more

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. We present an analytically grounded variational surrogate framework in which a shallow Variational Quantum Circuit (VQC) is trained to reproduce the QPE measurement distribution without any quantum circuit simulation. The training target is computed entirely classically via the Dirichlet kernel, evaluated directly from the Full Configuration Interaction (FCI) ground-state energy, the ancilla qubit count, and the time evolution parameter, eliminating the exponentially scaling simulation bottleneck of prior surrogate approaches. We apply this framework to the hydrogen molecule (H$_2$) with a symmetry-tapered Hamiltonian, conducting a four-stage experimental investigation on IBM Quantum hardware. Stage 1 compares linear and full entangler topologies for the $R_Y$-$R_Z$-$CZ$ ansatz, with and without XpXm Dynamical Decoupling (DD), across four distributional metrics (Hellinger distance, fidelity error, total variation distance, Jensen-Shannon divergence), identifying the linear entangler as optimal. Stage 2 varies VQC layers ($p=1$ to $5$) for the linear-entangler ansatz, identifying single-layer depth as optimal under hardware noise. Stage 3 applies this configuration to the reduced $R_Y$-$CZ$ ansatz, comparing ideal and noisy simulator-trained parameters. A supplementary noise analysis at $p \in \{8,64\}$ characterizes the depth-dependent interplay between circuit depth and DD effectiveness. The framework enables faithful QPE mimicry using a linearly scaling VQC, recovering the ground-state energy within the chemical accuracy threshold (1 kcal/mol), constituting a scalable, hardware-efficient paradigm for QPE-based molecular energy estimation on NISQ devices.

quant-pharXiv:2607.20943•Jul 24, 2026•0 citations

Data-efficient quantum noise modeling via machine learning

Yanjun Ji, Marco Roth, David A. Kreplin +2 more

Maximizing the computational utility of near-term quantum processors requires predictive noise models that inform robust, noise-aware compilation and error mitigation. Conventional models often fail to capture the complex error dynamics of real hardware or require prohibitive characterization overhead. We introduce a data-efficient framework that first constructs a physically motivated, parameterized noise model, and subsequently employs machine-learning-driven Bayesian optimization to identify its parameters. Our approach circumvents costly characterization protocols by estimating algorithm- and hardware-specific error parameters directly from readily available experimental data derived from existing application and benchmark circuit executions. The generality and robustness of the framework are demonstrated across diverse algorithms and superconducting devices, yielding high-fidelity predictions by estimating an independent parameter set tailored to each specific algorithm-hardware context. Crucially, we show that a model calibrated exclusively on small-scale circuits accurately predicts the behavior of larger validation circuits. Our data-efficient approach achieves up to a 65% improvement in model fidelity quantified by the Hellinger distance between predicted and experimental circuit output distributions, compared to standard noise models derived from device properties. This work establishes a practical paradigm for application-aware noise characterization, enabling compilation and error-mitigation strategies tailored to the specific interplay between quantum algorithms and device-specific noise dynamics.

arXiv:2509.12933•Physical Review Applied•Feb 11, 2026•5 citations

Identifying the Sign of Coherent Over-Rotations with Logarithmically Many Pauli Settings

Yi Pan, Meng Hsiu Tsai, Weihang You +6 more

Calibrating a quantum processor means estimating gate-error parameters from data, and a hard-to-estimate parameter is usually assumed to leave a weak signature more repetitions will resolve. Coherent over-rotations break that premise. For commuting single- and two-qubit transverse over-rotations with known support on a computational-basis input, the passive histogram is exactly invariant under a sign group acting on the coherent angles, of order $2^{n+1}$ for the complete family with $n\ge2$, so no estimator resolves the signs uniformly at any sample size. A calibration correction applied with the wrong sign doubles the rotation error it should remove. At zero angle the obstruction turns continuous, with a Fisher information singular along every coherent direction and an infinite Cramér-Rao bound. At generic angles the continuous defect clears for $5\le n\le8$, the range we compute, while the sign degeneracy persists. Covering the support removes both, and a design resolves the signed angles uniformly exactly when it covers. On $|η_R|<π/2$, $0\le p_R<1/2$ coverage is constructive, returning each angle in closed form from a ratio of two measured expectations without knowing the rates. A twirl-free code of $\lceil\log_2(n+1)\rceil$ added product-Pauli settings covers, and for the complete family none uses fewer. Conditioning then sets the Cramér-Rao cost, and we give its floor explicitly. Exact computation matches the theory, the passive fit stays at chance on the signs at every budget while the closed-form inverse recovers them, and angle magnitudes on two IBM Heron processors follow the conditioning ordering.

quant-pharXiv:2607.21663•Jul 24, 2026•1 citation

Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees

Ferhat Özgür Çatak

On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget $B$ must therefore decide how many distinct training states $n$ to use and how many shots $S$ to allocate to each state. We study this tradeoff for binary quantum classifiers with fixed or independently selected measurement operators $M$, where the ideal score is $Tr(M\rho)$. We prove a distribution-free generalization bound that separates the finite-sample and finite-shot contributions. The sample term scales as $\sqrt{d/n}$, while the shot term scales as $\sqrt{(\log n)/S}$; under the constraint $B=nS$, these two terms move in opposite directions. Minimising a conservative closed-form surrogate of the bound gives the allocation rule $n^{*} = 2\sqrt{2dB/\log(2B/\delta)}$ and $S^{*} = B/nstar$. This surrogate has the same asymptotic scaling as the exact minimizer and yields a worst-case rate of $B^{-1/4}$. The guarantee is intentionally conservative, since it applies to the full class of binary quantum measurements. We complement the theory with PennyLane simulations using 2-qubit and 4-qubit variational quantum circuits on nine synthetic binary classification benchmarks. In all tested configurations, the one-sided empirical generalization gap remains below the theoretical bound. The result provides a conservative statistical guideline for allocating measurement budgets in finite-shot evaluation and pre-experimental planning for near-term quantum learning systems, complementing hardware-level scheduling and circuit-design considerations. Extending the guarantee to fully adaptive shot-noisy training remains an open problem.

arXiv:2608.24891•Jun 1, 2026•0 citations

Symmetry Discovery in Quantum Learning: Observable-Level and Task-Level Inference from Finite Measurements

Zeyu Chen

Symmetry reduces the capacity of a quantum learning model, but the imposed group must match both the measured information and the label transformation. We establish a finite-measurement theory for inferring this group from candidate transformations. The central structural result identifies observable-invisible transformations with the stabilizer of a projected state whenever the probe span is invariant. It turns recovered generators into a valid subgroup and identifies the continuous invisible space with its Lie algebra. For finite dictionaries, an unbiased shadow statistic distinguishes zero from positive squared expectation discrepancies with an inverse-gap measurement rate, improving the inverse-square-gap rate of uniform discrepancy estimation. A commuting qubit lower bound proves the gap dependence optimal at fixed snapshot scale, and simultaneous intervals support data-dependent tolerances. Task validation then tests either the joint distribution through a characteristic kernel or its encoded mean through a classical--quantum discrepancy. An exact group-average identity relates the latter to joint-state asymmetry and specifies its conversion to binary task breaking mass. Projection bias quantifies the cost of excessive symmetry, while an $\ell_1$ readout bound quantifies the capacity gained by relaxing it. At an invariant pure-state backbone, retained and nontrivial breaking sectors are Fisher-orthogonal. Ising-chain calculations connect finite-shot recovery, label-dependent symmetry, and physical sector drift. These results determine which symmetry the measurements support and provide the statistical and geometric basis for a subsequent release decision.

quant-pharXiv:2610.00157•Sep 14, 2026•0 citations
Abstract Quantum and hybrid quantum-classical workflows repeatedly need to predict how ideal circuit distributions appear as finite-shot noisy hardware histograms, but refitting high-dimensional noise simulators at each calibration point can be costly. We cast this task as finite-shot distribution learning for structured quantum outputs: given ideal distributions and noisy counts, learn a low-dimensional Markov surrogate and evaluate held-out distributional risk. Existing fast closed-form kernels lack identifiability guarantees, while richer physics-motivated simulators fit approximately 20 BO-tuned noise parameters without parameter-identifiability guarantees. We instantiate this middle ground with SA-IBF, a two-parameter closed-form kernel mixing independent bit-flip noise with a Hamming-sector-preserving component. For the support-face regimes induced by symmetry-preserving circuits, we show a support-face bridge and a rank-conditioned local guarantee at fitted operating points; open-interior genericity establishes non-degeneracy of the full-simplex model. We also show a small-q Fisher upper bound in which the Fisher information for alpha conditional on q scales on the order of N times q squared for N shots and per-qubit flip rate q, certified for 2 to 8 qubits, yielding Cramer-Rao divergence as q approaches zero; analytic-Jacobian diagnostics verify the fitted-point rank premise at all seven representative operating points and all 230 panel fits. On an 890-execution IBM Heron hardware dataset spanning four backends, SA-IBF gives a diagnosable accuracy-cost Pareto point: in matched fitted-physics comparisons, it meets the sector-aware 21-parameter Ji-BO Hellinger accuracy budget on three of four molecular qubit settings while reducing refit cost by 231-447 times under matched implementations. The remaining setting flags a uniform-flip-rate boundary where the tested Ji-BO comparator's heterogeneous parameters lower risk. Supporting calibration evidence shows lower held-out Hellinger distance than plain bit-flip noise on all seven primary configurations and throughout a 400-execution cross-backend molecular panel. These results make SA-IBF a lightweight, identifiability-guided learned distribution-level surrogate for repeated quantum noise simulation in symmetry-structured quantum and hybrid quantum-classical workloads, including symmetry-preserving quantum-machine-learning settings.
Abstract Noise models support quantum-circuit simulation and need recalibration as hardware and workloads change. For circuits whose ideal outputs occupy one Hamming-weight sector, independent bit-flip (IBF) models tie leakage from the sector to the flip rate. We introduce SA-IBF, a two-parameter closed-form model whose sector-preserving weight mixes independent bit flips with flips conditioned on the sector to control this leakage separately. For nonzero weights, no mixture of product bit-flip channels reproduces its kernel. Given ideal distributions, we derive local identifiability conditions and a rank diagnostic for each fit. Across two data sets on four IBM Heron processors, SA-IBF predicts test data with lower Hellinger distance than IBF on every execution. On molecular quantum-autoencoder circuits, it matches a 21-parameter noise model fitted by Bayesian optimization to within 0.01 in Hellinger distance at three of four qubit numbers, at over 200-fold lower computational cost. This enables low-cost noise modeling of small symmetry-preserving circuits.
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. We present an analytically grounded variational surrogate framework in which a shallow Variational Quantum Circuit (VQC) is trained to reproduce the QPE measurement distribution without any quantum circuit simulation. The training target is computed entirely classically via the Dirichlet kernel, evaluated directly from the Full Configuration Interaction (FCI) ground-state energy, the ancilla qubit count, and the time evolution parameter, eliminating the exponentially scaling simulation bottleneck of prior surrogate approaches. We apply this framework to the hydrogen molecule (H2_22​) with a symmetry-tapered Hamiltonian, conducting a four-stage experimental investigation on IBM Quantum hardware. Stage 1 compares linear and full entangler topologies for the RYR_YRY​-RZR_ZRZ​-CZCZCZ ansatz, with and without XpXm Dynamical Decoupling (DD), across four distributional metrics (Hellinger distance, fidelity error, total variation distance, Jensen-Shannon divergence), identifying the linear entangler as optimal. Stage 2 varies VQC layers (p=1p=1p=1 to 555) for the linear-entangler ansatz, identifying single-layer depth as optimal under hardware noise. Stage 3 applies this configuration to the reduced RYR_YRY​-CZCZCZ ansatz, comparing ideal and noisy simulator-trained parameters. A supplementary noise analysis at p∈{8,64}p \in \{8,64\}p∈{8,64} characterizes the depth-dependent interplay between circuit depth and DD effectiveness. The framework enables faithful QPE mimicry using a linearly scaling VQC, recovering the ground-state energy within the chemical accuracy threshold (1 kcal/mol), constituting a scalable, hardware-efficient paradigm for QPE-based molecular energy estimation on NISQ devices.
Maximizing the computational utility of near-term quantum processors requires predictive noise models that inform robust, noise-aware compilation and error mitigation. Conventional models often fail to capture the complex error dynamics of real hardware or require prohibitive characterization overhead. We introduce a data-efficient framework that first constructs a physically motivated, parameterized noise model, and subsequently employs machine-learning-driven Bayesian optimization to identify its parameters. Our approach circumvents costly characterization protocols by estimating algorithm- and hardware-specific error parameters directly from readily available experimental data derived from existing application and benchmark circuit executions. The generality and robustness of the framework are demonstrated across diverse algorithms and superconducting devices, yielding high-fidelity predictions by estimating an independent parameter set tailored to each specific algorithm-hardware context. Crucially, we show that a model calibrated exclusively on small-scale circuits accurately predicts the behavior of larger validation circuits. Our data-efficient approach achieves up to a 65% improvement in model fidelity quantified by the Hellinger distance between predicted and experimental circuit output distributions, compared to standard noise models derived from device properties. This work establishes a practical paradigm for application-aware noise characterization, enabling compilation and error-mitigation strategies tailored to the specific interplay between quantum algorithms and device-specific noise dynamics.
Calibrating a quantum processor means estimating gate-error parameters from data, and a hard-to-estimate parameter is usually assumed to leave a weak signature more repetitions will resolve. Coherent over-rotations break that premise. For commuting single- and two-qubit transverse over-rotations with known support on a computational-basis input, the passive histogram is exactly invariant under a sign group acting on the coherent angles, of order 2n+12^{n+1}2n+1 for the complete family with n≥2n\ge2n≥2, so no estimator resolves the signs uniformly at any sample size. A calibration correction applied with the wrong sign doubles the rotation error it should remove. At zero angle the obstruction turns continuous, with a Fisher information singular along every coherent direction and an infinite Cramér-Rao bound. At generic angles the continuous defect clears for 5≤n≤85\le n\le85≤n≤8, the range we compute, while the sign degeneracy persists. Covering the support removes both, and a design resolves the signed angles uniformly exactly when it covers. On ∣ηR∣<π/2|η_R|<π/2∣ηR​∣<π/2, 0≤pR<1/20\le p_R<1/20≤pR​<1/2 coverage is constructive, returning each angle in closed form from a ratio of two measured expectations without knowing the rates. A twirl-free code of ⌈log⁡2(n+1)⌉\lceil\log_2(n+1)\rceil⌈log2​(n+1)⌉ added product-Pauli settings covers, and for the complete family none uses fewer. Conditioning then sets the Cramér-Rao cost, and we give its floor explicitly. Exact computation matches the theory, the passive fit stays at chance on the signs at every budget while the closed-form inverse recovers them, and angle magnitudes on two IBM Heron processors follow the conditioning ordering.
On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget BBB must therefore decide how many distinct training states nnn to use and how many shots SSS to allocate to each state. We study this tradeoff for binary quantum classifiers with fixed or independently selected measurement operators MMM, where the ideal score is Tr(Mρ)Tr(M\rho)Tr(Mρ). We prove a distribution-free generalization bound that separates the finite-sample and finite-shot contributions. The sample term scales as d/n\sqrt{d/n}d/n​, while the shot term scales as (log⁡n)/S\sqrt{(\log n)/S}(logn)/S​; under the constraint B=nSB=nSB=nS, these two terms move in opposite directions. Minimising a conservative closed-form surrogate of the bound gives the allocation rule n∗=22dB/log⁡(2B/δ)n^{*} = 2\sqrt{2dB/\log(2B/\delta)}n∗=22dB/log(2B/δ)​ and S∗=B/nstarS^{*} = B/nstarS∗=B/nstar. This surrogate has the same asymptotic scaling as the exact minimizer and yields a worst-case rate of B−1/4B^{-1/4}B−1/4. The guarantee is intentionally conservative, since it applies to the full class of binary quantum measurements. We complement the theory with PennyLane simulations using 2-qubit and 4-qubit variational quantum circuits on nine synthetic binary classification benchmarks. In all tested configurations, the one-sided empirical generalization gap remains below the theoretical bound. The result provides a conservative statistical guideline for allocating measurement budgets in finite-shot evaluation and pre-experimental planning for near-term quantum learning systems, complementing hardware-level scheduling and circuit-design considerations. Extending the guarantee to fully adaptive shot-noisy training remains an open problem.
Symmetry reduces the capacity of a quantum learning model, but the imposed group must match both the measured information and the label transformation. We establish a finite-measurement theory for inferring this group from candidate transformations. The central structural result identifies observable-invisible transformations with the stabilizer of a projected state whenever the probe span is invariant. It turns recovered generators into a valid subgroup and identifies the continuous invisible space with its Lie algebra. For finite dictionaries, an unbiased shadow statistic distinguishes zero from positive squared expectation discrepancies with an inverse-gap measurement rate, improving the inverse-square-gap rate of uniform discrepancy estimation. A commuting qubit lower bound proves the gap dependence optimal at fixed snapshot scale, and simultaneous intervals support data-dependent tolerances. Task validation then tests either the joint distribution through a characteristic kernel or its encoded mean through a classical--quantum discrepancy. An exact group-average identity relates the latter to joint-state asymmetry and specifies its conversion to binary task breaking mass. Projection bias quantifies the cost of excessive symmetry, while an ℓ1\ell_1ℓ1​ readout bound quantifies the capacity gained by relaxing it. At an invariant pure-state backbone, retained and nontrivial breaking sectors are Fisher-orthogonal. Ising-chain calculations connect finite-shot recovery, label-dependent symmetry, and physical sector drift. These results determine which symmetry the measurements support and provide the statistical and geometric basis for a subsequent release decision.