Peter S. Turner

Unambiguous discrimination of mixed states

We present the conditions under which probabilistic error-free discrimination of mixed states is possible, and provide upper and lower bounds on the maximum probability of success for the case of two mixed states. We solve certain special cases exactly, and demonstrate how the problems of state filtering and state comparison can be recast as problems of mixed state unambiguous discrimination.

Spherical harmonics and basic coupling coefficients for the group SO(5) in an SO(3) basis

An easily programmable algorithm is given for the computation of SO(5) spherical harmonics needed to complement the radial (beta) wave functions to form an orthonormal basis of wave functions for the five-dimensional harmonic oscillator. It is shown how these functions can be used to compute the (Clebsch–Gordan a.k.a. Wigner) coupling coefficients for combining pairs of irreps in this space to other irreps. This is of particular value for the construction of the matrices of Hamiltonians and transition operators that arise in applications of nuclear collective models. Tables of the most useful coupling coefficients are given in the Appendix.

Degradation of a quantum reference frame

We investigate the degradation of reference frames (RFs), treated as dynamical quantum systems, and quantify their longevity as a resource for performing tasks in quantum information processing. We adopt an operational measure of an RFs longevity, namely, the number of measurements that can be made against it with a certain error tolerance. We investigate two distinct types of RF: a reference direction, realized by a spin-j system, and a phase reference, realized by an oscillator mode with bounded energy. For both cases, we show that our measure of longevity increases quadratically with the size of the reference system and is therefore non-additive. For instance, the number of measurements for which a directional RF consisting of N parallel spins can be put to use scales as N2. Our results quantify the extent to which microscopic or mesoscopic RFs may be used for repeated, high-precision measurements, without needing to be reset—a question that is important for some implementations of quantum computing. We illustrate our results using the proposed single-spin measurement scheme of magnetic resonance force microscopy.

Entanglement cost of implementing controlled-unitary operations.

We investigate the minimum entanglement cost of the deterministic implementation of two-qubit controlled-unitary operations using local operations and classical communication (LOCC). We show that any such operation can be implemented by a three-turn LOCC protocol, which requires at least 1 ebit of entanglement when the resource is given by a bipartite entangled state with Schmidt number 2. Our result implies that there is a gap between the minimum entanglement cost and the entangling power of controlled-unitary operations. This gap arises due to the requirement of implementing the operations while oblivious to the identity of the inputs.

Quantum communication using a bounded-size quantum reference frame

Typical quantum communication schemes are such that to achieve perfect decoding the receiver must share a reference frame (RF) with the sender. Indeed, if the receiver only possesses a bounded-size quantum token of the senders RF, then the decoding is imperfect, and we can describe this effect as a noisy quantum channel. We seek here to characterize the performance of such schemes, or equivalently, to determine the effective decoherence induced by having a bounded-size RF. We assume that the token is prepared in a special state that has particularly nice group-theoretic properties and that is near-optimal for transmitting information about the senders frame. We present a decoding operation, which can be proven to be near-optimal in this case, and we demonstrate that there are two distinct ways of implementing it (corresponding to two distinct Kraus decompositions). In one, the receiver measures the orientation of the RF token and reorients the system appropriately. In the other, the receiver extracts the encoded information from the virtual subsystems that describe the relational degrees of freedom of the system and token. Finally, we provide explicit characterizations of these decoding schemes when the system is a single qubit and for three standard kinds of RF: a phase reference, a Cartesian frame (representing an orthogonal triad of spatial directions), and a reference direction (representing a single spatial direction).

Which Graph States are Useful for Quantum Information Processing

Graph statesa[ 5 ] are an elegant and powerful quantum resource for measurement based quantum computation (MBQC). They are also used for many quantum protocols (error correction, secret sharing, etc.). The main focus of this paper is to provide a structural characterisation of the graph states that can be used for quantum information processing. The existence of a gflow (generalized flow) [ 8 ] is known to be a requirement for open graphs (graph, input set and output set) to perform uniformly and strongly deterministic computations. We weaken the gflow conditions to define two new more general kinds of MBQC: uniform equiprobability and constant probability. These classes can be useful from a cryptographic and information point of view because even though we cannot do a deterministic computation in general we can preserve the information and transfer it perfectly from the inputs to the outputs. We derive simple graph characterisations for these classes and prove that the deterministic and uniform equiprobability classes collapse when the cardinalities of inputs and outputs are the same. We also prove the reversibility of gflow in that case. The new graphical characterisations allow us to go from open graphs to graphs in general and to consider this question: given a graph with no inputs or outputs fixed, which vertices can be chosen as input and output for quantum information processing? We present a characterisation of the sets of possible inputs and ouputs for the equiprobability class, which is also valid for deterministic computations with inputs and ouputs of the same cardinality.

Vector coherent state theory of the generic representations of so(5) in an so(3) basis

For applications of group theory in quantum mechanics, one generally needs explicit matrix representations of the spectrum generating algebras that arise in bases that reduce the symmetry group of some Hamiltonian of interest. Here we use vector coherent state techniques to develop an algorithm for constructing the matrices for arbitrary finite-dimensional irreps of the SO(5) Lie algebra in an SO(3) basis. The SO(3) subgroup of SO(5) is defined by regarding SO(5) as linear transformations of the five-dimensional space of an SO(3) irrep of angular momentum two. A need for such irreps arises in the nuclear collective model of quadrupole vibrations and rotations. The algorithm has been implemented in MAPLE, and some tables of results are presented.

Quantum Data Compression of a Qubit Ensemble

Data compression is a ubiquitous aspect of modern information technology, and the advent of quantum information raises the question of what types of compression are feasible for quantum data, where it is especially relevant given the extreme difficulty involved in creating reliable quantum memories. We present a protocol in which an ensemble of quantum bits (qubits) can in principle be perfectly compressed into exponentially fewer qubits. We then experimentally implement our algorithm, compressing three photonic qubits into two. This protocol sheds light on the subtle differences between quantum and classical information. Furthermore, since data compression stores all of the available information about the quantum state in fewer physical qubits, it could allow for a vast reduction in the amount of quantum memory required to store a quantum ensemble, making even todays limited quantum memories far more powerful than previously recognized.

Quantum computation over the butterfly network

In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider deterministically performing a two-qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource setting introduced by M. Hayashi [Phys. Rev. A 76, 040301(R) (2007)], which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the two input nodes, we show that unitary operations can be performed without adding any entanglement resource, if and only if the unitary operations are locally unitary equivalent to controlled unitary operations. Our protocol is optimal in the sense that the unitary operations cannot be implemented if we relax the specifications of any of the channels. We also construct protocols for performing controlled traceless unitary operations with a 1-ebit resource and for performing global Clifford operations with a 2-ebit resource.

Adaptive experimental design for one-qubit state estimation with finite data based on a statistical update criterion

We consider 1-qubit mixed quantum state estimation by adaptively updating measurements according to previously obtained outcomes and measurement settings. Updates are determined by the average-variance-optimality (A-optimality) criterion, known in the classical theory of experimental design and applied here to quantum state estimation. In general, A-optimization is a nonlinear minimization problem; however, we find an analytic solution for 1-qubit state estimation using projective measurements, reducing computational effort. We compare numerically two adaptive and two nonadaptive schemes for finite data sets and show that the A-optimality criterion gives more precise estimates than standard quantum tomography.