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

Improving Multiparty Quantum Secret Sharing Using Error Mitigation Techniques on NISQ Devices

Korada Sunil Kumar, Dr. O. Srinivas Rao

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Quantum Secret Sharing (QSS) employs the principles of quantum entanglement to securely distribute confidential information among multiple participants, such that the original secret can only be recovered through collaboration among an authorized subset of users. While QSS offers information-theoretic security independent of computational assumptions, its practical deployment on Noisy Intermediate-Scale Quantum (NISQ) hardware remains challenging. The presence of device imperfections, including gate errors, decoherence, and measurement inaccuracies, adversely affects quantum state fidelity and reduces the reliability of secret reconstruction during protocol execution. This paper presents a noise-resilient multiparty QSS framework integrating a (2,3)- threshold Shamir Secret Sharing scheme over Galois Field GF (8) with nine-qubit Greenberger–Horne–Zeilinger (GHZ) entanglement circuits, fully implemented on the IBM ibm_kingston 156-qubit Heron r2 quantum processor. A three-phase experimental methodology is adopted: noiseless simulation via Qiskit Aer, authentic hardware execution with 1024 measurement shots, and a combined Local Readout Error Mitigation (LRE) and Zero Noise Extrapolation (ZNE) pipeline. Across 24 participants in eight secret-sharing sessions, hardware noise introduced a 6.0% accuracy degradation relative to the ideal baseline, which the LRE+ZNE pipeline substantially recovered. The (2,3)-threshold security invariant was preserved throughout all phases, with singleplayer reconstruction rates held at exactly 0.000, well below the 12.5% random-guess baseline. Security is further reinforced through CRYSTALS-Kyber512 (NIST FIPS 203) post-quantum authentication, SHA-256 share commitments, SHA3-256 fairness verification, and bulletin board consensus, with verified resistance against seven attack categories. Results confirm that reliable hardware-validated QSS on current NISQ devices is achievable through systematic multi-technique error mitigation.

DOI
10.5281/zenodo.20719202

Related papers

Security and Fairness in Multiparty Quantum Secret Sharing Protocol

Alessio Di Santo, Walter Tiberti, Dajana Cassioli

Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all the$n$players calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset of$t$players, out of the entire set on$n$players, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.

arXiv:2412.11667•IEEE Transactions on Quantum Engineering•Jan 1, 2025•10 citations

Error Mitigation in the NISQ Era: Applying Measurement Error Mitigation Techniques to Enhance Quantum Circuit Performance

Misha Urooj Khan, Muhammad Ahmad Kamran, Wajiha Rahim Khan +3 more

In quantum computing, noisy intermediate-scale quantum (NISQ) devices offer unprecedented computational capabilities but are vulnerable to errors, notably measurement inaccuracies that impact computation accuracy. This study explores the efficacy of error mitigation techniques in improving quantum circuit performance on NISQ devices. Techniques such as dynamic decoupling (DD), twirled readout error extraction (T-REx) and zero-noise extrapolation (ZNE) are examined through extensive experimentation on an ideal simulator, IBM Kyoto, and IBM Osaka quantum computers. Results reveal significant performance discrepancies across scenarios, with error mitigation techniques notably enhancing both estimator result and variance values, aligning more closely with ideal simulator outcomes. The comparison results with ideal simulator (having expected result value 0.8284) shows that T-Rex has improved results on IBM Kyoto and enhanced average expected result value from 0.09 to 0.35. Similarly, DD has improved average expected result values from 0.2492 to 0.3788 on IBM Osaka. These findings underscore the critical role of error mitigation in bolstering quantum computation reliability. The results suggest that selection of mitigation technique depends upon quantum circuit and its depth, type of hardware and operations to be performed.

Mathematics•Jul 17, 2024•22 citations

A Novel Approach for Mitigating Gate- Level Noise in IBM Quantum Hardware via Zero Noise Extrapolation (ZNE) and Probabilistic Error Cancellation (PEC) Techniques

Mohammed Suhaib, V. Karthick, D. Maria Monica

Abstract The practical application of Noisy Intermediate-Scale Quantum (NISQ) hardware is fundamentally limited by gate-level noise, which corrupts computational results. This research addresses this challenge through the development and validation of a modular software framework for Quantum Error Mitigation (QEM). We implement and compare two leading QEM strategies: Zero-Noise Extrapolation (ZNE) and Probabilistic Error Cancellation (PEC). The framework is built using the Qiskit library and is validated using a realistic, hardware-calibrated noisy simulator that mimics the error characteristics of a real IBM Quantum device. Our methodology focuses on a robust implementation of ZNE via unitary folding and a proof-of-concept demonstration of the PEC algorithm. The framework's effectiveness is demonstrated on a simulated noisy backend where, for a 3-qubit Greenberger-Horne-Zeilinger (GHZ) state, the baseline state fidelity was increased from 93.5% to 97.3% via ZNE, corresponding to a 59% reduction in the state's infidelity. This work provides a practical demonstration of how software-based error mitigation can enhance the reliability of quantum computations on current noisy hardware.

•Dec 8, 2025•2 citations

Comparing Zero-Noise Extrapolation Models on a 6-Qubit Grover's Algorithm

Prajwal Avadhani

Quantum computers have the potential to address computational problems beyond the practical capabilities of classical systems, but Noisy Intermediate-Scale Quantum (NISQ) processors remain limited by errors that accumulate during circuit execution. Quantum Error Mitigation (QEM), particularly Zero-Noise Extrapolation (ZNE), offers a way to reduce these errors without requiring additional physical qubits. However, ZNE has been studied extensively in relatively small or shallow circuits, leaving its effectiveness in deep, non-variational algorithms less explored. This project investigates whether combining readout mitigation and ZNE can mitigate errors in a deep, six-qubit Grover's search algorithm. The circuit was compiled onto IBM's 133-qubit FakeTorino simulated backend, reaching a depth of 1,118 and containing 369 entangling gates. Under simulated noise, the unmitigated probability of measuring the target state was 3.36%, compared with a uniform random-guessing probability of 1.5625%. Digital unitary gate folding and readout error mitigation were subsequently applied across four progressively increased noise-scaling sets (S1–S4), and scale factors. Four extrapolation models (Linear, Quadratic, Poly-Exponential, and Padé) were evaluated. The Poly-Exponential model achieved the highest average target-state probability, reaching 6.91% at S4, approximately 2.06 times the unmitigated probability. These results demonstrate that combining readout mitigation with ZNE can partially recover computational signals in deep quantum circuits under simulated hardware noise, suggesting the potential combined error mitigation techniques for improving the reliability of near-term quantum algorithms without active quantum error correction.

•Nov 13, 2026•0 citations

Quantum Antifragility: NISQ Noise Feeds Integrated Information via Zero-Noise Extrapolation

Cruz Sanchez

We present the first experimental demonstration that quantum noise is informative, not merely destructive — validating Theorem 8 of IIT 5.1 (FEP-MaxCal Bridge). Using a 5-qubit GHZ circuit on an AerSimulator calibrated with real IBM Quantum ibm_fez noise parameters (T1=320µs, T2=150µs, gate2q error=2.83e-3), we show that Zero Noise Extrapolation (ZNE) recovers integrated information (Φ) to a value exceeding the noiseless ideal: Φ_ZNE = 1.1736 > Φ_ideal = 0.9999 (permutation test, p < 0.000001, N=20 runs, 8192 shots each, 10000 bootstrap resamples). ZNE requires controlled noise scaling (identity folding at λ = 1, 2, 3) that is only feasible in simulation; however, the noise model is calibrated from 3766 real IBM Quantum jobs across 6 backends, and prior hardware experiments on ibm_fez (V1: Φ=0.757, V2: Φ=0.832 with ZNE on real hardware) validate the baseline metrics. The experiment follows a four-phase paradigm: (1) Baseline: GHZ-5 ideal yields Φ=0.9999; (2) Attack: NISQ noise degrades Φ to 0.8804 (-12%); (3) Recovery: Hahn Echo alone shows no significant improvement (p=0.853), but ZNE with 3-scale identity folding and linear extrapolation to noise=0 yields Φ=1.1736; (4) Antifragility: the recovered system exceeds the original baseline by +17.4%. Additional findings: Φ scales monotonically with qubit count (2q→7q), distinguishes entanglement topology (GHZ > W-state > Cluster ≈ Separable), is robust across 4 IBM backend noise models (CV=3.35%), and decays exponentially with circuit depth (τ=29.52 layers). Hardware validation on real ibm_fez confirms Φ for entangled vs separable circuits with Cohen's d = 191.3 (p < 0.0001).

•Aug 8, 2026•0 citations

Error Mitigation–Driven Enhancement of QAOA Performance on NISQ Devices

Kondreddy Sathwika, Maka Sri Varshith, Marati Nanda Kumar +1 more

The Quantum Approximate Optimization Algorithm (QAOA) is widely regarded as a promising near-term quantum algorithm for addressing hard combinatorial optimization problems on Noisy Intermediate-Scale Quantum (NISQ) devices; however, its real-world effectiveness is severely constrained by hardware noise, including gate infidelities, decoherence, and measurement errors. This work explores an error mitigation–driven approach to enhance the performance and robustness of QAOA without altering its algorithmic structure or requiring fault-tolerant quantum resources. Measurement error mitigation and zero-noise extrapolation are incorporated into the execution and post-processing stages of QAOA circuits and evaluated using the Minimum Vertex Cover problem as a representative benchmark. Performance is assessed through approximation ratios, solution stability, and noise sensitivity across multiple circuit depths. The results indicate that error mitigation not only improves approximation accuracy but also stabilizes output distributions and delays performance degradation at increased circuit depths. Additionally, the mitigated executions demonstrate better consistency across repeated runs, highlighting improved resilience to stochastic noise. These findings emphasize that lightweight and hardware-efficient error mitigation techniques can significantly extend the practical usability of QAOA on current NISQ hardware, providing a scalable and realistic pathway for executing quantum optimization algorithms more reliably in near-term quantum computing environments.

International Conference on AI-Driven Smart Systems and Ubiquitous Computing (ICAUC)•Jan 19, 2026•0 citations
Quantum Secret Sharing (QSS) employs the principles of quantum entanglement to securely distribute confidential information among multiple participants, such that the original secret can only be recovered through collaboration among an authorized subset of users. While QSS offers information-theoretic security independent of computational assumptions, its practical deployment on Noisy Intermediate-Scale Quantum (NISQ) hardware remains challenging. The presence of device imperfections, including gate errors, decoherence, and measurement inaccuracies, adversely affects quantum state fidelity and reduces the reliability of secret reconstruction during protocol execution. This paper presents a noise-resilient multiparty QSS framework integrating a (2,3)- threshold Shamir Secret Sharing scheme over Galois Field GF (8) with nine-qubit Greenberger–Horne–Zeilinger (GHZ) entanglement circuits, fully implemented on the IBM ibm_kingston 156-qubit Heron r2 quantum processor. A three-phase experimental methodology is adopted: noiseless simulation via Qiskit Aer, authentic hardware execution with 1024 measurement shots, and a combined Local Readout Error Mitigation (LRE) and Zero Noise Extrapolation (ZNE) pipeline. Across 24 participants in eight secret-sharing sessions, hardware noise introduced a 6.0% accuracy degradation relative to the ideal baseline, which the LRE+ZNE pipeline substantially recovered. The (2,3)-threshold security invariant was preserved throughout all phases, with singleplayer reconstruction rates held at exactly 0.000, well below the 12.5% random-guess baseline. Security is further reinforced through CRYSTALS-Kyber512 (NIST FIPS 203) post-quantum authentication, SHA-256 share commitments, SHA3-256 fairness verification, and bulletin board consensus, with verified resistance against seven attack categories. Results confirm that reliable hardware-validated QSS on current NISQ devices is achievable through systematic multi-technique error mitigation.
Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all thennnplayers calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset oftttplayers, out of the entire set onnnnplayers, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.
In quantum computing, noisy intermediate-scale quantum (NISQ) devices offer unprecedented computational capabilities but are vulnerable to errors, notably measurement inaccuracies that impact computation accuracy. This study explores the efficacy of error mitigation techniques in improving quantum circuit performance on NISQ devices. Techniques such as dynamic decoupling (DD), twirled readout error extraction (T-REx) and zero-noise extrapolation (ZNE) are examined through extensive experimentation on an ideal simulator, IBM Kyoto, and IBM Osaka quantum computers. Results reveal significant performance discrepancies across scenarios, with error mitigation techniques notably enhancing both estimator result and variance values, aligning more closely with ideal simulator outcomes. The comparison results with ideal simulator (having expected result value 0.8284) shows that T-Rex has improved results on IBM Kyoto and enhanced average expected result value from 0.09 to 0.35. Similarly, DD has improved average expected result values from 0.2492 to 0.3788 on IBM Osaka. These findings underscore the critical role of error mitigation in bolstering quantum computation reliability. The results suggest that selection of mitigation technique depends upon quantum circuit and its depth, type of hardware and operations to be performed.
Abstract The practical application of Noisy Intermediate-Scale Quantum (NISQ) hardware is fundamentally limited by gate-level noise, which corrupts computational results. This research addresses this challenge through the development and validation of a modular software framework for Quantum Error Mitigation (QEM). We implement and compare two leading QEM strategies: Zero-Noise Extrapolation (ZNE) and Probabilistic Error Cancellation (PEC). The framework is built using the Qiskit library and is validated using a realistic, hardware-calibrated noisy simulator that mimics the error characteristics of a real IBM Quantum device. Our methodology focuses on a robust implementation of ZNE via unitary folding and a proof-of-concept demonstration of the PEC algorithm. The framework's effectiveness is demonstrated on a simulated noisy backend where, for a 3-qubit Greenberger-Horne-Zeilinger (GHZ) state, the baseline state fidelity was increased from 93.5% to 97.3% via ZNE, corresponding to a 59% reduction in the state's infidelity. This work provides a practical demonstration of how software-based error mitigation can enhance the reliability of quantum computations on current noisy hardware.
Quantum computers have the potential to address computational problems beyond the practical capabilities of classical systems, but Noisy Intermediate-Scale Quantum (NISQ) processors remain limited by errors that accumulate during circuit execution. Quantum Error Mitigation (QEM), particularly Zero-Noise Extrapolation (ZNE), offers a way to reduce these errors without requiring additional physical qubits. However, ZNE has been studied extensively in relatively small or shallow circuits, leaving its effectiveness in deep, non-variational algorithms less explored. This project investigates whether combining readout mitigation and ZNE can mitigate errors in a deep, six-qubit Grover's search algorithm. The circuit was compiled onto IBM's 133-qubit FakeTorino simulated backend, reaching a depth of 1,118 and containing 369 entangling gates. Under simulated noise, the unmitigated probability of measuring the target state was 3.36%, compared with a uniform random-guessing probability of 1.5625%. Digital unitary gate folding and readout error mitigation were subsequently applied across four progressively increased noise-scaling sets (S1–S4), and scale factors. Four extrapolation models (Linear, Quadratic, Poly-Exponential, and Padé) were evaluated. The Poly-Exponential model achieved the highest average target-state probability, reaching 6.91% at S4, approximately 2.06 times the unmitigated probability. These results demonstrate that combining readout mitigation with ZNE can partially recover computational signals in deep quantum circuits under simulated hardware noise, suggesting the potential combined error mitigation techniques for improving the reliability of near-term quantum algorithms without active quantum error correction.
We present the first experimental demonstration that quantum noise is informative, not merely destructive — validating Theorem 8 of IIT 5.1 (FEP-MaxCal Bridge). Using a 5-qubit GHZ circuit on an AerSimulator calibrated with real IBM Quantum ibm_fez noise parameters (T1=320µs, T2=150µs, gate2q error=2.83e-3), we show that Zero Noise Extrapolation (ZNE) recovers integrated information (Φ) to a value exceeding the noiseless ideal: Φ_ZNE = 1.1736 > Φ_ideal = 0.9999 (permutation test, p < 0.000001, N=20 runs, 8192 shots each, 10000 bootstrap resamples). ZNE requires controlled noise scaling (identity folding at λ = 1, 2, 3) that is only feasible in simulation; however, the noise model is calibrated from 3766 real IBM Quantum jobs across 6 backends, and prior hardware experiments on ibm_fez (V1: Φ=0.757, V2: Φ=0.832 with ZNE on real hardware) validate the baseline metrics. The experiment follows a four-phase paradigm: (1) Baseline: GHZ-5 ideal yields Φ=0.9999; (2) Attack: NISQ noise degrades Φ to 0.8804 (-12%); (3) Recovery: Hahn Echo alone shows no significant improvement (p=0.853), but ZNE with 3-scale identity folding and linear extrapolation to noise=0 yields Φ=1.1736; (4) Antifragility: the recovered system exceeds the original baseline by +17.4%. Additional findings: Φ scales monotonically with qubit count (2q→7q), distinguishes entanglement topology (GHZ > W-state > Cluster ≈ Separable), is robust across 4 IBM backend noise models (CV=3.35%), and decays exponentially with circuit depth (τ=29.52 layers). Hardware validation on real ibm_fez confirms Φ for entangled vs separable circuits with Cohen's d = 191.3 (p < 0.0001).
The Quantum Approximate Optimization Algorithm (QAOA) is widely regarded as a promising near-term quantum algorithm for addressing hard combinatorial optimization problems on Noisy Intermediate-Scale Quantum (NISQ) devices; however, its real-world effectiveness is severely constrained by hardware noise, including gate infidelities, decoherence, and measurement errors. This work explores an error mitigation–driven approach to enhance the performance and robustness of QAOA without altering its algorithmic structure or requiring fault-tolerant quantum resources. Measurement error mitigation and zero-noise extrapolation are incorporated into the execution and post-processing stages of QAOA circuits and evaluated using the Minimum Vertex Cover problem as a representative benchmark. Performance is assessed through approximation ratios, solution stability, and noise sensitivity across multiple circuit depths. The results indicate that error mitigation not only improves approximation accuracy but also stabilizes output distributions and delays performance degradation at increased circuit depths. Additionally, the mitigated executions demonstrate better consistency across repeated runs, highlighting improved resilience to stochastic noise. These findings emphasize that lightweight and hardware-efficient error mitigation techniques can significantly extend the practical usability of QAOA on current NISQ hardware, providing a scalable and realistic pathway for executing quantum optimization algorithms more reliably in near-term quantum computing environments.