Searcharxiv⌕ Search

arXiv subjects

Armin Tavakoli

Publications and source records attributed to Armin Tavakoli.

At least 109 records · Page 6Linked to original sources

Measurement incompatibility and steering are necessary and sufficient for operational contextuality

Contextuality is a signature of operational nonclassicality in the outcome statistics of an experiment. This notion of nonclassicality applies to a breadth of physical phenomena. Here, we establish its relation to two fundamental nonclassical entities in quantum theory; measurement incompatibility and steering. We show that each is necessary and sufficient the failure of operational contextuality. We exploit the established connection to contextuality to provide a novel approach to problems in measurement incompatibility and steering.

quant-ph↗

Device independent witness of arbitrary dimensional quantum systems employing binary outcome measurements

Device independent dimension witnesses (DW) are a remarkable way to test the dimension of a quantum system in a prepare-and-measure scenario imposing minimal assumptions on the internal features of the devices. However, as the dimension increases, the major obstacle in the realization of DW arises due to the requirement of many outcome quantum measurements. In this article, we propose a new variant of a widely studied communication task (random access code) and take its average payoff as the DW. The presented DW applies to arbitrarily large quantum systems employing only binary outcome measurements.

quant-ph↗

Self-testing non-projective quantum measurements in prepare-and-measure experiments

Self-testing represents the strongest form of certification of a quantum system. Here we investigate theoretically and experimentally the question of self-testing non-projective quantum measurements. That is, how can one certify, from observed data only, that an uncharacterised measurement device implements a desired non-projective positive-operator-valued-measure (POVM). We consider a prepare-and-measure scenario with a bound on the Hilbert space dimension, which we argue is natural for this problem since any measurement can be made projective by artificially increasing the Hilbert space dimension. We develop methods for (i) robustly self-testing extremal qubit POVMs (which feature either three or four outcomes), and (ii) certify that an uncharacterised qubit measurement is non-projective, or even a genuine four-outcome POVM. Our methods are robust to noise and thus applicable in practice, as we demonstrate in a photonic experiment. Specifically, we show that our experimental data implies that the implemented measurements are very close to certain ideal three and four outcome qubit POVMs, and hence non-projective. In the latter case, the data certifies a genuine four-outcome qubit POVM. Our results open interesting perspective for strong `black-box' certification of quantum devices.

quant-ph↗

Enabling computation of correlation bounds for finite-dimensional quantum systems via symmetrisation

We present a technique for reducing the computational requirements by several orders of magnitude in the evaluation of semidefinite relaxations for bounding the set of quantum correlations arising from finite-dimensional Hilbert spaces. The technique, which we make publicly available through a user-friendly software package, relies on the exploitation of symmetries present in the optimisation problem to reduce the number of variables and the block sizes in semidefinite relaxations. It is widely applicable in problems encountered in quantum information theory and enables computations that were previously too demanding. We demonstrate its advantages and general applicability in several physical problems. In particular, we use it to robustly certify the non-projectiveness of high-dimensional measurements in a black-box scenario based on self-tests of $d$-dimensional symmetric informationally complete POVMs.

quant-ph↗

Self-testing quantum states and measurements in the prepare-and-measure scenario

The goal of self-testing is to characterize an a priori unknown quantum system based solely on measurement statistics, i.e. using an uncharacterized measurement device. Here we develop self-testing methods for quantum prepare-and-measure experiments, thus not necessarily relying on entanglement and/or violation of a Bell inequality. We present noise-robust techniques for self-testing sets of quantum states and measurements, assuming an upper bound on the Hilbert space dimension. We discuss in detail the case of a $2 \rightarrow 1$ random access code with qubits, for which we provide analytically optimal self-tests. The simplicity and noise robustness of our methods should make them directly applicable to experiments.

quant-ph↗

High-dimensional quantum communication complexity beyond strategies based on Bell's theorem

Quantum resources can improve communication complexity problems (CCPs) beyond their classical constraints. One quantum approach is to share entanglement and create correlations violating a Bell inequality, which can then assist classical communication. A second approach is to resort solely to the preparation, transmission and measurement of a single quantum system; in other words quantum communication. Here, we show the advantages of the latter over the former in high-dimensional Hilbert space. We focus on a family of CCPs, based on facet Bell inequalities, study the advantage of high-dimensional quantum communication, and realise such quantum communication strategies using up to ten-dimensional systems. The experiment demonstrates, for growing dimension, an increasing advantage over quantum strategies based on Bell inequality violation. For sufficiently high dimensions, quantum communication also surpasses the limitations of the post-quantum Bell correlations obeying only locality in the macroscopic limit. Surprisingly, we find that the advantages are tied to the use of measurements that are not rank-one projective. We provide an experimental semi-device-independent falsification of such measurements in Hilbert space dimension six.

quant-ph↗

Heralded generation of maximal entanglement in any dimension via incoherent coupling to thermal baths

We present a scheme for dissipatively generating maximal entanglement in a heralded manner. Our setup requires incoherent interactions with two thermal baths at different temperatures, but no source of work or control. A pair of $(d+1)$-dimensional quantum systems is first driven to an entangled steady state by the temperature gradient, and maximal entanglement in dimension $d$ can then be heralded via local filters. We discuss experimental prospects considering an implementation in superconducting systems.

quant-ph↗

Semi-device-independent characterisation of multipartite entangled states and measurements

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 characterisation of multipartite entanglement based around a game played by several isolated parties whose devices are uncharacterised beyond an assumption about the dimension of their Hilbert spaces. Our scheme can certify that an $n$-partite high-dimensional quantum state features genuine multipartite entanglement. Moreover, the scheme can certify that a joint measurement on $n$ subsystems is entangled, and 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 for the certification of many entangled states admitting a local model, which therefore cannot violate any Bell inequality.

quant-ph↗

Quantum predictions for an unmeasured system cannot be simulated with a finite-memory classical system

We consider an ideal experiment in which unlimited nonprojective quantum measurements are sequentially performed on a system that is initially entangled with a distant one. At each step of the sequence, the measurements are randomly chosen between two. However, regardless of which measurement is chosen or which outcome is obtained, the quantum state of the pair always remains entangled. We show that the classical simulation of the reduced state of the distant system requires not only unlimited rounds of communication, but also that the distant system has infinite memory. Otherwise, a thermodynamical argument predicts heating at a distance. Our proposal can be used for experimentally ruling out nonlocal finite-memory classical models of quantum theory.

quant-ph↗

Communication games reveal preparation contextuality

A communication game consists of distributed parties attempting to jointly complete a task with restricted communication. Such games are useful tools for studying limitations of physical theories. A theory exhibits preparation contextuality whenever its predictions cannot be explained by a preparation noncontextual model. Here, we show that communication games performed in operational theories reveal the preparation contextuality of that theory. For statistics obtained in a particular family of communication games, we show a direct correspondance with correlations in space-like separated events obeying the no-signaling principle. Using this, we prove that all mixed quantum states of any finite dimension are preparation contextual. We report on an experimental realization of a communication game involving three-level quantum systems from which we observe a strong violation of the constraints of preparation noncontextuality.

quant-ph↗

Quantum communication games manifest preparation contextuality

Communication games are collaborative information processing tasks involving a number of players with limited communication. Such games are useful tools for studying physical theories. A physical theory exhibits preparation contextuality whenever observed behaviour cannot be explained by a preparation noncontextual model. Here we show that there is a fundamental connection between the performance in communication games and the degree of preparation (non)contextuality. For this purpose, we present a general framework that allows us to construct communication games such that the game performance corresponds to a measure of preparation (non)contextuality. We illustrate the power of this framework by, 1) deriving many examples of tests of preparation contextuality, 2) showing that quantum violations of Bell inequalities can be derived from quantum violations of preparation noncontextuality, 3) qualitatively and quantitatively explaining related previous results on preparation contextuality in quantum communication games, and 4) solving the open problem of revealing the preparation contextuality of the maximally mixed quantum state in any dimension.

quant-ph↗

Correlations in star networks: from Bell inequalities to network inequalities

The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several independent sources, each distributing a physical system to a subset of observers. In the quantum setting, the observers can perform joint measurements on initially independent systems, which may lead to strong correlations across the whole network. In this work, we introduce a technique to systematically map a Bell inequality to a family of Bell-type inequalities bounding classical correlations on networks in a star-configuration. Also, we show that whenever a given Bell inequality can be violated by some entangled state $ρ$, then all the corresponding network inequalities can be violated by considering many copies of $ρ$ distributed in the star network. The relevance of these ideas is illustrated by applying our method to a specific multi-setting Bell inequality. We derive the corresponding network inequalities, and study their quantum violations.

quant-ph↗

All entangled pure quantum states violate the bilocality inequality

The nature of quantum correlations in networks featuring independent sources of entanglement remains poorly understood. Here, focusing on the simplest network of entanglement swapping, we start a systematic characterization of the set of quantum states leading to violation of the so-called "bilocality" inequality. First, we show that all possible pairs of entangled pure states can violate the inequality. Next, we derive a general criterion for violation for arbitrary pairs of mixed two-qubit states. Notably, this reveals a strong connection between the CHSH Bell inequality and the bilocality inequality, namely that any entangled state violating CHSH also violates the bilocality inequality. We conclude with a list of open questions.

quant-ph↗

The Magical Number Seven: An Unexpected Dimensional Threshold in Quantum Communication Complexity

Entanglement-assisted classical communication and transmission of a quantum system are the two quantum resources for information processing. Many information tasks can be performed using either quantum resource. However, this equivalence is not always present since entanglement assisted classical communication is known to sometimes be the better performing resource. Here, we show not only the opposite phenomenon; that there exists tasks for which transmission of a quantum system is a more powerful resource than entanglement assisted classical communication, but also that such phenomena can have a surprisingly strong dependence on the dimension of Hilbert space. We introduce a family of communication complexity problems parametrized by dimension of Hilbert space and study the performance of each quantum resource. We find that for low dimensions, the two resources perform equally well, whereas for dimension seven and above, the equivalence is suddenly broken and transmission of a quantum system becomes more powerful than entanglement assisted classical communication. Moreover, we find that transmission of a quantum system may even outperform classical communication assisted by the stronger-than-quantum correlations obtained from the principle of Macroscopic Locality.

quant-ph↗

Higher dimensional communication complexity problems: classical protocols vs quantum ones based on Bell's Theorem or prepare-transmit-measure schemes

Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that broad classes of Bell inequalities can be mapped to CCPs and that a quantum violation of a Bell inequality is a necessary and sufficient condition for an enhancement of the related CCP beyond its classical limitation. However, one can implement CCPs by transmitting a quantum system, encoding no more information than is allowed in the CCP, and extract information by performing measurements. We show that for a large class of Bell inequalities, the improvement of the CCP associated to a quantum violation of a Bell inequality can be no greater than the improvement obtained from quantum prepare-transmit-measure strategies.

quant-ph↗

Experimental Quantum Multiparty Communication Protocols

Quantum information science breaks limitations of conventional information transfer, cryptography and computation by using quantum superpositions or entanglement as resources for information processing. Here, we report on the experimental realization of three-party quantum communication protocols using single three-level quantum system (qutrit) communication: secret sharing, detectable Byzantine agreement, and communication complexity reduction for a three-valued function. We have implemented these three schemes using the same optical fiber interferometric setup. Our realization is easily scalable without sacrificing detection efficiency or generating extremely complex many-particle entangled states.

quant-ph↗

Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing

Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the postprocessing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today's computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.

quant-ph↗

Spatial versus Sequential Correlations for Random Access Coding

Random access codes are important for a wide range of applications in quantum information. However, their implementation with quantum theory can be made in two very different ways: (i) by distributing data with strong spatial correlations violating a Bell inequality, or (ii) using quantum communication channels to create stronger-than-classical sequential correlations between state preparation and measurement outcome. Here, we study this duality of the quantum realization. We present a family of Bell inequalities tailored to the task at hand and study their quantum violations. Remarkably, we show that the use of spatial and sequential quantum correlations imposes different limitations on the performance of quantum random access codes. We also show that there exist random access codes for which spatial quantum correlations offer no gain over classical strategies, whereas sequential quantum correlations can yield an advantage. We discuss the physics behind the observed discrepancy between spatial and sequential quantum correlations.

quant-ph↗