Abstract Finite-shot entanglement detection requires measurement resources to be distributed across observable settings while balancing detection power, estimation error, and false-positive control. This study presents a comparative computational evaluation of three measurement-allocation strategies: fixed allocation, variance-adaptive allocation, and a fuzzy-adaptive strategy that combines weighted fuzzy membership scores with variance-based allocation. The methods are evaluated for a two-qubit Werner-type state family using a total budget of 3,000 measurement shots across four simulated detector conditions: ideal operation, fixed offset, uncertain calibration, and drift. The fuzzy strategy is selected from a prespecified family of 81 configurations using development-set detection power and evaluated on separate validation and test samples. The results indicate that the relative performance of the allocation strategies depends on detector conditions and evaluation criteria. Detection power is high under ideal and fixed-offset conditions for all three methods, while uncertain calibration and drift are associated with reduced performance. Fuzzy adaptation achieves the highest observed detection power under uncertain calibration (98.59%) and drift (96.39%), but does not consistently minimize estimation error. Independent boundary-state validation also reveals imperfect false-positive-rate control: the fuzzy strategy exhibits a false-positive rate of 9.0% under uncertain calibration, exceeding the nominal 5% target. These findings demonstrate that apparent gains in detection power must be interpreted alongside false-positive behaviour and estimation accuracy. Because the analysis is computational and the configurations are selected using development-set performance, the results do not establish universal superiority or statistical significance of fuzzy adaptation. Instead, the study provides a condition-dependent benchmark of fuzzy-assisted measurement allocation and identifies calibration robustness and threshold control as important directions for further investigation.
Abstract Finite-shot entanglement detection requires measurement resources to be distributed across observable settings while balancing detection power, estimation error, and false-positive control. This study presents a comparative computational evaluation of three measurement-allocation strategies: fixed allocation, variance-adaptive allocation, and a fuzzy-adaptive strategy that combines weighted fuzzy membership scores with variance-based allocation. The methods are evaluated for a two-qubit Werner-type state family using a total budget of 3,000 measurement shots across four simulated detector conditions: ideal operation, fixed offset, uncertain calibration, and drift. The fuzzy strategy is selected from a prespecified family of 81 configurations using development-set detection power and evaluated on separate validation and test samples. The results indicate that the relative performance of the allocation strategies depends on detector conditions and evaluation criteria. Detection power is high under ideal and fixed-offset conditions for all three methods, while uncertain calibration and drift are associated with reduced performance. Fuzzy adaptation achieves the highest observed detection power under uncertain calibration (98.59%) and drift (96.39%), but does not consistently minimize estimation error. Independent boundary-state validation also reveals imperfect false-positive-rate control: the fuzzy strategy exhibits a false-positive rate of 9.0% under uncertain calibration, exceeding the nominal 5% target. These findings demonstrate that apparent gains in detection power must be interpreted alongside false-positive behaviour and estimation accuracy. Because the analysis is computational and the configurations are selected using development-set performance, the results do not establish universal superiority or statistical significance of fuzzy adaptation. Instead, the study provides a condition-dependent benchmark of fuzzy-assisted measurement allocation and identifies calibration robustness and threshold control as important directions for further investigation.
Hybrid quantum–classical models deployed in open-world settings require reliable out-of-distribution detection under finite-shot measurement noise, where identical inputs can induce materially different logits across repeated circuit executions. This study evaluates three scoring rules, namely softmax confidence, energy scoring, and uncertainty-aware energy scoring, using a consistent validation-threshold protocol and multi-source OOD testing. Across three OOD shift families, uncertainty-aware energy achieved source-wise AUROC values of 0.953 (semantic shift), 0.942 (corruption shift), and 0.936 (background shift), compared with 0.941, 0.923, and 0.916 for energy-only scoring, and 0.902, 0.884, and 0.864 for softmax confidence. Aggregated over sources, uncertainty-aware energy reached AUROC 0.944 and AUPR 0.931, reducing FPR95 to 0.152, while energy-only produced AUROC 0.927, AUPR 0.914, and FPR95 0.193, and softmax yielded AUROC 0.883, AUPR 0.861, and FPR95 0.279. In-distribution classification remained stable with accuracy 0.898–0.902 across scoring variants, indicating that detection gains were not driven by degraded classification performance. Measurement-budget analysis shows that uncertainty-aware scoring substantially improves low-shot reliability. At 64 shots per observable, energy-only achieved AUROC 0.894 with FPR95 0.251, whereas uncertainty-aware energy reached AUROC 0.929 with FPR95 0.171, while the energy-score dispersion decreased monotonically from 0.42 at 64 shots to 0.17 at 1024 shots. As shot budgets increased, energy-only performance improved, but uncertainty-aware energy retained a consistent advantage, indicating that variance penalization improves score ordering, not only score variance. Architecture ablations further identify a practical expressivity–stability tradeoff: an intermediate-scale circuit (8 qubits, depth 6, brickwork entanglement) attained AUROC 0.949 with FPR95 0.149 and in-distribution accuracy 0.903, whereas further scaling (10 qubits, depth 6) produced AUROC 0.946 with higher FPR95 0.154 and increased score dispersion. Calibration behavior improved concurrently, with ECE reduced from 0.061 (softmax) to 0.044 (energy) and 0.036 (uncertainty-aware energy), supporting more stable operating points under threshold transfer. These findings demonstrate that integrating measurement uncertainty into energy-based scoring provides a robust control mechanism for hybrid quantum OOD detection, particularly under constrained shot budgets and measurement noise.
We investigate the effects of fuzzy measurements on spin entanglement for identical particles, both fermions and bosons. We first consider an ideal measurement apparatus and define operators that detect the symmetry of the spatial and spin part of the density matrix as a function of particle distance. Then, moving on to realistic devices that can only detect the position of the particle to within a certain spread, it was surprisingly found that the entanglement between particles increases with the broadening of detection.
We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.
Quantum entanglement, a bizarre phenomenon where two or more particles become linked in such a way that they share the same fate, holds immense potential for technological advancement. This paper investigates the application of quantum entanglement to the design of an adaptive measurement algorithm, aiming to enhance measurement precision and efficiency. Traditional measurement techniques often rely on fixed parameters, limiting their ability to optimize performance. We propose a novel approach leveraging the dynamic interplay between entangled states and adjustable parameters to achieve this. The core mechanism centers around exploiting the inherent correlations within entangled systems to dynamically adjust measurement settings, resulting in improved accuracy and reduced computational burden. This research explores the theoretical and practical aspects of this algorithm, emphasizing its potential impact on various measurement scenarios.
Quantum entanglement, a cornerstone of quantum mechanics, offers unprecedented computational capabilities. However, its delicate nature makes it susceptible to decoherence, leading to errors in computations. This paper investigates a novel approach to mitigate these vulnerabilities through the implementation of adaptive noise injection within a quantum computation framework. We propose a system where the rate and type of noise injected are dynamically adjusted based on the state of the entangled qubits, effectively enhancing the stability and accuracy of the resulting quantum state. The core mechanism centers around leveraging the inherent fragility of entanglement to guide its evolution. This research explores the potential of this self-adaptive strategy to significantly improve the performance of quantum computations.
Abstract Near-term demonstrations of HHL-type quantum linear-system solvers require implementations that make spectral assumptions, post-selection costs, and hardware-induced errors explicit. This is particularly important for small hardware experiments, where finite-shot sampling, phase-estimation resolution, and multi-controlled-gate overhead can dominate the observed performance. A hardware-executable HHL benchmark pipeline for Hermitian linear systems is presented and evaluated on small positive-definite and indefinite benchmark instances. By fixing the complete end-to-end workflow, including sign-aware handling of indefinite spectra and post-selected diagnostic readout, the pipeline provides a reproducible basis for comparing ideal simulation, backend-calibrated noisy simulation, and selected IBM Quantum hardware executions. The benchmark instances are organized into amplitude-resolvability classes, indexed by a threshold factor τ, enabling finite-shot sampling effects to be compared across increasingly well-resolved instance families. Experiments on 8×8 positive-definite and indefinite nonsingular systems show close agreement across ideal simulator backends. Within the constructed benchmark family, more restrictive resolvability classes yield lower reference-sign-assisted diagnostic vector errors. Indefinite instances are more noise-sensitive because sign-aware handling introduces additional controlled phase operations and reduces the effective phase resolution available within each sign sector. Selected IBM Quantum hardware runs show end-to-end executability and broad consistency with backend-calibrated noisy simulation in the reference-sign-assisted diagnostic vector error. However, for these selected runs, the noisy simulator systematically overestimates the number of shots that survive ancilla post-selection, revealing a limitation of calibrated noise models for predicting the usable sampling budget of deep HHL circuits. Overall, the results provide a reproducible baseline for evaluating resource--accuracy trade-offs in near-term HHL-type routines. They also support the view that such routines are most naturally used as subroutines for estimating task-relevant quantities from ∣x⟩, rather than as standalone tools for full vector reconstruction.