We develop a framework for characterizing quantum temporal correlations in a general temporal scenario, in which an initial quantum state is measured, sent through a quantum channel, and finally measured again. This framework does not make any assumptions on the system nor on the measurements, namely, it is device independent. It is versatile enough, however, to allow for the addition of further constraints in a semi-device-independent setting. Our framework serves as a natural tool for quantum certification in a temporal scenario when the quantum devices involved are uncharacterized or partially characterized. It can hence also be used for characterizing quantum temporal correlations when one assumes an additional constraint of no-signalling in time, there are upper bounds on the involved systems' dimensions, rank constraints-for which we prove genuine quantum separations over local hidden variable models-or further linear constraints. We present a number of applications, including bounding the maximal violation of temporal Bell inequalities, quantifying temporal steerability, and bounding the maximum successful probability in quantum randomness access codes.
The semi-device-independent framework allows one to draw conclusions about properties of an unknown quantum system under weak assumptions. Here we present a semi-device-independent scheme for the characterization of multipartite entanglement based around a game played by several isolated parties whose devices are uncharacterized beyond an assumption about the dimension of their Hilbert spaces. Our scheme can simultaneously certify that an
n-partite high-dimensional quantum state features genuine multipartite entanglement, and that a joint measurement on
n subsystems is entangled. Moreover, it provides a lower bound on the number of entangled measurement operators. These tests are strongly robust to noise, and even optimal for certain classes of states and measurements, as we demonstrate with illustrative examples. Notably, our scheme allows the certification of many entangled states admitting a local model, which therefore cannot violate any Bell inequality.
Self-testing has been established as a major approach for quantum device certification based on experimental statistics with minimal assumptions. However, despite more than 20 years of research effort, most of the self-testing protocols are restricted to spatial scenarios (Bell scenarios), without many temporal generalizations known. Under the scenario of sequential measurements performed on a single quantum system, semi-definite optimization-based techniques have been applied to bound sequential measurement inequalities. Building upon this formalism, we show that the optimizer matrix that saturates such sequential inequalities is unique and, moreover, this uniqueness is robust to small deviations from the quantum bound. Furthermore, we consider a generalized scenario in the presence of quantum channels and highlight analogies to the structure of Bell and sequential inequalities using the pseudo-density matrix formalism. These analogies allow us to show a practical use of maximal violations of sequential inequalities in the form of certification of quantum channels up to isometries.
A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.
Quantum mechanics dramatically revolutionized our understanding of nature, challenged traditional information theory, and led to significant technological advancements. Two of the most counterintuitive features of quantum mechanics are quantum nonlocality and quantum contextuality. These features rule out hidden-variable models that attempt to explain quantum phenomena based on classical intuition. Quantum non-locality, first revealed by Bell's theorem in 1964, rules out local hidden-variable (LHV) models, originating from the famous Einstein-Podolsky-Rosen paradox. Meanwhile, quantum contextuality, originally pinpointed by the Kochen-Specker (KS) theorem in 1967, focuses on single-system correlations rather than between space-like separated systems, demonstrating quantum mechanics is incompatible with non-contextual hidden-variable (NCHV) models. Quantum correlations are crucial in several applications, both in computing and communication tasks. They also enable the strongest form of cryptographic security through the device-independent (DI) paradigm, where devices are treated as black-boxes, and could even be supplied by potentially malicious adversaries. The semi-device-independent (SDI) paradigm offers a more practical solution by balancing security and feasibility, allowing for some assumptions about devices. Since different DI and SDI applications require specific properties, this thesis focuses on designing optimal quantum correlations for these applications. DI randomness amplification (DIRA) is an important task in DI information processing, that converts a weak, biased seed into a fully random one. Quantum correlations on the boundary of the no-signaling set are necessary for this task. We introduce a class of almost-quantum Bell inequalities and develop a tilted version of the celebrated Hardy’s paradox showing corresponding quantum correlations enhance the robustness and efficiency in state-of-the-art DIRA protocols. Another direction pursued in the thesis is the study of self-testing, a DI approach to certify the state and measurements of quantum systems in a unique manner. We investigated three families of quantum correlations, the tilted Hardy tests, which we prove self-test any two-qubit pure entangled state, except the maximally-entangled one, the
α-CHSH inequalities, where we prove robust self-test of the singlet and corresponding measurements, and weighted-Braunstein-Caves chained inequalities, which we prove delineate a boundary for the quantum correlation set, extending beyond the well-known Tsirelson-Landau-Masanes boundary. A third main direction explored in the thesis is the efficient construction of novel state-dependent and state-independent contextuality proof. We provide an optimal and experiment-friendly toolbox for various contextuality-based applications, including demonstrating entanglement-assisted advantages in zero-error communication, separating binary-outcome no-signaling models from quantum theory, and achieving optimal randomness rate in the SDI paradigm. We also discuss and address issues arising from the noise and errors in real-world experimental tests of the KS theorem, and show that quantum mechanics also violates NCHV models under arbitrary relaxation of the so-called non-disturbance conditions. Finally, a counter-intuitive phenomenon, termed ``bound randomness'', is introduced, revealing a deep resource-theoretical relationship between non-locality and DI-certified randomness. Analogous to Werner's famous result that entanglement is not sufficient for non-locality, ``bound randomness'' indicates non-locality is not always sufficient for DI randomness certification under standard spot-checking protocols. In conclusion, this thesis introduces key techniques in contextuality and non-locality for designing targeted correlations for various DI and SDI applications.
Spatial and temporal correlations in quantum noise challenge the local Markovian models commonly used in quantum information processing. We develop a unified operational framework for quantifying temporal, spatial, and total spatiotemporal correlations in general quantum processes. Using process tensors, we define these quantities through optimal distinguishability from Markovian, spatially local, and fully uncorrelated processes. Optimization over admissible probing combs ensures monotonicity under every superprocess that preserves the corresponding free set, while Choi-state functionals and restricted probes provide accessible lower bounds. We establish hierarchy and interpolation relations among the correlation measures and derive dimension-dependent upper bounds on temporal correlations transmitted by quantum memories, with tighter bounds for classical memory, together with universal ceilings imposed by the system dimension. These bounds turn certified lower estimates into witnesses of minimum memory dimension, nonclassicality under a memory-dimension constraint, and inconsistencies in the assumed process model. We illustrate the results with effective superconducting-qubit models featuring
ZZ and
XY interactions, exhibiting saturation of classical-memory, quantum-memory, and system-dimension ceilings. These results pave the way toward practical approaches to characterizing and addressing spatiotemporally correlated errors in quantum devices.
Quantum measurements under realistic conditions reveal only partial information about a system. Yet, by performing sequential measurements on the same system, additional information can be accessed. We investigate this problem in the context of semi-device-independent randomness certification using sequential maximum-confidence measurements. We develop a general framework and versatile numerical methods to bound the amount of certifiable randomness in such scenarios. We further introduce a technique to compute min-tradeoff functions via semidefinite programming duality, thus making the framework suitable for bounding the certifiable randomness against adaptive attacking strategies through entropy accumulation. Our results establish sufficient criteria showing that maximum-confidence measurements enable the distribution and certification of randomness across a sequential measurement chain in single-party systems.