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:0808.3960 · Physical Review A

Lower bound on the dimension of a quantum system given measured data

Stephanie Wehner, Matthias Christandl, Andrew C. Doherty

Published Dec 22, 2008• 151 citations
arXivHTMLPDF

Abstract

We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement $M$ and preparation $\ensuremath{\rho}$ the experimenter can determine, given enough time, the probability of a given outcome $a$: $p(a\ensuremath{\mid}M,\ensuremath{\rho})$. How large does the Hilbert space of the quantum system have to be in order to allow us to find density matrices and measurement operators that will reproduce the given probability distribution? In this paper, we prove a simple lower bound for the dimension of the Hilbert space. The main insight is to relate this problem to the construction of quantum random access codes, for which interesting bounds on the Hilbert space dimension already exist. We discuss several applications of our result to hidden-variable or ontological models, to Bell inequalities, and to properties of the smooth min-entropy.

DOI
10.1103/physreva.78.062112

Related papers

A general bound for the dimension of quantum behaviours in the prepare-and-measure scenario

Julio I. de Vicente

Abstract The prepare-and-measure scenario offers the possibility to infer the dimension of an unknown physical system in a device-independent way, i.e. using only raw measurement data with apparatuses regarded as black boxes. We provide here a general lower bound on the dimension necessary to observe arbitrary quantum behaviours in this scenario based on simple matrix analysis. This bound holds even if the preparer and measurer share randomness. This is relevant in scenarios where the parties are free to access this resource or it is not safe to assume that the devices are not correlated. We further use this result to bound the success probability of random access codes in general as a function of the dimension of the quantum systems sent from one party to another and we provide constructions of dimension witnesses.

arXiv:1809.02414•Journal of Physics A Mathematical and Theoretical•Jan 11, 2019•10 citations

Inaccessible information in probabilistic models of quantum systems, non-contextuality inequalities and noise thresholds for contextuality

Iman Marvian

Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.

arXiv:2003.05984•Mar 12, 2020•20 citations

Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling

Frédéric Dupuis, Omar Fawzi, Stephanie Wehner

A natural measure for the amount of quantum information that a physical system E holds about another system A = A 1 ,..., A n is given by the min-entropy H min ( A | E ). Specifically, the min-entropy measures the amount of entanglement between E and A , and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system A . Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13]. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Lecture notes in computer science•Jan 1, 2013•4 citations

Entanglement Sampling and Applications

Frédéric Dupuis, Omar Fawzi, Stephanie Wehner

A natural measure for the amount of quantum information that a physical system E holds about another system A = A1, .. . , Anis given by the min-entropy Hmin(A|E). In particular, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behavior of the minentropy after some process M. is applied to the system A. Here, we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest. A simple example of such a process is the one of sampling, where a subset S of the systems A1, ... , An is selected at random. Our tool allows us to quantify the entanglement that E has with the selected systems AS, i.e., Hmin(AS|ES) as a function of the original Hmin(A|E). We give two applications of this result. First, it directly provides the first local quantum-to-classical randomness extractors for use in quantum cryptography, as well as decoupling operations acting on only a small fraction AS of the input A. Moreover, it gives lower bounds on the dimension of k-out-of-n fully quantum random access encodings. Another natural example of such a process is a measurement in, e.g., BB84 bases commonly used in quantum cryptography. We establish the first entropic uncertainty relations with quantum side information that are nontrivial whenever E is not maximally entangled with A. As a consequence, we are able to prove optimality of quantum cryptographic schemes in the noisy-storage model. This model allows for the secure implementation of two-party cryptographic primitives under the assumption that the adversary cannot store quantum information perfectly. A special case is the bounded-quantum-storage model (BQSM), which assumes that the adversary's quantum memory device is noise free but limited in size. Ever since the inception of the BQSM, it has been a vexing open question to determine whether the security is possible as long as the adversary can only.

arXiv:1305.1316•IEEE Transactions on Information Theory•Nov 26, 2014•98 citations

Testing the Dimension of Hilbert Spaces

Nicolas Brunner, Stefano Pironio, Antonio Acín +3 more

Given a set of correlations originating from measurements on a quantum state of unknown Hilbert space dimension, what is the minimal dimension d necessary to describe such correlations? We introduce the concept of dimension witness to put lower bounds on d. This work represents a first step in a broader research program aiming to characterize Hilbert space dimension in various contexts related to fundamental questions and quantum information applications.

arXiv:0802.0760•Physical Review Letters•May 30, 2008•313 citations

Device-independent certification of the Hilbert-space dimension using a family of Bell expressions

A. K. Pan, Shyam Sundar Mahato

A dimension witness provides a device-independent certification of the minimal dimension required to reproduce the observed data without imposing assumptions on the functioning of the devices used to generate the experimental statistics. In this paper, we provide a family of Bell expressions where Alice and Bob perform ${2}^{n\ensuremath{-}1}$ and $n$ number of dichotomic measurements, respectively, which serve as the device-independent dimension witnesses of Hilbert space of ${2}^{m}$ dimensions with $m=1,2,...,{2}^{\ensuremath{\lfloor}n/2\ensuremath{\rfloor}}$. The family of Bell expressions considered here determines the success probability of a communication game known as the $n$-bit parity-oblivious random access code. The parity obliviousness constraint is equivalent to the preparation noncontextuality assumption in an ontological model of an operational theory. For any given $n\ensuremath{\ge}3$, if such a constraint is imposed on the encoding scheme of the random access code, then the local bound of the Bell expression reduces to the preparation noncontextual bound. We provide explicit examples for the $n=4\phantom{\rule{4.pt}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}5$ case to demonstrate that the relevant Bell expressions certify the qubit and two-qubit system, and for the $n=6$ case to demonstrate that the relevant Bell expression certifies the qubit, two-qubit, and three-qubit systems. We further demonstrate the sharing of quantum preparation contextuality by multiple Bobs sequentially to examine whether the number of Bobs sharing the preparation contextuality is dependent on the dimension of the system. We provide explicit examples of $n=5$ and 6 to demonstrate that the number of Bobs sequentially sharing the contextuality remains the same for any of the ${2}^{m}$-dimensional systems.

arXiv:2012.13876•Physical Review A•Nov 24, 2020•31 citations
We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement MMM and preparation \ensuremathρ\ensuremath{\rho}\ensuremathρ the experimenter can determine, given enough time, the probability of a given outcome aaa: p(a\ensuremath∣M,\ensuremathρ)p(a\ensuremath{\mid}M,\ensuremath{\rho})p(a\ensuremath∣M,\ensuremathρ). How large does the Hilbert space of the quantum system have to be in order to allow us to find density matrices and measurement operators that will reproduce the given probability distribution? In this paper, we prove a simple lower bound for the dimension of the Hilbert space. The main insight is to relate this problem to the construction of quantum random access codes, for which interesting bounds on the Hilbert space dimension already exist. We discuss several applications of our result to hidden-variable or ontological models, to Bell inequalities, and to properties of the smooth min-entropy.
Abstract The prepare-and-measure scenario offers the possibility to infer the dimension of an unknown physical system in a device-independent way, i.e. using only raw measurement data with apparatuses regarded as black boxes. We provide here a general lower bound on the dimension necessary to observe arbitrary quantum behaviours in this scenario based on simple matrix analysis. This bound holds even if the preparer and measurer share randomness. This is relevant in scenarios where the parties are free to access this resource or it is not safe to assume that the devices are not correlated. We further use this result to bound the success probability of random access codes in general as a function of the dimension of the quantum systems sent from one party to another and we provide constructions of dimension witnesses.
Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.
A natural measure for the amount of quantum information that a physical system E holds about another system A = A 1 ,..., A n is given by the min-entropy H min ( A | E ). Specifically, the min-entropy measures the amount of entanglement between E and A , and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system A . Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13]. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A natural measure for the amount of quantum information that a physical system E holds about another system A = A1, .. . , Anis given by the min-entropy Hmin(A|E). In particular, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behavior of the minentropy after some process M. is applied to the system A. Here, we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest. A simple example of such a process is the one of sampling, where a subset S of the systems A1, ... , An is selected at random. Our tool allows us to quantify the entanglement that E has with the selected systems AS, i.e., Hmin(AS|ES) as a function of the original Hmin(A|E). We give two applications of this result. First, it directly provides the first local quantum-to-classical randomness extractors for use in quantum cryptography, as well as decoupling operations acting on only a small fraction AS of the input A. Moreover, it gives lower bounds on the dimension of k-out-of-n fully quantum random access encodings. Another natural example of such a process is a measurement in, e.g., BB84 bases commonly used in quantum cryptography. We establish the first entropic uncertainty relations with quantum side information that are nontrivial whenever E is not maximally entangled with A. As a consequence, we are able to prove optimality of quantum cryptographic schemes in the noisy-storage model. This model allows for the secure implementation of two-party cryptographic primitives under the assumption that the adversary cannot store quantum information perfectly. A special case is the bounded-quantum-storage model (BQSM), which assumes that the adversary's quantum memory device is noise free but limited in size. Ever since the inception of the BQSM, it has been a vexing open question to determine whether the security is possible as long as the adversary can only.
A dimension witness provides a device-independent certification of the minimal dimension required to reproduce the observed data without imposing assumptions on the functioning of the devices used to generate the experimental statistics. In this paper, we provide a family of Bell expressions where Alice and Bob perform ${2}^{n\ensuremath{-}1}$ and nnn number of dichotomic measurements, respectively, which serve as the device-independent dimension witnesses of Hilbert space of 2m{2}^{m}2m dimensions with $m=1,2,...,{2}^{\ensuremath{\lfloor}n/2\ensuremath{\rfloor}}$. The family of Bell expressions considered here determines the success probability of a communication game known as the nnn-bit parity-oblivious random access code. The parity obliviousness constraint is equivalent to the preparation noncontextuality assumption in an ontological model of an operational theory. For any given $n\ensuremath{\ge}3$, if such a constraint is imposed on the encoding scheme of the random access code, then the local bound of the Bell expression reduces to the preparation noncontextual bound. We provide explicit examples for the n=4and5n=4\phantom{\rule{4.pt}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}5n=4and5 case to demonstrate that the relevant Bell expressions certify the qubit and two-qubit system, and for the n=6n=6n=6 case to demonstrate that the relevant Bell expression certifies the qubit, two-qubit, and three-qubit systems. We further demonstrate the sharing of quantum preparation contextuality by multiple Bobs sequentially to examine whether the number of Bobs sharing the preparation contextuality is dependent on the dimension of the system. We provide explicit examples of n=5n=5n=5 and 6 to demonstrate that the number of Bobs sequentially sharing the contextuality remains the same for any of the 2m{2}^{m}2m-dimensional systems.