State determination: an iterative algorithm

Abstract

An iterative algorithm for state determination is presented that uses as physical input the probability distributions for the eigenvalues of two or more observables in an unknown state $\Phi$. Starting form an arbitrary state ${\Psi }_0$, a succession of states ${\Psi }_n$ is obtained that converges to $\Phi$ or to a Pauli partner. This algorithm for state reconstruction is efficient and robust as is seen in the numerical tests presented and is a useful tool not only for state determination but also for the study of Pauli partners. Its main ingredient is the Physical Imposition Operator that changes any state to have the same physical properties, with respect to an observable, of another state.

11 pages 3 figures

References in corpus (6)

• A new proof for the existence of mutually unbiased bases
• Fundamentals of Quantum Information Theory
• Wootters' distance revisited: a new distinguishability criterium
• Reconstructing a pure state of a spin s through three Stern-Gerlach measurements
• Quantum mechanics in finite dimensional Hilbert space
• Quantum diffusion on a cyclic one dimensional lattice

Cited by in corpus (6)

• Mutually unbiased triplets from non-affine families of complex Hadamard matrices in dimension six
• Ptychography of pure quantum states
• Ptychographic reconstruction of pure quantum states
• Quantum tomography meets dynamical systems and bifurcations theory
• Quantum state reconstruction from dynamical systems theory
• On position, momentum and their correlation