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

arXiv:2610.08516

Optimal GHZ extraction from MABK violations

Avraham Kreindel, Aryeh Lev Zabokritskiy

quant-phSubmitted Oct 6, 2026• Announced Oct 7, 2026• 0 citations• Revised Oct 28, 2026 (v2)
v1 · Oct 6, 2026v2 · Oct 28, 2026
arXivHTMLPDF

Abstract

We determine the least Greenberger-Horne-Zeilinger (GHZ) extractability compatible with a Mermin-Ardehali-Belinskii-Klyshko (MABK) Bell score for every $n\geq3$. Extractability is the largest squared overlap with a GHZ state obtainable by separate local quantum channels. Between the biseparable bound and the quantum maximum, its exact minimum is the affine interpolation from one half to one. This proves the bound conjectured for six or more parties. The result holds for arbitrary binary measurements and density operators on tensor products of finite- or infinite-dimensional local spaces. We also determine the exact minimum for qubits, which is strictly higher at every interior score. One qutrit and qubits elsewhere attain the unrestricted minimum with measurements fixed as the score varies and, at interior scores, realize the smallest product of ranks of the local reduced states among states attaining that minimum. For $n\geq4$, the attaining state with this rank product is unique at each interior score, up to local isometries and party permutations. On one qutrit and qubits elsewhere, for $n\geq4$ and scores a fixed fraction away from both endpoints, a sufficiently small excess of extractability above the minimum controls trace-norm distance to the attaining state of the same score, up to local unitaries. The dependence is of square-root order, with optimal exponent and explicit constants depending only on that fraction, uniformly in $n$. Equality and stability concern actual extractability; identical Bell statistics can accompany different extractabilities.

Comments
39 pages, 1 figure. Expanded equality and stability results, added fixed-measurement bounds, and revised exposition

Related papers

Analytic Maximal Violation of Extended MABK Inequalities for Generalized GHZ States

Kun-Peng Wu, Hui-Xian Meng, Jie Zhou +1 more

We analytically characterize the maximal quantum violation of the extended Mermin-Ardehali-Belinskii-Klyshko (EMABK) family of inequalities by $n$-qubit generalized Greenberger-Horne-Zeilinger (GHZ) states. We develop a correlation-tensor approach in which the Bell value is expressed as the Frobenius inner product of the quantum correlation tensor and an effective coefficient tensor. A rank constraint on the latter, together with the von Neumann trace inequality, yields an upper bound governed by the two largest singular values of the reshaped correlation-tensor. For generalized GHZ states, we determine the complete singular spectrum and obtain a piecewise analytic upper bound. We then construct two complementary measurement strategies that saturate the bound for EMABK throughout the entire parameter range. The first is a purely MABK strategy in which all measurement directions lie in the equatorial plane of the Bloch sphere. The second is a hybrid strategy that recursively combines lower-order MABK anti-diagonal operators with the fully-$σ_z$ tensor product. The resulting piecewise analytic expression recovers the standard MABK Tsirelson bound $2^{(n-1)/2}$ in the maximally entangled limit and approaches the classical local-hidden-variable bound in the product-state limits. It further shows that every entangled generalized GHZ state exhibits a strict quantum-classical separation under the EMABK inequality, thereby eliminating the nonviolation region of the standard MABK inequality in the partially entangled regime.

quant-pharXiv:2609.02045•Sep 3, 2026•0 citations

Certifying optimal device-independent quantum randomness in quantum networks

Shuai Zhao, Rong Wang, Qi Zhao

Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at $N=3$, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.

quant-pharXiv:2601.18534•Jan 27, 2026•1 citation

Exact minimum measurement dependence for faithful local deterministic models of multipartite GHZ-Mermin correlations

Aaron Alai

A local deterministic model can reproduce Bell-inequality violations only if the hidden state depends on the measurement settings. Hall found the minimum such dependence for the singlet state [Phys. Rev. Lett. 105, 250404 (2010)] and posed the corresponding problem for the Mermin state [Phys. Rev. A 84, 022102 (2011)]. This paper solves it, for the $n$-party GHZ-Mermin scenario at every $n \geq 3$, with the marginals reproduced as well as the correlators. The minimum measurement-dependence fraction is $F_{\min}(n) = R/[2(R+1)]$, with $R = 2^{\lfloor (n-1)/2 \rfloor}$ the Mermin violation ratio: $1/3, 2/5, 4/9, 8/17, \ldots$, always below $1/2$. The lower bound follows from Mermin's inequality by a general overlap bound; the upper bound is an explicit model, uniform on the hidden-variable classes that violate the fewest constraints, with closed-form counts; a reduction theorem shows that for Mermin scenarios the marginals impose no additional dependence. The Mermin values are also certified by integer-arithmetic enumeration through $n = 22$. The formula was stated as a conjecture in the first version of this paper and was first proved, by a different route, by Wang, Yao and Chen; the proof here was obtained independently and the two agree. Every minimal contradiction of size $k$ among stabilizer constraints has correlator-only minimum $1/(k-1)$. With the marginals included the minimum is the same on every core of the $C_5$ ring cluster, on the size-4 and size-5 cores of $C_4$ and on every four-core of $C_6$, but larger on the size-6 and size-7 cores of $C_4$ and on 112 of the 1,920 five-cores of $C_6$, with exact certificates on both sides in every case.

quant-pharXiv:2608.00124•Aug 3, 2026•0 citations

Expanding bipartite Bell inequalities for maximum multi-partite randomness

Lewis Wooltorton, Peter J. Brown, Roger Colbeck

Nonlocal tests on multi-partite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult. For example, extremal Bell inequalities are tight witnesses of nonlocality, but achieving their maximum violation places constraints on the underlying quantum system, which can reduce the rate of randomness generation. As a result there is often a trade-off between maximum randomness and the amount of violation of a given Bell inequality. Here, we explore this trade-off for more than two parties. More precisely, we study the maximum amount of randomness that can be certified by correlations with a particular violation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. For any even number of parties, we find that maximum randomness cannot occur beyond a threshold quantum violation, which increases with the number of parties, and we give a conjectured form of the maximum randomness in terms of the MABK value. We also show that maximum randomness can be obtained for any MABK violation for odd numbers of parties. To obtain our results, we derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities''. Our technique allows a bipartite Bell expression to be used as a seed, and transformed into a multi-partite Bell inequality tailored for randomness certification, showing how intuition learned in the bipartite case can find use in more complex scenarios.

arXiv:2308.07030•Quantum•Dec 5, 2025•1 citation

Probing the robustness of various self-testing protocols for multipartite entangled states

Priyaranjan K. Jha, Ritesh K. Singh, A. K. Pan

Device-independent certification of multipartite entangled states plays a central role in a wide range of practical applications, including quantum networks, conference key agreement, and verifiable distributed quantum computation. A particularly important class of multipartite entangled states is the class of Greenberger-Horne-Zeilinger (GHZ) states. Many Bell operators have been proposed to self-test GHZ states. However, in practical scenarios, due to imperfections and the finite collection of statistics, the observed statistics do not satisfy the ideal self-testing relations. Hence, it becomes essential to investigate and compare the robustness of the different self-testing protocols. In this work, we investigate the robustness of self-testing schemes constructed from Bell operators due to Svetlichny and Mermin--Ardehali--Belinskii--Klyshko (MABK), using the analytic operator-inequality framework developed by Kaniewski [\href{https://doi.org/10.1103/PhysRevLett.117.070402}{Phys. Rev. Lett. 117, 070402 (2016)}]. We derive lower bounds on the extractable fidelity as a function of the observed value of these Bell operators. Although these protocols self-test the same underlying state, they exhibit markedly different levels of robustness. By comparing the resulting fidelity bounds, we demonstrate that the self-testing scheme based on the Svetlichny's Bell operator is the more robust among the two. Our results thus identify the Svetlichny operator based self-testing protocol as the most favorable candidate for device-independent certification of GHZ states in realistic, noisy experimental scenarios.

quant-pharXiv:2605.03518•May 6, 2026•0 citations

Graph-theoretic approach for self-testing of multipartite Mermin-Ardehali-Belinskiǐ-Klyshko inequalities

Daipengwei Bao, Zhiwei Zhao, Yonghong Zhou +3 more

Self-testing is a device-independent technique that allows for verification of unknown quantum systems only when observed correlations achieve some quantum supremum. In this paper, we present self-testing schemes for a class of multipartite Bell inequalities with a specific structure, which we refer to as the unit. Our research is based on the graph-theoretic approach, where correlations are characterized via Lov\'asz theta body in the framework of exclusivity graphs. The derived statements are subsequently applied to prove the self-testability of $N$-partite Mermin-Ardehali-Belinski\ifmmode \check{i}\else \v{i}\fi{}-Klyshko (MABK) family of Bell inequalities. In particular, we take special cases to demonstrate that the maximal violation of the multipartite MABK inequality is a self-test for the corresponding multipartite Greenberger-Horne-Zeilinger (GHZ) state. Moreover, we propose a device-independent verification algorithm for distributed blind quantum computation in the noisy intermediate-scale quantum era combined with multipartite GHZ state self-testing, where multiple quantum servers are involved and work in collaboration to reduce the burden on a single server.

Physical Review A•Nov 26, 2025•0 citations
We determine the least Greenberger-Horne-Zeilinger (GHZ) extractability compatible with a Mermin-Ardehali-Belinskii-Klyshko (MABK) Bell score for every n≥3n\geq3n≥3. Extractability is the largest squared overlap with a GHZ state obtainable by separate local quantum channels. Between the biseparable bound and the quantum maximum, its exact minimum is the affine interpolation from one half to one. This proves the bound conjectured for six or more parties. The result holds for arbitrary binary measurements and density operators on tensor products of finite- or infinite-dimensional local spaces. We also determine the exact minimum for qubits, which is strictly higher at every interior score. One qutrit and qubits elsewhere attain the unrestricted minimum with measurements fixed as the score varies and, at interior scores, realize the smallest product of ranks of the local reduced states among states attaining that minimum. For n≥4n\geq4n≥4, the attaining state with this rank product is unique at each interior score, up to local isometries and party permutations. On one qutrit and qubits elsewhere, for n≥4n\geq4n≥4 and scores a fixed fraction away from both endpoints, a sufficiently small excess of extractability above the minimum controls trace-norm distance to the attaining state of the same score, up to local unitaries. The dependence is of square-root order, with optimal exponent and explicit constants depending only on that fraction, uniformly in nnn. Equality and stability concern actual extractability; identical Bell statistics can accompany different extractabilities.
We analytically characterize the maximal quantum violation of the extended Mermin-Ardehali-Belinskii-Klyshko (EMABK) family of inequalities by nnn-qubit generalized Greenberger-Horne-Zeilinger (GHZ) states. We develop a correlation-tensor approach in which the Bell value is expressed as the Frobenius inner product of the quantum correlation tensor and an effective coefficient tensor. A rank constraint on the latter, together with the von Neumann trace inequality, yields an upper bound governed by the two largest singular values of the reshaped correlation-tensor. For generalized GHZ states, we determine the complete singular spectrum and obtain a piecewise analytic upper bound. We then construct two complementary measurement strategies that saturate the bound for EMABK throughout the entire parameter range. The first is a purely MABK strategy in which all measurement directions lie in the equatorial plane of the Bloch sphere. The second is a hybrid strategy that recursively combines lower-order MABK anti-diagonal operators with the fully-σzσ_zσz​ tensor product. The resulting piecewise analytic expression recovers the standard MABK Tsirelson bound 2(n−1)/22^{(n-1)/2}2(n−1)/2 in the maximally entangled limit and approaches the classical local-hidden-variable bound in the product-state limits. It further shows that every entangled generalized GHZ state exhibits a strict quantum-classical separation under the EMABK inequality, thereby eliminating the nonviolation region of the standard MABK inequality in the partially entangled regime.
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at N=3N=3N=3, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.
A local deterministic model can reproduce Bell-inequality violations only if the hidden state depends on the measurement settings. Hall found the minimum such dependence for the singlet state [Phys. Rev. Lett. 105, 250404 (2010)] and posed the corresponding problem for the Mermin state [Phys. Rev. A 84, 022102 (2011)]. This paper solves it, for the nnn-party GHZ-Mermin scenario at every n≥3n \geq 3n≥3, with the marginals reproduced as well as the correlators. The minimum measurement-dependence fraction is Fmin⁡(n)=R/[2(R+1)]F_{\min}(n) = R/[2(R+1)]Fmin​(n)=R/[2(R+1)], with R=2⌊(n−1)/2⌋R = 2^{\lfloor (n-1)/2 \rfloor}R=2⌊(n−1)/2⌋ the Mermin violation ratio: 1/3,2/5,4/9,8/17,…1/3, 2/5, 4/9, 8/17, \ldots1/3,2/5,4/9,8/17,…, always below 1/21/21/2. The lower bound follows from Mermin's inequality by a general overlap bound; the upper bound is an explicit model, uniform on the hidden-variable classes that violate the fewest constraints, with closed-form counts; a reduction theorem shows that for Mermin scenarios the marginals impose no additional dependence. The Mermin values are also certified by integer-arithmetic enumeration through n=22n = 22n=22. The formula was stated as a conjecture in the first version of this paper and was first proved, by a different route, by Wang, Yao and Chen; the proof here was obtained independently and the two agree. Every minimal contradiction of size kkk among stabilizer constraints has correlator-only minimum 1/(k−1)1/(k-1)1/(k−1). With the marginals included the minimum is the same on every core of the C5C_5C5​ ring cluster, on the size-4 and size-5 cores of C4C_4C4​ and on every four-core of C6C_6C6​, but larger on the size-6 and size-7 cores of C4C_4C4​ and on 112 of the 1,920 five-cores of C6C_6C6​, with exact certificates on both sides in every case.
Nonlocal tests on multi-partite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult. For example, extremal Bell inequalities are tight witnesses of nonlocality, but achieving their maximum violation places constraints on the underlying quantum system, which can reduce the rate of randomness generation. As a result there is often a trade-off between maximum randomness and the amount of violation of a given Bell inequality. Here, we explore this trade-off for more than two parties. More precisely, we study the maximum amount of randomness that can be certified by correlations with a particular violation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. For any even number of parties, we find that maximum randomness cannot occur beyond a threshold quantum violation, which increases with the number of parties, and we give a conjectured form of the maximum randomness in terms of the MABK value. We also show that maximum randomness can be obtained for any MABK violation for odd numbers of parties. To obtain our results, we derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities''. Our technique allows a bipartite Bell expression to be used as a seed, and transformed into a multi-partite Bell inequality tailored for randomness certification, showing how intuition learned in the bipartite case can find use in more complex scenarios.
Device-independent certification of multipartite entangled states plays a central role in a wide range of practical applications, including quantum networks, conference key agreement, and verifiable distributed quantum computation. A particularly important class of multipartite entangled states is the class of Greenberger-Horne-Zeilinger (GHZ) states. Many Bell operators have been proposed to self-test GHZ states. However, in practical scenarios, due to imperfections and the finite collection of statistics, the observed statistics do not satisfy the ideal self-testing relations. Hence, it becomes essential to investigate and compare the robustness of the different self-testing protocols. In this work, we investigate the robustness of self-testing schemes constructed from Bell operators due to Svetlichny and Mermin--Ardehali--Belinskii--Klyshko (MABK), using the analytic operator-inequality framework developed by Kaniewski [\href{https://doi.org/10.1103/PhysRevLett.117.070402}{Phys. Rev. Lett. 117, 070402 (2016)}]. We derive lower bounds on the extractable fidelity as a function of the observed value of these Bell operators. Although these protocols self-test the same underlying state, they exhibit markedly different levels of robustness. By comparing the resulting fidelity bounds, we demonstrate that the self-testing scheme based on the Svetlichny's Bell operator is the more robust among the two. Our results thus identify the Svetlichny operator based self-testing protocol as the most favorable candidate for device-independent certification of GHZ states in realistic, noisy experimental scenarios.
Self-testing is a device-independent technique that allows for verification of unknown quantum systems only when observed correlations achieve some quantum supremum. In this paper, we present self-testing schemes for a class of multipartite Bell inequalities with a specific structure, which we refer to as the unit. Our research is based on the graph-theoretic approach, where correlations are characterized via Lov\'asz theta body in the framework of exclusivity graphs. The derived statements are subsequently applied to prove the self-testability of NNN-partite Mermin-Ardehali-Belinski\ifmmode \check{i}\else \v{i}\fi{}-Klyshko (MABK) family of Bell inequalities. In particular, we take special cases to demonstrate that the maximal violation of the multipartite MABK inequality is a self-test for the corresponding multipartite Greenberger-Horne-Zeilinger (GHZ) state. Moreover, we propose a device-independent verification algorithm for distributed blind quantum computation in the noisy intermediate-scale quantum era combined with multipartite GHZ state self-testing, where multiple quantum servers are involved and work in collaboration to reduce the burden on a single server.