Creating maximally entangled states by gluing

We introduce a general method of gluing multi-partite states and show that entanglement swapping is a special class of a wider range of gluing operations. The gluing operation of two m and n qudit states consists of an entangling operation on two given qudits of the two states followed by operations of measurements of the two qudits in the computational basis. Depending on how many qudits (two, one or zero) we measure, we have three classes of gluing operation, resulting respectively in \(m+n-2\), \(m+n-1\), or \(m+n\) qudit states. Entanglement swapping belongs to the first class and has been widely studied, while the other two classes are presented and studied here. In particular, we study how larger GHZ and W states can be constructed when we glue the smaller GHZ and W states by the second method. Finally we prove that when we glue two states by the third method, the k-uniformity of the states is preserved. That is when a k-uniform state of m qudits is glued to a \(k'\)-uniform state of n qudits, the resulting state will be a \(\hbox {min}(k,k')\)-uniform of \(m+n\) qudits.     

One-way LOCC indistinguishability of maximally entangled states

In this letter, we mainly study the local indistinguishability of mutually orthogonal maximally entangled states, which are in canonical form. Firstly, we present a feasible sufficient and necessary condition for distinguishing such states by one-way local operations and classical communication (LOCC). Secondly, for the application of this condition, we exhibit one class of maximally entangled states that can be locally distinguished with certainty. Furthermore, sets of $d-1$ indistinguishable maximally entangled states by one-way LOCC are demonstrated in $d \otimes d$ (for $d=7, 8, 9, 10$ ). Interestingly, we discover there exist sets of $d-2$ such states in $d \otimes d$ (for $d=8, 9, 10$ ), which are not perfectly distinguishable by one-way LOCC. Finally, we conjecture that there exist $d-1$ or fewer indistinguishable maximally entangled states in $d \otimes d(d \ge 5)$ by one-way LOCC.     

Negativity fonts, multiqubit invariants and four qubit maximally entangled states

Recently, we introduced negativity fonts as the basic units of multipartite entanglement in pure states. We show that the relation between global negativity of partial transpose of N?qubit state and linear entropy of reduced single qubit state yields an expression for global negativity in terms of determinants of negativity fonts. Transformation equations for determinants of negativity fonts under local unitaries (LU??s) are useful to construct LU invariants such as degree four and degree six invariants for four qubit states. The difference of squared negativity and N?tangle is an N qubit invariant which contains information on entanglement of the state caused by quantum coherences that are not annihilated by removing a single qubit. Four qubit invariants that detect the entanglement of specific parts in a four qubit state are expressed in terms of three qubit subsystem invariants. Numerical values of invariants bring out distinct features of several four qubit states which have been proposed to be the maximally entangled four qubit states.     

Some new results on Hadamard modulo prime matrices

First, some nonexistence and classification results on Hadamard modulo prime matrices whose size is relatively small with respect to their modulus, are presented. Second, we show the existence of an infinite class of matrices of that kind derived by finite projective planes.     

Hadamard matrices of Williamson type: A challenge for Computer Algebra

We describe new families of challenging polynomial systems of equations arising in the construction of Hadamard matrices of Williamson type. These systems depend on a parameter and exhibit a number of symmetries. We demonstrate that Genetic Algorithms form a suitable tool to apply to these systems, for which the traditional Computer Algebra methods seem to be inappropriate.     

Matrix partial fraction expansions of rational matrices

A general and rigorous derivation is made of a new formula, established recently in the literature, for matrix partial fraction expansion of a rational matrix. The procedure, by use of a minimal Jordan realization of the rational matrix, provides as a byproduct, general expressions for residue matrices in terms of products of columns of the output matrix and rows of the input matrix of the realization.     

Controlability by completions of partial upper triangular matrices

Given an irreducible partial upper triangularn × n matrixA, it is shown that for every nonzero vectorb there exists a completionA _c ofA such that the pair (A _c ,b) is controllable. Various extensions and applications of this result are given.Partially supported by NSF Grant DMS-9000839 and by the United States-Israel Binational Fund.     

Mutually unbiased maximally entangled bases in $$\mathbb {C}^d\otimes \mathbb {C}^d$$

We study mutually unbiased maximally entangled bases (MUMEB’s) in bipartite system \(\mathbb {C}^d\otimes \mathbb {C}^d (d \ge 3)\). We generalize the method to construct MUMEB’s given in Tao et al. (Quantum Inf Process 14:2291–2300, 2015), by using any commutative ring R with d elements and generic character of \((R,+)\) instead of \(\mathbb {Z}_d=\mathbb {Z}/d\mathbb {Z}\). Particularly, if \(d=p_1^{a_1}p_2^{a_2}\ldots p_s^{a_s}\) where \(p_1, \ldots , p_s\) are distinct primes and \(3\le p_1^{a_1}\le \cdots \le p_s^{a_s}\), we present \(p_1^{a_1}-1\) MUMEB’s in \(\mathbb {C}^d\otimes \mathbb {C}^d\) by taking \(R=\mathbb {F}_{p_1^{a_1}}\oplus \cdots \oplus \mathbb {F}_{p_s^{a_s}}\), direct sum of finite fields (Theorem 3.3).     

Preparing large-scale maximally entangled <Emphasis Type="Italic">W</Emphasis> states in optical system

We propose an optical scheme to prepare large-scale maximally entangled W states by fusing arbitrary-size polarization entangled W states via polarization-dependent beam splitter. Because most of the currently existing fusion schemes are suffering from the qubit loss problem, that is the number of the output entangled qubits is smaller than the sum of numbers of the input entangled qubits, which will inevitably decrease the fusion efficiency and increase the number of fusion steps as well as the requirement of quantum memories, in our scheme, we design a effect fusion mechanism to generate \(W_{m+n}\) state from a n-qubit W state and a m-qubit W state without any qubit loss. As the nature of this fusion mechanism clearly increases the final size of the obtained W state, it is more efficient and feasible. In addition, our scheme can also generate \(W_{m+n+t-1}\) state by fusing a \(W_m\), a \(W_n\) and a \(W_t\) states. This is a great progress compared with the current scheme which has to lose at least two particles in the fusion of three W states. Moreover, it also can be generalized to the case of fusing k different W states, and all the fusion schemes proposed here can start from Bell state as well.     

Connecting Design with Code

Jon Bentley wrote his thesis on divide-and-conquer algorithms and came to greatly admire C.A.R. Hoare's original quicksort algorithm. Yet for years, Bentley "tiptoed around its innermost loop" because he didn't understand it (Beautiful Code, O'Reilly, 2007). It was only after he implemented his own quicksort based on an elegant partitioning scheme for programming Pearls (Addison-Wesley, 1999) that he truly understood the reason for that inner loop. He also trimmed the original bulkier algorithm to a mere dozen tight lines of code. Code clutter and unnecessary complexity can obscure a design. However, connecting design decisions to code won't happen unless developers embrace the practice of writing code as if expressing design intent matters.     

Algorithm to solve the partial eigenvalue problem for large profile matrices

An algorithm is proposed for computing some of the eigenvalues and the corresponding eigenvectors of the generalized eigenvalue problem for symmetric positive-definite matrices stored in profile form on disk.Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 141–147, March–April, 1992.     

Stabilization for Markovian jump systems with partial information on transition probability based on free-connection weighting matrices

This paper focuses on stability and stabilization for a class of continuous-time Markovian jump systems with partial information on transition probability. The free-connection weighting matrix method is proposed to obtain a less conservative stability criterion of Markovian jump systems with partly unknown transition probability or completely unknown transition probability. As a result, a sufficient condition for the state feedback controller design is derived in terms of linear matrix inequalities. Finally, numerical examples are given to illustrate the effectiveness and the merits of the proposed method.     

Unextendible maximally entangled bases in $${\mathbb {C}}^{pd}\otimes {\mathbb {C}}^{qd}$$

The construction of unextendible maximally entangled bases is tightly related to quantum information processing like local state discrimination. We put forward two constructions of UMEBs in \({\mathbb {C}}^{pd}\otimes {\mathbb {C}}^{qd}\)(\(p\le q\)) based on the constructions of UMEBs in \({\mathbb {C}}^{d}\otimes {\mathbb {C}}^{d}\) and in \({\mathbb {C}}^{p}\otimes {\mathbb {C}}^{q}\), which generalizes the results in Guo (Phys Rev A 94:052302, 2016) by two approaches. Two different 48-member UMEBs in \({\mathbb {C}}^{6}\otimes {\mathbb {C}}^{9}\) have been constructed in detail.     

Connecting the family with awareness systems

Awareness systems have attracted significant research interest for their potential to support interpersonal relationships. Investigations of awareness systems for the domestic environment have suggested that such systems can help individuals stay in touch with dear friends or family and provide affective benefits to their users. Our research provides empirical evidence to refine and substantiate such suggestions. We report our experience with designing and evaluating the ASTRA awareness system, for connecting households and mobile family members. We introduce the concept of connectedness and its measurement through the Affective Benefits and Costs of communication questionnaire (ABC-Q). We inform results that testify the benefits of sharing experiences at the moment they happen without interrupting potential receivers. Finally, we document the role that lightweight, picture-based communication can play in the range of communication media available.

---

Quantum teleportation with partially entangled states via noisy channels

Using a partially entangled EPR-type state as quantum channel, we investigate quantum teleportation (QT) of a qubit state in noisy environments by solving the master equation in the Lindblad form. We analyze the different influence for the partially entangled EPR-type channel and the EPR channel on the fidelity and the average fidelity of the QT process in the presence of Pauli noises. It is found that the fidelity depends on the type and the strength of the noise, and the initial state to be teleported. Moreover, the EPR channel is more robust than the partially entangled EPR-type channel against the influence of the noises. It is also found that the partially entangled EPR-type channel enables the average fidelity as a function of the decoherence parameter $kt$ to decay with different velocities for different Pauli noises.     

Multi-party quantum private comparison protocol with n-level entangled states

In this paper, two multi-party quantum private comparison (MQPC) protocols are proposed in distributed mode and traveling mode, respectively. Compared with the first MQPC protocol, which pays attention to compare between arbitrary two participants, our protocols focus on the comparison of equality for \(n\) participants with a more reasonable assumption of the third party. Through executing our protocols once, it is easy to get if \(n\) participants’ secrets are same or not. In addition, our protocols are proved to be secure against the attacks from both outside attackers and dishonest participants.