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

Quantum 2.0 Conference and Exhibition

Confidence-Interval Construction with Non-I.I.D. Spot-Checking Trials & its Application in Quantum Information

Yanbao Zhang, Akshay Seshadri, Emanuel H. Knill

Published Jan 1, 2023• 1 citation
Publisher

Abstract

We develop a method to estimate the sum of conditional means of a sequence of random variables given our access to only a subsequence by spot-checking. The method works with non-independent-and-identically-distributed (non-i.i.d.) random variables and can be applied for certifying ongoing quantum information tasks.
DOI
10.1364/quantum.2023.qtu3a.20

Related papers

An efficient method for spot-checking quantum properties with sequential trials

Yanbao Zhang, Akshay Seshadri, Emanuel Knill

In practical situations, the reliability of quantum resources can be compromised due to complex generation processes or adversarial manipulations during transmission. Consequently, the trials generated sequentially in an experiment may exhibit non-independent and non-identically distributed (non-i.i.d.) behavior. This non-i.i.d. behavior can introduce security concerns and result in faulty estimates when performing information tasks such as quantum key distribution, self-testing, verifiable quantum computation, and resource allocation in quantum networks. To certify the performance of such tasks, one can make a random decision in each trial, either spot-checking some desired property or utilizing the quantum resource for the given task. However, a general method for certification with a sequence of non-i.i.d. spot-checking trials is still missing. Here, we develop such a method. This method not only works efficiently with a finite number of trials but also yields asymptotically tight certificates of performance. Our analysis shows that even as the total number of trials approaches infinity, only a constant number of trials needs to be spot-checked on average to certify the average performance of the remaining trials at a specified confidence level.

quant-pharXiv:2602.08114•Feb 10, 2026•1 citation

Certifying quantum states without independence assumptions

Mariana Navarro, Leonardo Zambrano

Standard quantum verification and certification protocols often assume that experimental sources emit independent and identically distributed (i.i.d.) states. In realistic scenarios, however, temporal drift, memory effects, feedback, and correlated noise can violate this assumption, causing standard analyses to underestimate uncertainty and overestimate device performance. Here, we introduce a general framework for quantum verification and certification in which the state produced in each round may depend arbitrarily on the preceding experimental history. Our method provides rigorous confidence intervals for observable expectation values averaged over the experimental trajectory. The framework covers both full verification, in which every state is measured, and spot-checking certification, in which a randomly selected subset is tested to certify the average observable value of the complementary, remaining systems. We apply the framework to importance-sampled Pauli measurements for direct fidelity estimation, energy estimation, and entanglement witnessing, and to classical shadows, allowing multiple observables to be certified simultaneously from the same test data. We illustrate the framework numerically and demonstrate it experimentally through Bell-state certification on a quantum processor.

quant-pharXiv:2606.31913•Jul 1, 2026•0 citations

Generation of quantum randomness by probability estimation with classical side information

Emanuel H. Knill, Yanbao Zhang, Peter Bierhorst

The authors use probability estimation in the general situation where the randomness can be extracted from a sequence of private data determined in an arbitrary way by the settings-dependent measurement outcomes of each trial.

arXiv:1709.06159•Physical Review Research•Sep 22, 2020•27 citations

Information-Theoretic Analyses of Two-Level Quantum Systems

Paul B. Slater

This paper has been superseded by quant-ph/0006009, "Quantum State Estimation Using Non-separable Measurements".

arXiv:quant-ph/0002063•Feb 23, 2000•0 citations

Quantum Probability Estimation for Randomness with Quantum Side Information

Emanuel H. Knill, Yanbao Zhang, Honghao Fu

We develop a quantum version of the probability estimation framework [arXiv:1709.06159] for randomness generation with quantum side information. We show that most of the properties of probability estimation hold for quantum probability estimation (QPE). This includes asymptotic optimality at constant error and randomness expansion with logarithmic input entropy. QPE is implemented by constructing model-dependent quantum estimation factors (QEFs), which yield statistical confidence upper bounds on data-conditional normalized Rényi powers. This leads to conditional min-entropy estimates for randomness generation. The bounds are valid for relevant models of sequences of experimental trials without requiring independent and identical or stationary behavior. QEFs may be adapted to changing conditions during the sequence and trials can be stopped any time, such as when the results so far are satisfactory. QEFs can be constructed from entropy estimators to improve the bounds for conditional min-entropy of classical-quantum states from the entropy accumulation framework [Dupuis, Fawzi and Renner, arXiv:1607.01796]. QEFs are applicable to a larger class of models, including models permitting experimental devices with super-quantum but non-signaling behaviors and semi-device dependent models. The improved bounds are relevant for finite data or error bounds of the form $e^{-κs}$, where $s$ is the number of random bits produced. We give a general construction of entropy estimators based on maximum probability estimators, which exist for many configurations. For the class of $(k,2,2)$ Bell-test configurations we provide schemas for directly optimizing QEFs to overcome the limitations of entropy-estimator-based constructions. We obtain and apply QEFs for examples involving the $(2,2,2)$ Bell-test configuration to demonstrate substantial improvements in finite-data efficiency.

arXiv:1806.04553•Jun 12, 2018•26 citations

A method for efficiently estimating non-Gaussianity of continuous-variable quantum states

Shao-Hua Xiang, Yu-Jing Zhao, Xiang Cheng +2 more

The European Physical Journal D•Jan 1, 2020•3 citations
In practical situations, the reliability of quantum resources can be compromised due to complex generation processes or adversarial manipulations during transmission. Consequently, the trials generated sequentially in an experiment may exhibit non-independent and non-identically distributed (non-i.i.d.) behavior. This non-i.i.d. behavior can introduce security concerns and result in faulty estimates when performing information tasks such as quantum key distribution, self-testing, verifiable quantum computation, and resource allocation in quantum networks. To certify the performance of such tasks, one can make a random decision in each trial, either spot-checking some desired property or utilizing the quantum resource for the given task. However, a general method for certification with a sequence of non-i.i.d. spot-checking trials is still missing. Here, we develop such a method. This method not only works efficiently with a finite number of trials but also yields asymptotically tight certificates of performance. Our analysis shows that even as the total number of trials approaches infinity, only a constant number of trials needs to be spot-checked on average to certify the average performance of the remaining trials at a specified confidence level.
Standard quantum verification and certification protocols often assume that experimental sources emit independent and identically distributed (i.i.d.) states. In realistic scenarios, however, temporal drift, memory effects, feedback, and correlated noise can violate this assumption, causing standard analyses to underestimate uncertainty and overestimate device performance. Here, we introduce a general framework for quantum verification and certification in which the state produced in each round may depend arbitrarily on the preceding experimental history. Our method provides rigorous confidence intervals for observable expectation values averaged over the experimental trajectory. The framework covers both full verification, in which every state is measured, and spot-checking certification, in which a randomly selected subset is tested to certify the average observable value of the complementary, remaining systems. We apply the framework to importance-sampled Pauli measurements for direct fidelity estimation, energy estimation, and entanglement witnessing, and to classical shadows, allowing multiple observables to be certified simultaneously from the same test data. We illustrate the framework numerically and demonstrate it experimentally through Bell-state certification on a quantum processor.
We develop a quantum version of the probability estimation framework [arXiv:1709.06159] for randomness generation with quantum side information. We show that most of the properties of probability estimation hold for quantum probability estimation (QPE). This includes asymptotic optimality at constant error and randomness expansion with logarithmic input entropy. QPE is implemented by constructing model-dependent quantum estimation factors (QEFs), which yield statistical confidence upper bounds on data-conditional normalized Rényi powers. This leads to conditional min-entropy estimates for randomness generation. The bounds are valid for relevant models of sequences of experimental trials without requiring independent and identical or stationary behavior. QEFs may be adapted to changing conditions during the sequence and trials can be stopped any time, such as when the results so far are satisfactory. QEFs can be constructed from entropy estimators to improve the bounds for conditional min-entropy of classical-quantum states from the entropy accumulation framework [Dupuis, Fawzi and Renner, arXiv:1607.01796]. QEFs are applicable to a larger class of models, including models permitting experimental devices with super-quantum but non-signaling behaviors and semi-device dependent models. The improved bounds are relevant for finite data or error bounds of the form e−κse^{-κs}e−κs, where sss is the number of random bits produced. We give a general construction of entropy estimators based on maximum probability estimators, which exist for many configurations. For the class of (k,2,2)(k,2,2)(k,2,2) Bell-test configurations we provide schemas for directly optimizing QEFs to overcome the limitations of entropy-estimator-based constructions. We obtain and apply QEFs for examples involving the (2,2,2)(2,2,2)(2,2,2) Bell-test configuration to demonstrate substantial improvements in finite-data efficiency.