Multiphoton entanglement through a Bell multiport beam splitter

Multiphoton entanglement is an important resource for linear optics quantum computing. Here we show that a wide range of highly entangled multiphoton states, including W-states, can be prepared by interfering single photons inside a Bell multiport beam splitter and using postselection. A successful state preparation is indicated by the collection of one photon per output port. An advantage of the Bell multiport beam splitter is that it redirects the photons without changing their inner degrees of freedom. The described setup can therefore be used to generate polarisation, time-bin and frequency multiphoton entanglement, even when using only a single photon source.Comment: 8 pages, 2 figures, carefully revised version, references adde

Minimum-error discrimination between mixed quantum states

We derive a general lower bound on the minimum-error probability for {\it ambiguous discrimination} between arbitrary $m$ mixed quantum states with given prior probabilities. When $m=2$, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out a upper bound on the minimum-error probability for ambiguous discrimination of mixed quantum states. Therefore, some sufficient conditions are obtained for the minimum-error probability attaining this bound. Finally, under the condition of the minimum-error probability attaining this bound, we compare the minimum-error probability for {\it ambiguously} discriminating arbitrary $m$ mixed quantum states with the optimal failure probability for {\it unambiguously} discriminating the same states.Comment: A further revised version, and some results have been adde

The geometric measure of entanglement for a symmetric pure state with positive amplitudes

In this paper for a class of symmetric multiparty pure states we consider a conjecture related to the geometric measure of entanglement: 'for a symmetric pure state, the closest product state in terms of the fidelity can be chosen as a symmetric product state'. We show that this conjecture is true for symmetric pure states whose amplitudes are all non-negative in a computational basis. The more general conjecture is still open.Comment: Similar results have been obtained independently and with different methods by T-C. Wei and S. Severini, see arXiv:0905.0012v

Theory of impedance networks: The two-point impedance and LC resonances

We present a formulation of the determination of the impedance between any two nodes in an impedance network. An impedance network is described by its Laplacian matrix L which has generally complex matrix elements. We show that by solving the equation L u_a = lambda_a u_a^* with orthonormal vectors u_a, the effective impedance between nodes p and q of the network is Z = Sum_a [u_{a,p} - u_{a,q}]^2/lambda_a where the summation is over all lambda_a not identically equal to zero and u_{a,p} is the p-th component of u_a. For networks consisting of inductances (L) and capacitances (C), the formulation leads to the occurrence of resonances at frequencies associated with the vanishing of lambda_a. This curious result suggests the possibility of practical applications to resonant circuits. Our formulation is illustrated by explicit examples.Comment: 21 pages, 3 figures; v4: typesetting corrected; v5: Eq. (63) correcte

Spin-lattice coupling in the ferrimagnetic semiconductor FeCr2S4 probed by surface acoustic waves

Using surface acoustic waves, the elastomagnetic coupling could be studied in thin single crystalline plates of the ferrimagnetic semiconductor FeCr2S4 by measuring the attenuation and the frequency tracking in the temperature range 4.2 K to 200 K. The data clearly display the anomalies found in low-field magnetization measurements.Comment: 15 pages, 3 figures. To appear in J. Appl. Phys., 99 (2006

Heavy Scalar Top Quark Decays in the Complex MSSM: A Full One-Loop Analysis

We evaluate all two-body decay modes of the heavy scalar top quark in the Minimal Supersymmetric Standard Model with complex parameters (cMSSM) and no generation mixing. The evaluation is based on a full one-loop calculation of all decay channels, also including hard QED and QCD radiation. The renormalization of the complex parameters is described in detail. The dependence of the heavy scalar top quark decay on the relevant cMSSM parameters is analyzed numerically, including also the decay to Higgs bosons and another scalar quark or to a top quark and the lightest neutralino. We find sizable contributions to many partial decay widths and branching ratios. They are roughly of O(10%) of the tree-level results, but can go up to 30% or higher. These contributions are important for the correct interpretation of scalar top quark decays at the LHC and, if kinematically allowed, at the ILC. The evaluation of the branching ratios of the heavy scalar top quark will be implemented into the Fortran code FeynHiggs.Comment: 86 pages, 38 figures; minor changes, version published as Phys. Rev. D86 (2012) 03501

Entanglement verification for quantum key distribution systems with an underlying bipartite qubit-mode structure

We consider entanglement detection for quantum key distribution systems that use two signal states and continuous variable measurements. This problem can be formulated as a separability problem in a qubit-mode system. To verify entanglement, we introduce an object that combines the covariance matrix of the mode with the density matrix of the qubit. We derive necessary separability criteria for this scenario. These criteria can be readily evaluated using semidefinite programming and we apply them to the specific quantum key distribution protocol.Comment: 6 pages, 2 figures, v2: final versio

ESTIMATION OF AND ADJUSTMENT FOR RESIDUAL EFFECTS IN DAIRY FEEDING EXPERIMENTS UTILIZING CHANGEOVER DESIGNS

A procedure is presented which demonstrates estimation of and adjustment for residual effects in changeover designs. The method utilizes all data collected in an experiment by including treatments imposed on animals prior to initiation of data collection. Estimation is achieved via general linear models. An example is given of a nutrition experiment conducted with dairy cattle. Such analyses should increase efficacy of changeover designs and reduce concern by researchers about biased estimates of direct effects which could result from residual effects. Methods from popular computer programs for estimating direct effect treatment means are compared. Practical problems encountered in computing standard errors of mean estimates in mixed linear models

Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices

Super-resolution is a fundamental task in imaging, where the goal is to extract fine-grained structure from coarse-grained measurements. Here we are interested in a popular mathematical abstraction of this problem that has been widely studied in the statistics, signal processing and machine learning communities. We exactly resolve the threshold at which noisy super-resolution is possible. In particular, we establish a sharp phase transition for the relationship between the cutoff frequency ($m$) and the separation ($\Delta$). If $m > 1/\Delta + 1$, our estimator converges to the true values at an inverse polynomial rate in terms of the magnitude of the noise. And when $m < (1-\epsilon) /\Delta$ no estimator can distinguish between a particular pair of $\Delta$-separated signals even if the magnitude of the noise is exponentially small. Our results involve making novel connections between {\em extremal functions} and the spectral properties of Vandermonde matrices. We establish a sharp phase transition for their condition number which in turn allows us to give the first noise tolerance bounds for the matrix pencil method. Moreover we show that our methods can be interpreted as giving preconditioners for Vandermonde matrices, and we use this observation to design faster algorithms for super-resolution. We believe that these ideas may have other applications in designing faster algorithms for other basic tasks in signal processing.Comment: 19 page

A General Framework for Recursive Decompositions of Unitary Quantum Evolutions

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been proposed in the literature to express unitary operators as products of simple operators with properties relevant in entanglement dynamics. In this paper, using the concept of grading of a Lie algebra, we cast these decompositions in a unifying scheme and show how new recursive decompositions can be obtained. In particular, we propose a new recursive decomposition of the unitary operator on $N$ qubits, and we give a numerical example.Comment: 17 pages. To appear in J. Phys. A: Math. Theor. This article replaces our earlier preprint "A Recursive Decomposition of Unitary Operators on N Qubits." The current version provides a general method to generate recursive decompositions of unitary evolutions. Several decompositions obtained before are shown to be as a special case of this general procedur