Local unitary invariants for multipartite quantum systems

A method is presented to obtain local unitary invariants for multipartite quantum systems consisting of fermions or distinguishable particles. The invariants are organized into infinite families, in particular, the generalization to higher dimensional single particle Hilbert spaces is straightforward. Many well-known invariants and their generalizations are also included.Comment: 13 page

Asymptotic entanglement transformation between W and GHZ states

We investigate entanglement transformations with stochastic local operations and classical communication (SLOCC) in an asymptotic setting using the concepts of degeneration and border rank of tensors from algebraic complexity theory. Results well-known in that field imply that GHZ states can be transformed into W states at rate 1 for any number of parties. As a generalization, we find that the asymptotic conversion rate from GHZ states to Dicke states is bounded as the number of subsystems increase and the number of excitations is fixed. By generalizing constructions of Coppersmith and Winograd and by using monotones introduced by Strassen we also compute the conversion rate from W to GHZ states.Comment: 11 page

Real options in corporate valuation

Imperial Users onl

Asymptotic tensor rank of graph tensors: beyond matrix multiplication

We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on $k$ vertices. For $k\geq4$, we show that the exponent per edge is at most 0.77, outperforming the best known upper bound on the exponent per edge for matrix multiplication ($k=3$), which is approximately 0.79. We raise the question whether for some $k$ the exponent per edge can be below $2/3$, i.e. can outperform matrix multiplication even if the matrix multiplication exponent equals 2. In order to obtain our results, we generalise to higher order tensors a result by Strassen on the asymptotic subrank of tight tensors and a result by Coppersmith and Winograd on the asymptotic rank of matrix multiplication. Our results have applications in entanglement theory and communication complexity

Entanglement distillation from Greenberger-Horne-Zeilinger shares

We study the problem of converting a product of Greenberger-Horne-Zeilinger (GHZ) states shared by subsets of several parties in an arbitrary way into GHZ states shared by every party. Our result is that if SLOCC transformations are allowed, then the best asymptotic rate is the minimum of bipartite log-ranks of the initial state. This generalizes a result by Strassen on the asymptotic subrank of the matrix multiplication tensor.Comment: 8 pages, v2: minor correction

All degree six local unitary invariants of k qudits

We give explicit index-free formulae for all the degree six (and also degree four and two) algebraically independent local unitary invariant polynomials for finite dimensional k-partite pure and mixed quantum states. We carry out this by the use of graph-technical methods, which provides illustrations for this abstract topic.Comment: 18 pages, 6 figures, extended version. Comments are welcom

The asymptotic spectrum of LOCC transformations

We study exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in success probability, known as the converese error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterisation of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [Hayashi et al, 2003], where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case we prove that this bound holds with equality.Comment: v1: 21 pages v2: 21 pages, Minor corrections v3: 17 pages, Minor corrections, new reference added, parts of Section 5 and the Appendix removed, the omitted material can be found in an extended form in arXiv:1808.0515

Distillation of Greenberger-Horne-Zeilinger states by combinatorial methods

We prove a lower bound on the rate of Greenberger-Horne-Zeilinger states distillable from pure multipartite states by local operations and classical communication (LOCC). Our proof is based on a modification of a combinatorial argument used in the fast matrix multiplication algorithm of Coppersmith and Winograd. Previous use of methods from algebraic complexity in quantum information theory concerned transformations with stochastic local operations and classical operation (SLOCC), resulting in an asymptotically vanishing success probability. In contrast, our new protocol works with asymptotically vanishing error.Comment: 26 pages, 2 figures; v2: updated to match published versio

How user-friendly are user interfaces of open access digital repositories?

Digital information resources available on the Internet have become conditio sine qua non of modern research and teaching. In the last decade and a half the Internet and especially the Web had introduced many types of online information resources that emerged and vanished. Only those that were closely associated with important institutions in society (such as libraries and universities) and proved usable survived. Until recently, libraries have been places where university staff seeks quality information for research and teaching, and students for learning. With the proliferation of the Web, students have replaced libraries with search engines and are now using them as primary tools for discovery of information necessary for completion of their written exams, term papers, presentations etc. In their effort to provide researchers, teachers and students with quality content, universities and libraries started development of digital repositories, digital archives of the intellectual product created by the faculty, research staff, and students of an institution. Digital repositories contain research data, journal articles, preprints, technical reports, books, theses and dissertations and other material used in research and educational process. The diverse content of digital repositories represents rich resources for research and teaching, In addition to the diversity and quality of the content, another issue – user interfaces – attracted attention of computer specialists because user interfaces are means of successful use of digital repositories. The research of top 20 open access digital repositories showed that the biggest repositories share common characteristics which help their users in their daily access to the content of repositories. Despite helpful similarities, some of these digital repositories should improve their design to become more attractive and attract younger generations of users seeking knowledge elsewhere on the Internet