Correcting for finite statistics effects in a quantum steering experiment
- URL: http://arxiv.org/abs/2305.14116v2
- Date: Fri, 13 Jun 2025 12:09:16 GMT
- Title: Correcting for finite statistics effects in a quantum steering experiment
- Authors: Sophie Engineer, Ana C. S. Costa, Alexandre C. Orthey Jr., Xiaogang Qiang, Jianwei Wang, Jeremy L. O'Brien, Jonathan C. F. Matthews, Will McCutcheon, Roope Uola, Sabine Wollmann,
- Abstract summary: We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
- Score: 33.013102271622614
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Verifying entanglement between parties is essential for creating secure quantum communication. However, finite statistics can lead to false positive outcomes in any tests for entanglement. Here, we introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions, caused by statistical fluctuations and experimental imperfections. We use semidefinite programming to identify the optimal inequality, for our experimental probability distribution, without resource-intensive tomography. Our protocol is numerically and experimentally analysed in the context of random, misaligned measurements, correcting apparent signaling where necessary. Our results show a significantly higher probability of violation than existing state-of-the-art inequalities. This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
Related papers
- A Sample Efficient Conditional Independence Test in the Presence of Discretization [54.047334792855345]
Conditional Independence (CI) tests directly to discretized data can lead to incorrect conclusions.<n>Recent advancements have sought to infer the correct CI relationship between the latent variables through binarizing observed data.<n>Motivated by this, this paper introduces a sample-efficient CI test that does not rely on the binarization process.
arXiv Detail & Related papers (2025-06-10T12:41:26Z) - Mitigation of correlated readout errors without randomized measurements [0.0]
We present a readout error mitigation protocol that uses only single-qubit Pauli measurements.<n>The proposed approach captures a very broad class of correlated noise models.<n>It is based on a complete and efficient characterization of few-qubit correlated positive operator-valued measures.
arXiv Detail & Related papers (2025-03-31T16:21:45Z) - Quantum simulations of macrorealism violation via the QNDM protocol [0.0]
We compare the non-demolition approach with the Leggett-Garg inequalities.
We find that the non-demolition approach is incredibly robust and its efficiency remains unchanged by the noise.
These results make the non-demolition approach a viable alternative to identify the violation of macrorealism.
arXiv Detail & Related papers (2025-02-24T10:47:52Z) - Leveraging junk information to enhance the quantum error mitigation [8.049186254119121]
We introduce a quantum error mitigation method named Self-Trained Quantum Noise Filter (SQNF)
Our numerical results demonstrate that the proposed method can significantly reduce the infidelity of population distributions.
arXiv Detail & Related papers (2024-02-16T07:01:18Z) - Efficient Conformal Prediction under Data Heterogeneity [79.35418041861327]
Conformal Prediction (CP) stands out as a robust framework for uncertainty quantification.
Existing approaches for tackling non-exchangeability lead to methods that are not computable beyond the simplest examples.
This work introduces a new efficient approach to CP that produces provably valid confidence sets for fairly general non-exchangeable data distributions.
arXiv Detail & Related papers (2023-12-25T20:02:51Z) - Noise robustness of a multiparty quantum summation protocol [0.0]
Near-term quantum networks are noisy, and hence correctness and security of protocols are not guaranteed.
We study the impact of both depolarising and dephasing noise on a multiparty summation protocol with imperfect shared entangled states.
We conclude by eliminating the need for a trusted third party in the protocol using Shamir's secret sharing.
arXiv Detail & Related papers (2023-11-26T14:29:49Z) - Geometry of sequential quantum correlations and robust randomness
certification [0.0]
We study the geometry of quantum correlations and their implications for robust device-independent randomness generation.
We identify a boundary for the set of these correlations expressed as a trade-off between the amount of nonlocality between different observers.
We propose a practical protocol based on non-projective measurements that can produce the boundary correlations under ideal conditions.
arXiv Detail & Related papers (2023-09-21T17:50:29Z) - Monte Carlo approach to the evaluation of the security of
device-independent quantum key distribution [0.16317061277456998]
We present a generic study on the information-theoretic security of multi-setting device-independent quantum key distribution protocols.
The approach we develop yields nontrivial upper bounds on the secure key rates, along with the detection efficiencies required upon the measuring devices.
arXiv Detail & Related papers (2023-08-06T06:07:06Z) - Entropy Accumulation under Post-Quantum Cryptographic Assumptions [4.416484585765028]
In device-independent (DI) quantum protocols, the security statements are oblivious to the characterization of the quantum apparatus.
We present a flexible framework for proving the security of such protocols by utilizing a combination of tools from quantum information theory.
arXiv Detail & Related papers (2023-07-02T12:52:54Z) - Robust and efficient verification of graph states in blind
measurement-based quantum computation [52.70359447203418]
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients.
It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario.
Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
arXiv Detail & Related papers (2023-05-18T06:24:45Z) - Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients.
We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage.
Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z) - Quantum randomness certification with untrusted measurements and few
probe states [0.0]
We present a scheme for quantum random-number generation from an untrusted measurement device and a trusted source.
No assumptions about noise or imperfections in the measurement are required, and the scheme is simple to implement with existing technology.
We show that randomness can be certified in the presence of both Gaussian additive noise and non-Gaussian imperfections.
arXiv Detail & Related papers (2022-10-24T21:18:22Z) - Valid and efficient entanglement verification with finite copies of a
quantum state [0.4523163728236145]
We show how to optimize the validity and the efficiency of entanglement detection schemes in small data sets.
The method is based on an analytical model of finite statistics effects on correlation functions.
arXiv Detail & Related papers (2022-08-03T11:27:45Z) - Experimentally determining the incompatibility of two qubit measurements [55.41644538483948]
We describe and realize an experimental procedure for assessing the incompatibility of two qubit measurements.
We demonstrate this fact in an optical setup, where the qubit states are encoded into the photons' polarization degrees of freedom.
arXiv Detail & Related papers (2021-12-15T19:01:44Z) - Experimental violations of Leggett-Garg's inequalities on a quantum
computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems.
Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Bell nonlocality is not sufficient for the security of standard
device-independent quantum key distribution protocols [1.9573380763700712]
Device-independent quantum key distribution is a secure quantum cryptographic paradigm that allows two honest users to establish a secret key.
We show that no protocol of this form allows for establishing a secret key when implemented on any correlation obtained by measuring local projective measurements.
arXiv Detail & Related papers (2021-03-03T19:10:06Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z) - Adaptive generalized measurement for unambiguous state discrimination of
quaternary phase-shift-keying coherent states [0.0]
We experimentally demonstrate an adaptive generalized measurement that can unambiguously discriminate the quaternary phase-shift-keying coherent states.
Our results show a clear improvement of both a probability of conclusive results and a ratio of erroneous decision caused by unavoidable experimental imperfections over conventional static generalized measurements.
arXiv Detail & Related papers (2020-09-05T16:09:46Z) - Balance-Subsampled Stable Prediction [55.13512328954456]
We propose a novel balance-subsampled stable prediction (BSSP) algorithm based on the theory of fractional factorial design.
A design-theoretic analysis shows that the proposed method can reduce the confounding effects among predictors induced by the distribution shift.
Numerical experiments on both synthetic and real-world data sets demonstrate that our BSSP algorithm significantly outperforms the baseline methods for stable prediction across unknown test data.
arXiv Detail & Related papers (2020-06-08T07:01:38Z) - Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable
Neural Distribution Alignment [52.02794488304448]
We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows.
We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
arXiv Detail & Related papers (2020-03-26T22:10:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.