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:2609.13075

Certification of Absolutely Entangled Sets in the Prepare-and-Measure Scenario

Ram Krishna Patra, Abdelmalek Taoutioui, Tamás Vértesi

quant-phSubmitted Sep 11, 2026• Announced Sep 14, 2026• 0 citations
arXivHTMLPDF

Abstract

An absolutely entangled set (AES) is a collection of states for which at least one member remains entangled under any choice of global unitary transformation. We develop a semi-device-independent framework for certifying this property from dimensionally bounded prepare-and-measure correlations. A witness value above the maximum attainable with separable preparations of a given dimension rules out every non-AES realization. To upperbound this limit, we construct a semidefinite-programming (SDP) hierarchy tailored to separable preparations. For a two-qubit random-access-code witness, the SDP upper bound and the heuristic lower bound coincide to the reported precision, yielding a concrete AES certification. We also formulate a general construction of witnesses for extended preparation sets containing target pure-state AESs. Examples based on equiangular tight frames, a minimal AES, and mutually unbiased bases further illustrate the scope of the method. In summary, our results establish a systematic and experimentally feasible approach to the certification of AESs in semi-device-independent quantum information protocols.

Comments
26 pages, 3 figures, comments are welcome

Related papers

Absolutely entangled sets of pure states for bipartitions and multipartitions

Baichu Yu, Pooja Jayachandran, Adam Burchardt +3 more

A set of quantum states is said to be absolutely entangled when at least one state in the set remains entangled for any definition of subsystems, i.e., for any choice of the global reference frame. In this work we investigate the properties of absolutely entangled sets (AESs) of pure quantum states. For the case of a two-qubit system, we present a sufficient condition to detect an AES, and use it to construct families of $N$ states such that $N\ensuremath{-}3$ (the maximal possible number) remain entangled for any definition of subsystems. For a general bipartition $d={d}_{1}{d}_{2}$, we prove that sets of $N>\ensuremath{\lfloor}({d}_{1}+1)({d}_{2}+1)/2\ensuremath{\rfloor}$ states are AESs with Haar measure 1. Then, we define AESs for multipartitions. We derive a general lower bound on the number of states in an AES for a given multipartition, and also construct explicit examples. In particular, we exhibit an AES with respect to any possible multipartitioning of the total system.

arXiv:2106.16216•Physical Review A•Sep 17, 2021•0 citations

Semi-device-independent certification of high-dimensional quantum channels

Mengyan Li, Yanning Jia, Fenzhuo Guo +3 more

Certifying high-dimensional quantum channels is essential for ensuring the reliability of quantum communication protocols. Existing certification schemes often rely on fully trusted internal devices, which is difficult to achieve in realistic scenarios. Here, we propose a semi-device-independent framework for certifying channel properties directly from observed statistics, assuming only that the system dimension is known. By explicitly incorporating the full set of structural constraints inherent to Choi states, our approach exploits the Choi-Jamiołkowski isomorphism for rigorous certification of quantum channels. The entanglement dimensionality of quantum channels is first certified by introducing a witness and numerically determining its Schmidt-number-dependent bounds. This certification method reproduces known analytical benchmarks and is applied to dephasing and depolarizing noise channels, thereby confirming its validity. To provide a more complete assessment of channel performance, the entanglement fidelity of quantum channels is also certified using a hierarchy of semidefinite programming relaxations based on localizing matrices. Lower bounds on the entanglement fidelity are obtained that are compatible with either the full set of observed statistics or a single witness value.

quant-pharXiv:2602.07823•Physical Review A•Feb 10, 2026•0 citations

Randomness can be certified in energy-constrained semi-device-independent scenarios

Shashank Kumar Ranu, Lewis Wooltorton, Alastair A. Abbott +1 more

The prepare-and-measure framework based on energy constraints offers a practical middle ground between fully device-dependent and device-independent quantum cryptography. The only assumption on an otherwise uncharacterized prepare-and-measure device is that the energy of the prepared states is bounded. Existing security analyses of this framework assume that the preparation and measurement devices share at most classical correlations, and under this assumption certified lower bounds on the extractable randomness have been established. Recent work has shown that an adversary who pre-distributes entanglement between the devices can mount attacks that are strictly more powerful than those available when the devices share only classical correlations, reducing the extractable randomness below the previously certified rates. This leaves open the fundamental question of whether randomness can be certified at all in this scenario. We address this open question by constructing semidefinite programming relaxations of the guessing probability by adapting the Navascués-Pironio-Acín hierarchy to the energy-constrained setting where shared entanglement between the devices is permitted. Our relaxations yield certified lower bounds on the extractable randomness without enforcing any restrictions on the dimensions of the quantum state shared between the preparation and measurement devices. We show that these certified lower bounds are strictly positive for a range of energy values, thereby answering the open question affirmatively: certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.

quant-pharXiv:2608.27357•Aug 28, 2026•0 citations

Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario

Tailan S. Sarubi, Moisés Alves, Vinícius F. Alves +4 more

We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality while remaining robust to noise. Finally, we show that the prepare-and-broadcast scenario naturally accommodates stronger adversarial models in which the eavesdropper retains a quantum system correlated with the measurement device, providing a natural framework for semi-device-independent randomness certification against quantum side information.

quant-pharXiv:2608.08329•Aug 11, 2026•0 citations

Semi-device-independent nonstabilizerness certification in the prepare-and-measure scenario

Santiago Zamora, Rafael A. Macêdo, Tailan S. Sarubi +3 more

Nonstabilizerness is an essential resource for quantum computational advantage as stabilizer states admit efficient classical simulation. We develop a semi-device-independent framework for certifying nonstabilizer states in prepare-and-measure (PAM) scenarios, relying only on assumptions about the system's dimension. Within this framework, we introduce PAM witnesses that can distinguish stabilizer from nonstabilizer states, and we provide analytical proofs that threshold violations of these witnesses certify nonstabilizerness. In the simplest setting---three preparations, two measurements, and qubit systems---surpassing a specific threshold guarantees that at least one prepared state lies outside the stabilizer polytope, while a stronger violation can certify at least two. We extend this approach by linking it to quantum random access codes, also generalizing our results to qutrit systems and introducing a necessary condition for certifying nonstabilizerness based on state overlaps (Gram matrices). These results offer a set of semi-device-independent tools for practically and systematically verifying nonstabilizer states using PAM inequalities.

arXiv:2506.02226•Physical Review A•Sep 10, 2025•7 citations

Bounding sets of sequential quantum correlations and device-independent randomness certification

Joseph Bowles, Flavio Baccari, Alexia Salavrakos

An important problem in quantum information theory is that of bounding sets of correlations that arise from making local measurements on entangled states of arbitrary dimension. Currently, the best-known method to tackle this problem is the NPA hierarchy; an infinite sequence of semidefinite programs that provides increasingly tighter outer approximations to the desired set of correlations. In this work we consider a more general scenario in which one performs sequences of local measurements on an entangled state of arbitrary dimension. We show that a simple adaptation of the original NPA hierarchy provides an analogous hierarchy for this scenario, with comparable resource requirements and convergence properties. We then use the method to tackle some problems in device-independent quantum information. First, we show how one can robustly certify over 2.3 bits of device-independent local randomness from a two-quibt state using a sequence of measurements, going beyond the theoretical maximum of two bits that can be achieved with non-sequential measurements. Finally, we show tight upper bounds to two previously defined tasks in sequential Bell test scenarios.

arXiv:1911.11056•Quantum•Oct 19, 2020•36 citations
An absolutely entangled set (AES) is a collection of states for which at least one member remains entangled under any choice of global unitary transformation. We develop a semi-device-independent framework for certifying this property from dimensionally bounded prepare-and-measure correlations. A witness value above the maximum attainable with separable preparations of a given dimension rules out every non-AES realization. To upperbound this limit, we construct a semidefinite-programming (SDP) hierarchy tailored to separable preparations. For a two-qubit random-access-code witness, the SDP upper bound and the heuristic lower bound coincide to the reported precision, yielding a concrete AES certification. We also formulate a general construction of witnesses for extended preparation sets containing target pure-state AESs. Examples based on equiangular tight frames, a minimal AES, and mutually unbiased bases further illustrate the scope of the method. In summary, our results establish a systematic and experimentally feasible approach to the certification of AESs in semi-device-independent quantum information protocols.
A set of quantum states is said to be absolutely entangled when at least one state in the set remains entangled for any definition of subsystems, i.e., for any choice of the global reference frame. In this work we investigate the properties of absolutely entangled sets (AESs) of pure quantum states. For the case of a two-qubit system, we present a sufficient condition to detect an AES, and use it to construct families of NNN states such that $N\ensuremath{-}3$ (the maximal possible number) remain entangled for any definition of subsystems. For a general bipartition d=d1d2d={d}_{1}{d}_{2}d=d1​d2​, we prove that sets of $N>\ensuremath{\lfloor}({d}_{1}+1)({d}_{2}+1)/2\ensuremath{\rfloor}$ states are AESs with Haar measure 1. Then, we define AESs for multipartitions. We derive a general lower bound on the number of states in an AES for a given multipartition, and also construct explicit examples. In particular, we exhibit an AES with respect to any possible multipartitioning of the total system.
Certifying high-dimensional quantum channels is essential for ensuring the reliability of quantum communication protocols. Existing certification schemes often rely on fully trusted internal devices, which is difficult to achieve in realistic scenarios. Here, we propose a semi-device-independent framework for certifying channel properties directly from observed statistics, assuming only that the system dimension is known. By explicitly incorporating the full set of structural constraints inherent to Choi states, our approach exploits the Choi-Jamiołkowski isomorphism for rigorous certification of quantum channels. The entanglement dimensionality of quantum channels is first certified by introducing a witness and numerically determining its Schmidt-number-dependent bounds. This certification method reproduces known analytical benchmarks and is applied to dephasing and depolarizing noise channels, thereby confirming its validity. To provide a more complete assessment of channel performance, the entanglement fidelity of quantum channels is also certified using a hierarchy of semidefinite programming relaxations based on localizing matrices. Lower bounds on the entanglement fidelity are obtained that are compatible with either the full set of observed statistics or a single witness value.
The prepare-and-measure framework based on energy constraints offers a practical middle ground between fully device-dependent and device-independent quantum cryptography. The only assumption on an otherwise uncharacterized prepare-and-measure device is that the energy of the prepared states is bounded. Existing security analyses of this framework assume that the preparation and measurement devices share at most classical correlations, and under this assumption certified lower bounds on the extractable randomness have been established. Recent work has shown that an adversary who pre-distributes entanglement between the devices can mount attacks that are strictly more powerful than those available when the devices share only classical correlations, reducing the extractable randomness below the previously certified rates. This leaves open the fundamental question of whether randomness can be certified at all in this scenario. We address this open question by constructing semidefinite programming relaxations of the guessing probability by adapting the Navascués-Pironio-Acín hierarchy to the energy-constrained setting where shared entanglement between the devices is permitted. Our relaxations yield certified lower bounds on the extractable randomness without enforcing any restrictions on the dimensions of the quantum state shared between the preparation and measurement devices. We show that these certified lower bounds are strictly positive for a range of energy values, thereby answering the open question affirmatively: certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.
We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality while remaining robust to noise. Finally, we show that the prepare-and-broadcast scenario naturally accommodates stronger adversarial models in which the eavesdropper retains a quantum system correlated with the measurement device, providing a natural framework for semi-device-independent randomness certification against quantum side information.
Nonstabilizerness is an essential resource for quantum computational advantage as stabilizer states admit efficient classical simulation. We develop a semi-device-independent framework for certifying nonstabilizer states in prepare-and-measure (PAM) scenarios, relying only on assumptions about the system's dimension. Within this framework, we introduce PAM witnesses that can distinguish stabilizer from nonstabilizer states, and we provide analytical proofs that threshold violations of these witnesses certify nonstabilizerness. In the simplest setting---three preparations, two measurements, and qubit systems---surpassing a specific threshold guarantees that at least one prepared state lies outside the stabilizer polytope, while a stronger violation can certify at least two. We extend this approach by linking it to quantum random access codes, also generalizing our results to qutrit systems and introducing a necessary condition for certifying nonstabilizerness based on state overlaps (Gram matrices). These results offer a set of semi-device-independent tools for practically and systematically verifying nonstabilizer states using PAM inequalities.
An important problem in quantum information theory is that of bounding sets of correlations that arise from making local measurements on entangled states of arbitrary dimension. Currently, the best-known method to tackle this problem is the NPA hierarchy; an infinite sequence of semidefinite programs that provides increasingly tighter outer approximations to the desired set of correlations. In this work we consider a more general scenario in which one performs sequences of local measurements on an entangled state of arbitrary dimension. We show that a simple adaptation of the original NPA hierarchy provides an analogous hierarchy for this scenario, with comparable resource requirements and convergence properties. We then use the method to tackle some problems in device-independent quantum information. First, we show how one can robustly certify over 2.3 bits of device-independent local randomness from a two-quibt state using a sequence of measurements, going beyond the theoretical maximum of two bits that can be achieved with non-sequential measurements. Finally, we show tight upper bounds to two previously defined tasks in sequential Bell test scenarios.