Parts of quantum states
- 18 January 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (1) , 012324
Abstract
It is shown that generic -party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all -party pure states is in the set of reduced states of just over half the parties. For even, the reduced states in fewer than parties are shown to be an insufficient description of almost all states (similar results hold when is odd). It is noted that real algebraic geometry is a natural framework for any analysis of parts of quantum states: two simple polynomials, a quadratic and a cubic, contain all of their structure. Algorithmic techniques are described which can provide conditions for sets of reduced states to belong to pure or mixed states.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- One-Qubit Reduced States of a Pure Many-Qubit State: Polygon InequalitiesPhysical Review Letters, 2003
- The Parts Determine the Whole in a Generic Pure Quantum StatePhysical Review Letters, 2002
- Real Solving for Positive Dimensional SystemsJournal of Symbolic Computation, 2002
- Almost Every Pure State of Three Qubits Is Completely Determined by Its Two-Particle Reduced Density MatricesPhysical Review Letters, 2002
- Exact and asymptotic measures of multipartite pure-state entanglementPhysical Review A, 2000
- Complexity and Real Computation1998
- On the combinatorial and algebraic complexity of quantifier eliminationJournal of the ACM, 1996
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Partial Cylindrical Algebraic Decomposition for quantifier eliminationJournal of Symbolic Computation, 1991
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989