We investigate the von Neumann entanglement entropy as function of the size of a subsystem for permutation invariant ground states in models with finite number of states per site, e.g., in quantum spin models. We demonstrate that the entanglement entropy of $n$ sites in a system of length $L$ generically grows as $σ\log_{2}[2πen(L-n)/L]+C$, where $σ$ is the on-site spin and $C$ is a function depending only on magnetization.
The notion of entangling power of unitary matrices was introduced by Zanardi, Zalka and Faoro [PRA, 62, 030301]. We study the entangling power of permutations, given in terms of a combinatorial formula. We show that the permutation matrices with zero entangling power are, up to local unitaries, the identity and the swap. We construct the permutations with the minimum nonzero entangling power for every dimension. With the use of orthogonal latin squares, we construct the permutations with the maximum entangling power for every dimension. Moreover, we show that the value obtained is maximum over…
Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the input states are, respectively, product and arbitrary pure states. We analytically derive them for Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries. In particular, the entangling power of permutation unitary of Schmidt rank three can take only one of two values: $\log_2 9 - 16/9$ or $\log_2 3$ ebits. The entangling power, …
It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two…
We show a simple relation connecting entangling power and local invariants of two-qubit gates. From the relation, a general condition under which gates have same entangling power is arrived. The relation also helps in finding the lower bound of entangling power for perfect entanglers, from which the classification of gates as perfect and nonperfect entanglers is obtained in terms of local invariants.
We define the disentangling power of a unitary operator in a similar way as the entangling power defined by Zanardi, Zalka and Faoro [PRA, 62, 030301]. A general formula is derived and it is shown that both quantities are directly proportional. All results concerning the entangling power can simply be translated into similar statements for the disentangling power. In particular, the disentangling power is maximal for certain permutations derived from orthogonal latin squares. These permutations can therefore be interpreted as those that distort entanglement in a maximal way.
For a generic $n$-qubit system, local invariants under the action of $SL(2,\mathbb{C})^{\otimes n}$ characterize non-local properties of entanglement. In general, such properties are not immediately apparent and hard to construct. Here we consider certain two-qubit Yang-Baxter operators, which we dub of the `X-type', and show that their eigenvalues completely determine the non-local properties of the system. Moreover, we apply the Turaev procedure to these operators and obtain their associated link/knot polynomials. We also compute their entangling power and compare it with that of a generic t…
We study target space entanglement in gauged multi-matrix models as models of entanglement between groups of D-branes separated by a planar entangling surface, paying close attention to the implementation of gauge invariance. We open with a review of target space entanglement between identical particles, which shares some important features (specifically a gauged permutation symmetry) with our main problem. For our matrix models, we implement a gauge fixing well-adapted to the entangling surface. In this gauge, we map the matrix model problem to that of entanglement of a $U(1)$ gauge theory on…
In this thesis there are two topics: On the entangling capacity, in terms of negativity, of quantum operations, and on the supremum of negativity for symmetric Gaussian states. Positive partial transposition (PPT) states are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies …
A permutation-invariant code on m qubits is a subspace of the symmetric subspace of the m qubits. We derive permutation-invariant codes that can encode an increasing amount of quantum information while suppressing leading order spontaneous decay errors. To prove the result, we use elementary number theory with prior theory on permutation invariant codes and quantum error correction.
In this paper we discuss the properties of the reduced density matrix of quantum many body systems with permutational symmetry and present basic quantification of the entanglement in terms of the von Neumann (VNE), Renyi and Tsallis entropies. In particular, we show, on the specific example of the spin $1/2$ Heisenberg model, how the RDM acquires a block diagonal form with respect to the quantum number $k$ fixing the polarization in the subsystem conservation of $S_{z}$ and with respect to the irreducible representations of the $\mathbf{S_{n}}$ group. Analytical expression for the RDM elements…
Hierarchies among genuine multipartite entangling capabilities of quantum gates
Harish-Chandra Research Institute, A CI of Homi Bhabha National Institute（哈里什-钱德拉研究所，霍米·巴巴国立学院下属机构）；Gandhi Institute of Technology and Management (Deemed to be University)（甘地科技与管理学院（视为大学））
In this work we consider the permutational properties of multipartite entanglement monotones. Based on the fact that genuine multipartite entanglement is a property of the entire multi-qubit system, we argue that ideal definitions for its characterizing quantities must be permutation-invariant. Using this criterion, we examine the three 4-qubit entanglement monotones introduced by Osterloh and Siewert [Phys. Rev. A. 72, 012337]. By expressing them in terms of quantities whose permutational properties can be easily derived, we find that one of these monotones is not permutation-invariant. We pr…
We consider the problem of characterizing genuine multiparticle entanglement for permutationally invariant states using the approach of PPT mixtures. We show that the evaluation of this necessary biseparability criterion scales polynomially with the number of particles. In practice, it can be evaluated easily up to ten qubits and improves existing criteria significantly. Finally, we show that our approach solves the problem of characterizing genuine multiparticle entanglement for permutationally invariant three-qubit states.
We consider density matrices which are sums of projectors on states spanning irreducible representations of the permutation group of L sites (eigenstates of permutational invariant quantum system with L sites) and construct the reduced density matrix (RDM) for blocks of size n<L by tracing out L-n sites, viewed as environment. Explicit analytic expressions of the elements of the RDM are given in the natural basis and the corresponding spectrum is derived. Results apply to all quantum many-body systems with permutational symmetry for which the mean field theory is exact.
A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex Euclidean space of dimension $q \ge 2$, any permutation-invariant code is a subspace of the symmetric subspace of $(\mathbb C^q)^N.$ We give an algebraic construction of new families of of $d$-dimensional permutation-invariant codes on at least $(2t+1)^2(d-1)$ qudits that can also correct $t$ errors for $d \ge 2$. The construction of our codes relies on a real …
Mutually unbiased bases determine an optimal set of measurements to extract complete information about the quantum state of a system. However, quite often a priori information about the state exist, making some of the measurement bases superfluous. This is, for example, the case when multiqubit states belong to the permutationally invariant subspace. In this paper we derive the minimal sets of mutually unbiased bases needed to tomographically reconstruct such states.
The study of entanglement properties of multi-qubit states that are invariant under permutations of qubits is motivated by potential applications in quantum computing, quantum communication, and quantum metrology. In this work, we generalize the notions of symmetrization, Dicke states, and the Majorana representation to the alternating, cyclic, and dihedral subgroups of the full group of permutations. We use these tools to characterize states that are invariant under these subgroups and analyze their entanglement properties.
The purpose of this short article is to build on the work of Ghirardi, Marinatto and Weber (Ghirardi, Marinatto & Weber 2002; Ghirardi & Marinatto 2003, 2004, 2005) and Ladyman, Linnebo and Bigaj (2013), in supporting a redefinition of entanglement for "indistinguishable" systems, particularly fermions. According to the proposal, non-separability of the joint state is insufficient for entanglement. The re-definition is justified by its physical significance, as enshrined in three biconditionals whose analogues hold of "distinguishable" systems.
We present a scalable method for the tomography of large multiqubit quantum registers. It acquires information about the permutationally invariant part of the density operator, which is a good approximation to the true state in many, relevant cases. Our method gives the best measurement strategy to minimize the experimental effort as well as the uncertainties of the reconstructed density matrix. We apply our method to the experimental tomography of a photonic four-qubit symmetric Dicke state.
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system. When the physical model is the Heisenberg ferromagnet in the absence of an external magnetic field, the corresponding ground-space contains all permutation-invariant states. We use techniques from combinatorics and operator theory to construct families of permutation-invariant quantum codes. These codes have length proportional to $t^2$; one family of codes …
Quantum deletions, which are harder to correct than erasure errors, occur in many realistic settings. It is therefore pertinent to develop quantum coding schemes for quantum deletion channels. To date, not much is known about which explicit quantum error correction codes can combat quantum deletions. We note that {\em any} permutation-invariant quantum code that has a distance of $t+1$ can correct $t$ quantum deletions for any positive integer $t$ in both the qubit and the qudit setting. Leveraging on coding properties of permutation-invariant quantum codes under erasure errors, we derive corr…
We point out that a geometric measure of quantum entanglement is related to the matrix permanent when restricted to permutation invariant states. This connection allows us to interpret the permanent as an angle between vectors. By employing a recently introduced permanent inequality by Carlen, Loss and Lieb, we can prove explicit formulas of the geometric measure for permutation invariant basis states in a simple way.
A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible representations, both those of higher dimension and orthogonal bases for the trivial representation, are available for error correction. A number of new (non-additive) binary codes are obtained, including two new 7-bit codes and a large family of new 9-bit codes. It is shown that the degeneracy arising from permutational symmetry facilitates the correction of certain typ…
We extend recent work on a leakage-protected, adiabatic entangling gate for exchange-only spin qubits [Doherty and Wardrop, PRL 111, 050503 (2013)] by adapting to a setting where single spins are not assumed to be polarized on preparation. Previous gate constructions do not function correctly when "gauge spins" are uninitialized, because the entangling gate has different, non-trivial action in different gauge subspaces. Our construction inherits many of the desirable features of the previous work while addressing the gauge-dependent behavior. Using numerical simulation, we show that the result…
This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes give the first example of quantum codes that can correct two or more deletion errors. Also, our codes give the first example of quantum codes that can correct both multiple-qubit errors and multiple-deletion errors. We also discuss a generalization of the construction of our codes at the end.
In this article I expound an understanding of the quantum mechanics of so-called "indistinguishable" systems in which permutation invariance is taken as a symmetry of a special kind, namely the result of representational redundancy. This understanding has heterodox consequences for the understanding of the states of constituent systems in an assembly and for the notion of entanglement. It corrects widespread misconceptions about the inter-theoretic relations between quantum mechanics and both classical particle mechanics and quantum field theory. The most striking of the heterodox consequences…
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after applying a quantum gate over the whole set of separable states. Here we focus on symmetric two-qubit quantum gates, acting on the symmetric two-qubit space, and calculate the entangling power in terms of the appropriate local-invariant. A geometric description of the local equivalence classes of gates is given in terms of the $\mathfrak{su}(3)$ Lie algebra root …
We consider distillation of entanglement from two qubit states which are mixtures of three mutually orthogonal states: two pure entangled states and one pure product state. We distill entanglement from such states by projecting n copies of the state on permutationally invariant subspace and then applying one-way hashing protocol. We find analytical expressions for the rate of the protocol. We also generalize this method to higher dimensional systems. To get analytical expression for two qubit case, we faced a mathematical problem of diagonalizing a family of matrices enjoying some symmetries w…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice, however, is at hand: it is provided by the quantum R-matrices, the entangling deformations of non-entangling (classical) permutations, distinguished from the points of view of group theory, integrable systems and modern theory of non-perturbative calculations in quantum field and string theory. Observables in this case are (square modules of) the knot polynomia…
Implementing high-fidelity two-qubit gates in single-electron spin qubits in silicon double quantum dots is still a major challenge. In this work, we employ analytical methods to design control pulses that generate high-fidelity entangling gates for quantum computers based on this platform. Using realistic parameters and initially assuming a noise-free environment, we present simple control pulses that generate CNOT, CPHASE, and CZ gates with average fidelities greater than 99.99\% and gate times as short as 45 ns. Moreover, using the local invariants of the system's evolution operator, we sho…
We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for analytical study. As a first application, we construct large new families of dual unitary gates in arbitrary finite dimensions, which are important toy models for entanglement spreading in quantum circuits. We then analyze the non-local nature of these invariant operators, both in discrete (operator Schmidt rank) and continuous (entangling power) settings. …
We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of matrices of general size $N$. We solve the general 11- parameter permutation invariant quantum matrix harmonic oscillator Hamiltonian and calculate the canonical partition function. The permutation invariant sector of the Hilbert space, for general Hamiltonians, can be described using partition algebra diagrams forming the bases of a tower of partition algebras $P_k(N)$. The integer $k$ is interpreted as the degree of matrix oscillator polynomials in the quantum mechanics. Fam…
