Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors

We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon detectors have efficiency <100% but all other components -- such as single photon sources, beam splitters and phase shifters -- are perfect and introduce no errors. We make use of the fact that the error model induced by the lossy hardware is that of an erasure channel, i.e., the error locations are always known. Using a method based on a Markov chain description of the error correction procedure, our calculations show that, with the 7 qubit CSS quantum code, the gate error threshold for fault tolerant quantum computation is bounded below by a value between 1.78% and 11.5% depending on the construction of the entangling gates.Comment: 7 pages, 6 figure

Comment on "Probabilistic Quantum Memories"

This is a comment on two wrong Phys. Rev. Letters papers by C.A. Trugenberger. Trugenberger claimed that quantum registers could be used as exponentially large "associative" memories. We show that his scheme is no better than one where the quantum register is replaced with a classical one of equal size. We also point out that the Holevo bound and more recent bounds on "quantum random access codes" pretty much rule out powerful memories (for classical information) based on quantum states.Comment: REVTeX4, 1 page, published versio

Group theoretical construction of mutually unbiased bases in Hilbert spaces of prime dimensions

Mutually unbiased bases in Hilbert spaces of finite dimensions are closely related to the quantal notion of complementarity. An alternative proof of existence of a maximal collection of N+1 mutually unbiased bases in Hilbert spaces of prime dimension N is given by exploiting the finite Heisenberg group (also called the Pauli group) and the action of SL(2,Z_N) on finite phase space Z_N x Z_N implemented by unitary operators in the Hilbert space. Crucial for the proof is that, for prime N, Z_N is also a finite field.Comment: 13 pages; accepted in J. Phys. A: Math. Theo

Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds

We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by applying sequences of appropriate local control sequences. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays. Conditions on time optimal simulation are formulated in terms of spectral majorization of matrices characterizing the coupling parameters. Moreover, we consider a specific system of n harmonic oscillators with bilinear interaction. In this case, decoupling can efficiently be achieved using the combinatorial concept of difference schemes. For this type of interactions we present optimal schemes for inversion.Comment: 19 pages, LaTeX2

On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States

We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension $n$ consisting of $n^2$ operators of rank one which have an inner product close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. However, SIC-POVMs are notoriously hard to construct and despite some success of constructing them numerically, there is no analytic construction known. We present two constructions of approximate versions of SIC-POVMs, where a small deviation from uniformity of the inner products is allowed. The first construction is based on selecting vectors from a maximal collection of mutually unbiased bases and works whenever the dimension of the system is a prime power. The second construction is based on perturbing the matrix elements of a subset of mutually unbiased bases. Moreover, we construct vector systems in \C^n which are almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on results of analytic number theory.Comment: 29 pages, LaTe

Affine Constellations Without Mutually Unbiased Counterparts

It has been conjectured that a complete set of mutually unbiased bases in a space of dimension d exists if and only if there is an affine plane of order d. We introduce affine constellations and compare their existence properties with those of mutually unbiased constellations, mostly in dimension six. The observed discrepancies make a deeper relation between the two existence problems unlikely.Comment: 8 page

Mutually unbiased bases: tomography of spin states and star-product scheme

Mutually unbiased bases (MUBs) are considered within the framework of a generic star-product scheme. We rederive that a full set of MUBs is adequate for a spin tomography, i.e. knowledge of all probabilities to find a system in each MUB-state is enough for a state reconstruction. Extending the ideas of the tomographic-probability representation and the star-product scheme to MUB-tomography, dequantizer and quantizer operators for MUB-symbols of spin states and operators are introduced, ordinary and dual star-product kernels are found. Since MUB-projectors are to obey specific rules of the star-product scheme, we reveal the Lie algebraic structure of MUB-projectors and derive new relations on triple- and four-products of MUB-projectors. Example of qubits is considered in detail. MUB-tomography by means of Stern-Gerlach apparatus is discussed.Comment: 11 pages, 1 table, partially presented at the 17th Central European Workshop on Quantum Optics (CEWQO'2010), June 6-11, 2010, St. Andrews, Scotland, U

A complementarity-based approach to phase in finite-dimensional quantum systems

We develop a comprehensive theory of phase for finite-dimensional quantum systems. The only physical requirement we impose is that phase is complementary to amplitude. To implement this complementarity we use the notion of mutually unbiased bases, which exist for dimensions that are powers of a prime. For a d-dimensional system (qudit) we explicitly construct d+1 classes of maximally commuting operators, each one consisting of d-1 operators. One of this class consists of diagonal operators that represent amplitudes (or inversions). By the finite Fourier transform, it is mapped onto ladder operators that can be appropriately interpreted as phase variables. We discuss the examples of qubits and qutrits, and show how these results generalize previous approaches.Comment: 6 pages, no figure

Multicomplementary operators via finite Fourier transform

A complete set of d+1 mutually unbiased bases exists in a Hilbert spaces of dimension d, whenever d is a power of a prime. We discuss a simple construction of d+1 disjoint classes (each one having d-1 commuting operators) such that the corresponding eigenstates form sets of unbiased bases. Such a construction works properly for prime dimension. We investigate an alternative construction in which the real numbers that label the classes are replaced by a finite field having d elements. One of these classes is diagonal, and can be mapped to cyclic operators by means of the finite Fourier transform, which allows one to understand complementarity in a similar way as for the position-momentum pair in standard quantum mechanics. The relevant examples of two and three qubits and two qutrits are discussed in detail.Comment: 15 pages, no figure

Tight informationally complete quantum measurements

We introduce a class of informationally complete positive-operator-valued measures which are, in analogy with a tight frame, "as close as possible" to orthonormal bases for the space of quantum states. These measures are distinguished by an exceptionally simple state-reconstruction formula which allows "painless" quantum state tomography. Complete sets of mutually unbiased bases and symmetric informationally complete positive-operator-valued measures are both members of this class, the latter being the unique minimal rank-one members. Recast as ensembles of pure quantum states, the rank-one members are in fact equivalent to weighted 2-designs in complex projective space. These measures are shown to be optimal for quantum cloning and linear quantum state tomography.Comment: 20 pages. Final versio