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

Cambridge University Press eBooks

Density operators

Benjamin W. Schumacher, Michael D. Westmoreland

Published Mar 25, 2010• 0 citations
Publisher

Abstract

We cannot always assign a definite state vector |ψ〉 to a quantum system Q. It may be that Q is part of a composite system RQ that is in an entangled state |Ψ(RQ)〉. Or it may be that our knowledge of the preparation of Q is insufficient to determine a particular state |ψ〉. Consider, for instance, a qubit sent from Alice to Bob during the BB84 key distribution protocol from Section 4.4. The state of this qubit could be |0〉, |1〉, |+〉 or |−〉, each with equal likelihood. In either case – whether Q is a subsystem of an entangled system, or the state of Q is determined by a probabilistic process – we cannot specify a quantum state vector |ψ〉 for Q.

DOI
10.1017/cbo9780511814006.009

Related papers

The Density Matrix Formalism

Bernard d’Espagnat

In quantum physics, we often need to consider ensembles that are not pure cases, that is, that cannot be described by state vectors. This is so, for instance, when an ensemble is composed of several subensembles that are described by nonequivalent state vectors. It also happens in most cases in which we consider ensembles of definite subsystems of some larger systems. The density matrix—or "statistical operator"—formalism is one that makes it possible to deal with such situations swiftly and efficiently. The rules apply only to ensembles that can be described by state vectors. These rules entail as consequences new expressions for quantum probabilities and mean values, which can be called the—derived— "statistical operator rules." However, it is also possible to formulate the statistical operator rules directly instead. The Heisenberg "uncertainty" relations imply that in general f(x,p) cannot be interpreted as really being a joint probability distribution.

CRC Press eBooks•May 4, 2018•1 citation

Entangled States are Typically Incomparable

Vishesh Jain, Matthew Kwan, Marcus Michelen

Abstract Consider a bipartite quantum system, where Alice and Bob jointly possess a pure state $$|\psi \rangle $$ | ψ ⟩ . Using local quantum operations on their respective subsystems, and unlimited classical communication, Alice and Bob may be able to transform $$|\psi \rangle $$ | ψ ⟩ into another state $$|\phi \rangle $$ | ϕ ⟩ . Famously, Nielsen’s theorem [28] provides a necessary and sufficient algebraic criterion for such a transformation to be possible (namely, the entanglement spectrum of $$|\phi \rangle $$ | ϕ ⟩ should majorise the entanglement spectrum of $$|\psi \rangle $$ | ψ ⟩ ). In the paper where Nielsen proved this theorem, he conjectured that in the limit of large dimensionality, for almost all pairs of states $$|\psi \rangle , |\phi \rangle $$ | ψ ⟩ , | ϕ ⟩ (according to the natural unitary invariant measure) such a transformation is not possible. That is to say, typical pairs of quantum states $$|\psi \rangle , |\phi \rangle $$ | ψ ⟩ , | ϕ ⟩ are entangled in fundamentally different ways, that cannot be converted to each other via local operations and classical communication. Via Nielsen’s theorem, this conjecture can be equivalently stated as a conjecture about majorisation of spectra of random matrices from the so-called trace-normalised complex Wishart–Laguerre ensemble . Concretely, let X and Y be independent $$n \times m$$ n × m random matrices whose entries are i.i.d. standard complex Gaussians; then Nielsen’s conjecture says that the probability that the spectrum of $$X X^\dagger / \operatorname {tr}(X X^\dagger )$$ X X † / tr ( X X † ) majorises the spectrum of $$Y Y^\dagger / \operatorname {tr}(Y Y^\dagger )$$ Y Y † / tr ( Y Y † ) tends to zero as both n and m grow large. We prove this conjecture, and we also confirm some related predictions of Cunden et al. [12].

arXiv:2406.03335•Communications in Mathematical Physics•Aug 28, 2026•2 citations

Security and performance analyses of quantum-key-distribution systems

Chi‐Hang Fred Fung

Quantum cryptography, or, more precisely, quantum key distribution (QKD) allows two distant parties, Alice and Bob, to expand a previously shared secret key by sending quantum states through a quantum channel. The goal here is for Alice and Bob to communicate securely in the presence of an eavesdropper, Eve. The most well-known QKD protocol is the Bennett-Brassard 1984 (BB84) protocol, which has been proved unconditionally secure against any attacks allowed by quantum mechanics. The main advantage of QKD over conventional cryptography is its absolute security. Thus, it is imperative to evaluate the security and performance of QKD protocols and realistic QKD systems. In this thesis, we study the security and performance aspects of QKD in four parts. In the first part, we study the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. This protocol differs from the BB84 protocol only in the classical post-processing step and uses the same four quantum states as the BB84 protocol. We compared these two protocols and showed that in typical situations, the classical post-processing software for BB84 should be used in order to have a higher performance. In the second part, we prove the security of a three-state protocol. This protocol is similar to the BB84 protocol in that they share the same three qubit states. In the third part, we consider a practical Trojan horse attack on practical QKD systems implementing the BB84 protocol. The attack works by taking advantage of the finite response time of practical phase modulators to remap the states sent out by the legitimate user, Alice. We showed that if Alice and Bob are unaware of our attack, the final key shared between them can be compromised in some situations. In the fourth part, we consider another type of Trojan horse attack, which is based on mismatch between detection efficiencies of detectors. Practical detectors in QKD systems usually do not have identical efficiencies and an eavesdropper Eve may be able to exploit this efficiency mismatch to steal information about the final secret key. We analyze the security of the attack and show that it is possible for Eve to acquire some information on the final secret key if Alice and Bob are unaware of this attack.

•Jan 1, 2008•0 citations

Density Matrices and Their Uses

Eduardo R. Mucciolo

So far we have dealt with quantum systems in a well-defined state, namely, systems that can be fully described by a single state vector https://www.w3.org/1998/Math/MathML" display="inline"> | ψ ⟩ . Such states are called pure . Here we will learn how to describe situations where knowing the state vector is not enough because the system is under the influence of another, typically larger, system which we know little about. This kind of interaction degrades the “quantumness” of the system we are interested to describe. The mathematics used to described this phenomenon is also suitable for establishing the degree of entanglement present in a quantum system, being it in a pure state or not.

CRC Press eBooks•Aug 6, 2025•0 citations

Entanglement

Stephen Mark Barnett

We have seen, in Section 2.5, how the superposition principle leads to the existence of entangled states of two or more quantum systems. Such states are characterized by the existence of correlations between the systems, the form of which cannot be satisfactorily accounted for by any classical theory. These have played a central role in the development of quantum theory since early in its development, starting with the famous paradox or dilemma of Einstein, Podolsky, and Rosen (EPR). No less disturbing than the EPR dilemma is the problem of Schrödinger’s cat, an example of the apparent absurdity of following entanglement into the macroscopic world. It was Schrödinger who gave us the name entanglement; he emphasized its fundamental significance when he wrote, ‘I would call this not one but the characteristic trait of quantum mechanics, the one that enforces the entire departure from classical thought’. The EPR dilemma represents a profound challenge to classical reasoning in that it seems to present a conflict between the ideas of the reality of physical properties and the locality imposed by the finite velocity of light. This challenge and the developments that followed have served to refine the concept of entanglement and will be described in the first section of this chapter. We start by recalling that a state of two quantum systems is entangled if its density operator cannot be written as a product of density operators for the two systems, or as a probability-weighted sum of such products. For pure states, the condition for entanglement can be stated more simply: a pure state of two quantum systems is not entangled only if the state vector can be written as a product of state vectors for the two systems. In the discipline of quantum information, entanglement is viewed as a resource to be exploited. We shall find, both here and in the subsequent chapters, that our subject owes much of its distinctive flavour to the utilization of entanglement.

Oxford University Press eBooks•May 28, 2009•0 citations

Restricted numerical shadow and the geometry of quantum entanglement

Zbigniew Puchała, Jarosław Adam Miszczak, Piotr Gawron +3 more

The restricted numerical range W R ( A ) of an operator A acting on a D -dimensional Hilbert space is defined as a set of all possible expectation values of this operator among pure states which belong to a certain subset R of the set of pure quantum states of dimension D . One considers for instance the set of real states, or in the case of composite spaces, the set of product states and the set of maximally entangled states. Combining the operator theory with a probabilistic approach we introduce the restricted numerical shadow of A —a normalized probability distribution on the complex plane supported in W R ( A ). Its value at point is equal to the probability that the expectation value 〈ψ| A |ψ〉 is equal to z , where |ψ〉 represents a random quantum state in subset R distributed according to the natural measure on this set, induced by the unitarily invariant Fubini–Study measure. Studying restricted shadows of operators of a fixed size D = N A N B we analyse the geometry of sets of separable and maximally entangled states of the N A × N B composite quantum system. Investigating trajectories formed by evolving quantum states projected into the plane of the shadow, we study the dynamics of quantum entanglement. A similar analysis extended for operators on D = 2 3 -dimensional Hilbert space allows us to investigate the structure of the orbits of GHZ and W quantum states of a three-qubit system.

arXiv:1201.2524•Journal of Physics A Mathematical and Theoretical•Oct 2, 2012•20 citations
We cannot always assign a definite state vector |ψ〉 to a quantum system Q. It may be that Q is part of a composite system RQ that is in an entangled state |Ψ(RQ)〉. Or it may be that our knowledge of the preparation of Q is insufficient to determine a particular state |ψ〉. Consider, for instance, a qubit sent from Alice to Bob during the BB84 key distribution protocol from Section 4.4. The state of this qubit could be |0〉, |1〉, |+〉 or |−〉, each with equal likelihood. In either case – whether Q is a subsystem of an entangled system, or the state of Q is determined by a probabilistic process – we cannot specify a quantum state vector |ψ〉 for Q.
In quantum physics, we often need to consider ensembles that are not pure cases, that is, that cannot be described by state vectors. This is so, for instance, when an ensemble is composed of several subensembles that are described by nonequivalent state vectors. It also happens in most cases in which we consider ensembles of definite subsystems of some larger systems. The density matrix—or "statistical operator"—formalism is one that makes it possible to deal with such situations swiftly and efficiently. The rules apply only to ensembles that can be described by state vectors. These rules entail as consequences new expressions for quantum probabilities and mean values, which can be called the—derived— "statistical operator rules." However, it is also possible to formulate the statistical operator rules directly instead. The Heisenberg "uncertainty" relations imply that in general f(x,p) cannot be interpreted as really being a joint probability distribution.
Abstract Consider a bipartite quantum system, where Alice and Bob jointly possess a pure state ∣ψ⟩|\psi \rangle ∣ψ⟩ | ψ ⟩ . Using local quantum operations on their respective subsystems, and unlimited classical communication, Alice and Bob may be able to transform ∣ψ⟩|\psi \rangle ∣ψ⟩ | ψ ⟩ into another state ∣ϕ⟩|\phi \rangle ∣ϕ⟩ | ϕ ⟩ . Famously, Nielsen’s theorem [28] provides a necessary and sufficient algebraic criterion for such a transformation to be possible (namely, the entanglement spectrum of ∣ϕ⟩|\phi \rangle ∣ϕ⟩ | ϕ ⟩ should majorise the entanglement spectrum of ∣ψ⟩|\psi \rangle ∣ψ⟩ | ψ ⟩ ). In the paper where Nielsen proved this theorem, he conjectured that in the limit of large dimensionality, for almost all pairs of states ∣ψ⟩,∣ϕ⟩|\psi \rangle , |\phi \rangle ∣ψ⟩,∣ϕ⟩ | ψ ⟩ , | ϕ ⟩ (according to the natural unitary invariant measure) such a transformation is not possible. That is to say, typical pairs of quantum states ∣ψ⟩,∣ϕ⟩|\psi \rangle , |\phi \rangle ∣ψ⟩,∣ϕ⟩ | ψ ⟩ , | ϕ ⟩ are entangled in fundamentally different ways, that cannot be converted to each other via local operations and classical communication. Via Nielsen’s theorem, this conjecture can be equivalently stated as a conjecture about majorisation of spectra of random matrices from the so-called trace-normalised complex Wishart–Laguerre ensemble . Concretely, let X and Y be independent n×mn \times mn×m n × m random matrices whose entries are i.i.d. standard complex Gaussians; then Nielsen’s conjecture says that the probability that the spectrum of XX†/tr⁡(XX†)X X^\dagger / \operatorname {tr}(X X^\dagger )XX†/tr(XX†) X X † / tr ( X X † ) majorises the spectrum of YY†/tr⁡(YY†)Y Y^\dagger / \operatorname {tr}(Y Y^\dagger )YY†/tr(YY†) Y Y † / tr ( Y Y † ) tends to zero as both n and m grow large. We prove this conjecture, and we also confirm some related predictions of Cunden et al. [12].
Quantum cryptography, or, more precisely, quantum key distribution (QKD) allows two distant parties, Alice and Bob, to expand a previously shared secret key by sending quantum states through a quantum channel. The goal here is for Alice and Bob to communicate securely in the presence of an eavesdropper, Eve. The most well-known QKD protocol is the Bennett-Brassard 1984 (BB84) protocol, which has been proved unconditionally secure against any attacks allowed by quantum mechanics. The main advantage of QKD over conventional cryptography is its absolute security. Thus, it is imperative to evaluate the security and performance of QKD protocols and realistic QKD systems. In this thesis, we study the security and performance aspects of QKD in four parts. In the first part, we study the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. This protocol differs from the BB84 protocol only in the classical post-processing step and uses the same four quantum states as the BB84 protocol. We compared these two protocols and showed that in typical situations, the classical post-processing software for BB84 should be used in order to have a higher performance. In the second part, we prove the security of a three-state protocol. This protocol is similar to the BB84 protocol in that they share the same three qubit states. In the third part, we consider a practical Trojan horse attack on practical QKD systems implementing the BB84 protocol. The attack works by taking advantage of the finite response time of practical phase modulators to remap the states sent out by the legitimate user, Alice. We showed that if Alice and Bob are unaware of our attack, the final key shared between them can be compromised in some situations. In the fourth part, we consider another type of Trojan horse attack, which is based on mismatch between detection efficiencies of detectors. Practical detectors in QKD systems usually do not have identical efficiencies and an eavesdropper Eve may be able to exploit this efficiency mismatch to steal information about the final secret key. We analyze the security of the attack and show that it is possible for Eve to acquire some information on the final secret key if Alice and Bob are unaware of this attack.
So far we have dealt with quantum systems in a well-defined state, namely, systems that can be fully described by a single state vector https://www.w3.org/1998/Math/MathML" display="inline"> | ψ ⟩ . Such states are called pure . Here we will learn how to describe situations where knowing the state vector is not enough because the system is under the influence of another, typically larger, system which we know little about. This kind of interaction degrades the “quantumness” of the system we are interested to describe. The mathematics used to described this phenomenon is also suitable for establishing the degree of entanglement present in a quantum system, being it in a pure state or not.
We have seen, in Section 2.5, how the superposition principle leads to the existence of entangled states of two or more quantum systems. Such states are characterized by the existence of correlations between the systems, the form of which cannot be satisfactorily accounted for by any classical theory. These have played a central role in the development of quantum theory since early in its development, starting with the famous paradox or dilemma of Einstein, Podolsky, and Rosen (EPR). No less disturbing than the EPR dilemma is the problem of Schrödinger’s cat, an example of the apparent absurdity of following entanglement into the macroscopic world. It was Schrödinger who gave us the name entanglement; he emphasized its fundamental significance when he wrote, ‘I would call this not one but the characteristic trait of quantum mechanics, the one that enforces the entire departure from classical thought’. The EPR dilemma represents a profound challenge to classical reasoning in that it seems to present a conflict between the ideas of the reality of physical properties and the locality imposed by the finite velocity of light. This challenge and the developments that followed have served to refine the concept of entanglement and will be described in the first section of this chapter. We start by recalling that a state of two quantum systems is entangled if its density operator cannot be written as a product of density operators for the two systems, or as a probability-weighted sum of such products. For pure states, the condition for entanglement can be stated more simply: a pure state of two quantum systems is not entangled only if the state vector can be written as a product of state vectors for the two systems. In the discipline of quantum information, entanglement is viewed as a resource to be exploited. We shall find, both here and in the subsequent chapters, that our subject owes much of its distinctive flavour to the utilization of entanglement.
The restricted numerical range W R ( A ) of an operator A acting on a D -dimensional Hilbert space is defined as a set of all possible expectation values of this operator among pure states which belong to a certain subset R of the set of pure quantum states of dimension D . One considers for instance the set of real states, or in the case of composite spaces, the set of product states and the set of maximally entangled states. Combining the operator theory with a probabilistic approach we introduce the restricted numerical shadow of A —a normalized probability distribution on the complex plane supported in W R ( A ). Its value at point is equal to the probability that the expectation value 〈ψ| A |ψ〉 is equal to z , where |ψ〉 represents a random quantum state in subset R distributed according to the natural measure on this set, induced by the unitarily invariant Fubini–Study measure. Studying restricted shadows of operators of a fixed size D = N A N B we analyse the geometry of sets of separable and maximally entangled states of the N A × N B composite quantum system. Investigating trajectories formed by evolving quantum states projected into the plane of the shadow, we study the dynamics of quantum entanglement. A similar analysis extended for operators on D = 2 3 -dimensional Hilbert space allows us to investigate the structure of the orbits of GHZ and W quantum states of a three-qubit system.