arXiv subjects

Nicola D'Alessandro

Publications and source records attributed to Nicola D'Alessandro.

5 recordsLinked to original sources

arXiv2026

Quantum coherence as randomness under classical control

Quantum states that do not commute exhibit coherence, but only when the device preparing them is assumed to be unaffected by classical parameters inaccessible to the experimenter. Accounting for such hidden classical control leads to a stronger notion of coherence. We establish its significance through the task of randomness certification. It is shown that a preparation device is coherent if and only if it can be used to certify randomness in a prepare-and-measure experiment. This operational interpretation motivates the problem of certifying coherence in the presence of hidden classical control. We obtain a complete characterisation of coherence through a hierarchy of semidefinite programs. Then, we introduce a practical semidefinite programming approach that achieves useful accuracy while remaining computationally efficient even for devices preparing many, potentially high-dimensional, quantum states. For the important case of qubits, we further exploit connections with the theory of joint measurability to obtain highly accurate coherence characterisation that scales to more than one thousand qubit states. Our results give operational meaning to quantum coherence under hidden classical control and provide a versatile toolbox for its certification.

quant-ph↗

arXiv2026

Characterising the set of deterministic quantum correlations in prepare-and-measure scenarios

Correlations that do not admit a deterministic explanation are a central feature of quantum theory and a key resource for quantum information processing. Identifying and certifying such correlations, however, remains a fundamental challenge. In this work, we advance on this problem by considering deterministic correlations in the prepare-and-measure scenario consistent with a wide range of communication restrictions. To certify correlations incompatible with such deterministic models, we ask whether they admit a scenario in which measurement outcomes can be perfectly predicted by an adversary equipped with classical side-information. We show the usefulness of this approach and propose semidefinite programming relaxations tailored to three representative communication restrictions: fixed ensemble, bounded overlaps and restricted observables.

quant-ph↗

arXiv2026

Semidefinite block-matrix relaxations for computing quantum correlations

Bounding the correlations predicted by quantum theory is an important challenge in quantum information science. Today's leading approach is semidefinite programming relaxations, but existing methods still cannot account for many relevant types of constraints. Here, we propose a semidefinite relaxation methodology that can incorporate a breadth of constraints needed in various quantum correlation problems, thereby generalising the seminal Navascués-Pironio-Acín hierarchy. It yields useful results at reasonable computational cost. We showcase the methodology and its features by using it to address five different quantum information problems. These are (i) entanglement witnessing from imperfect measurement devices, (ii) certifying measurements from fidelity-constrained sources, (iii) computing dimensionality in genuine multi-particle entangled states, (iv) benchmarking dimensionality for state preparation devices, and (v) finding uncertainty relations for nearly anti-commuting observables. These applications reflect both the usefulness and versatility of the methodology, as well as its potential for broader relevance in the field.

quant-ph↗

arXiv2026

Almost all pure entangled states enable unbounded nonlocality sharing

We establish a connection between Hardy's paradox and nonlocality sharing in sequential bipartite scenarios, where each subsystem is measured in turn by a chain of observers. We show that any correlations exhibiting a Hardy paradox in the two-input two-output scenario enable sequential violations of the CHSH inequality between arbitrarily many pairs of observers, using only projective measurements and the assistance of a small local ancilla system. Since almost all pure entangled states, with the only exception of the maximally entangled one, admit Hardy correlations, our protocol applies generically: almost all pure entangled states, if assisted by a local ancilla, allow for nonlocality sharing between arbitrarily many observer pairs using only projective measurements.

quant-ph↗

arXiv2025

Semidefinite relaxations for high-dimensional entanglement in the steering scenario

We introduce semidefinite programming hierarchies for benchmarking relevant entanglement properties in the high-dimensional steering scenario. Firstly, we provide a general method for detecting the entanglement dimensionality through certification of the Schmidt number. Its key feature is that the computational cost is independent of the Schmidt number under consideration. Secondly, we provide a method to estimate the fidelity of the source with any maximally entangled state. Using only basic computational means, we demonstrate the usefulness of these methods, which can be directly used to analyse experiments on high-dimensional systems.

quant-ph↗