On the Optimal Choice of Spin-Squeezed States for Detecting and Characterizing a Quantum Process

Quantum metrology uses quantum states with no classical counterpart to measure a physical quantity with extraordinary sensitivity or precision. Most metrology schemes measure a single parameter of a dynamical process by probing it with a specially designed quantum state. The success of such a scheme usually relies on the process belonging to a particular one-parameter family. If this assumption is violated, or if the goal is to measure more than one parameter, a different quantum state may perform better. In the most extreme case, we know nothing about the process and wish to learn everything. This requires quantum process tomography, which demands an informationally-complete set of probe states. It is very convenient if this set is group-covariant -- i.e., each element is generated by applying an element of the quantum system's natural symmetry group to a single fixed fiducial state. In this paper, we consider metrology with 2-photon ("biphoton") states, and report experimental studies of different states' sensitivity to small, unknown collective SU(2) rotations ("SU(2) jitter"). Maximally entangled N00N states are the most sensitive detectors of such a rotation, yet they are also among the worst at fully characterizing an a-priori unknown process. We identify (and confirm experimentally) the best SU(2)-covariant set for process tomography; these states are all less entangled than the N00N state, and are characterized by the fact that they form a 2-design.Comment: 10 pages, 5 figure

Quantum picturalism for topological cluster-state computing

Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of computing is a leading candidate for large-scale quantum computing. However, there has been a lack of sufficiently powerful high-level languages to describe computing in this form without resorting to single-qubit operations, which quickly become prohibitively complex as the system size increases. In this paper we apply the category-theoretic work of Abramsky and Coecke to the topological cluster-state model of quantum computing to give a high-level graphical language that enables direct translation between quantum processes and physical patterns of measurement in a computer - a "compiler language". We give the equivalence between the graphical and topological information flows, and show the applicable rewrite algebra for this computing model. We show that this gives us a native graphical language for the design and analysis of topological quantum algorithms, and finish by discussing the possibilities for automating this process on a large scale.Comment: 18 pages, 21 figures. Published in New J. Phys. special issue on topological quantum computin

Local observers on linear Lie groups with linear estimation error dynamics

This paper proposes local exponential observers for systems on linear Lie groups. We study two different classes of systems. In the first class, the full state of the system evolves on a linear Lie group and is available for measurement. In the second class, only part of the system's state evolves on a linear Lie group and this portion of the state is available for measurement. In each case, we propose two different observer designs. We show that, depending on the observer chosen, local exponential stability of one of the two observation error dynamics, left- or right-invariant error dynamics, is obtained. For the first class of systems these results are developed by showing that the estimation error dynamics are differentially equivalent to a stable linear differential equation on a vector space. For the second class of system, the estimation error dynamics are almost linear. We illustrate these observer designs on an attitude estimation problem

Kochen-Specker Vectors

We give a constructive and exhaustive definition of Kochen-Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e., vectors in n-dim Hilbert space, H^n, n>3 to which it is impossible to assign 1s and 0s in such a way that no two mutually orthogonal vectors from the set are both assigned 1 and that not all mutually orthogonal vectors are assigned 0. Our constructive definition of such KS vectors is based on algorithms that generate MMP diagrams corresponding to blocks of orthogonal vectors in R^n, on algorithms that single out those diagrams on which algebraic 0-1 states cannot be defined, and on algorithms that solve nonlinear equations describing the orthogonalities of the vectors by means of statistically polynomially complex interval analysis and self-teaching programs. The algorithms are limited neither by the number of dimensions nor by the number of vectors. To demonstrate the power of the algorithms, all 4-dim KS vector systems containing up to 24 vectors were generated and described, all 3-dim vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found.Comment: 19 pages, 6 figures, title changed, introduction thoroughly rewritten, n-dim rotation of KS vectors defined, original Kochen-Specker 192 (117) vector system translated into MMP diagram notation with a new graphical representation, results on Tkadlec's dual diagrams added, several other new results added, journal version: to be published in J. Phys. A, 38 (2005). Web page: http://m3k.grad.hr/pavici