arXiv subjects

Péter Vrana

Publications and source records attributed to Péter Vrana.

36 records · Page 2Linked to original sources

arXiv2020

Asymptotic relative submajorization of multiple-state boxes

Pairs of states, or "boxes" are the basic objects in the resource theory of asymmetric distinguishability (Wang and Wilde, 2019), where free operations are arbitrary quantum channels that are applied to both states. From this point of view, hypothesis testing is seen as a process by which a standard form of distinguishability is distilled. Motivated by the more general problem of quantum state discrimination, we consider boxes of a fixed finite number of states and study an extension of the relative submajorization preorder to such objects. In this relation a tuple of positive operators is greater than another if there is a completely positive trace nonincreasing map under which the image of the first tuple satisfies certain semidefinite constraints relative to the other one. This preorder characterizes error probabilities in the case of testing a composite null hypothesis against a simple alternative hypothesis, as well as certain error probabilities in state discrimination. We present a sufficient condition for the existence of catalytic transformations between boxes, and a characterization of an associated asymptotic preorder, both expressed in terms of sandwiched Rényi divergences. This characterization of the asymptotic preorder directly shows that the strong converse exponent for a composite null hypothesis is equal to the maximum of the corresponding exponents for the pairwise simple hypothesis testing tasks.

quant-ph↗

arXiv2020

The semiring of dichotomies and asymptotic relative submajorization

We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched Rényi divergences. As an application we give a new derivation of the strong converse error exponent in quantum hypothesis testing.

quant-ph↗

arXiv2020

A generalization of Strassen's spectral theorem

Given a semiring with a preorder subject to certain conditions, the asymptotic spectrum, as introduced by Strassen (J. reine angew. Math. 1988), is a compact Hausdorff space together with a map from the semiring to the ring of continuous functions, which contains all information required to asymptotically compare large powers of the elements. Compactness of the asymptotic spectrum is closely tied with a boundedness condition assumed in Strassen's work. In this paper we present a generalization that relaxes this condition while still allowing asymptotic comparison via continuous functions on a locally compact Hausdorff space.

math.FA↗

arXiv2020

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.

quant-ph↗

arXiv2019

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.

math.CO↗

arXiv2019

Qudit homological product codes

In this note we show that the random homological product code construction of Bravyi and Hastings can be extended to qudits of dimension D with D an odd prime. While the result is not surprising, the proof does require new ideas.

quant-ph↗

arXiv2019

The asymptotic induced matching number of hypergraphs: balanced binary strings

We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$. Our lower bound relies on the higher-order extension of the well-known Coppersmith-Winograd method from algebraic complexity theory, which was proven by Christandl, Vrana and Zuiddam. Our result is motivated by the study of the power of this method as well as of the power of the Strassen support functionals (which provide upper bounds on the asymptotic induced matching number), and the connections to questions in tensor theory, quantum information theory and theoretical computer science. Phrased in the language of tensors, as a direct consequence of our result, we determine the asymptotic subrank of any tensor with support given by the aforementioned hypergraphs. In the context of quantum information theory, our result amounts to an asymptotically optimal $k$-party stochastic local operations and classical communication (slocc) protocol for the problem of distilling GHZ-type entanglement from a subfamily of Dicke-type entanglement.

math.CO↗

arXiv2019

Probabilistic refinement of the asymptotic spectrum of graphs

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms between the complements. He used it to obtain a dual characterization of the Shannon capacity of graphs as the minimum of the evaluation function over the asymptotic spectrum and noted that several known upper bounds, including the Lovász number and the fractional Haemers bounds are in fact elements of the asymptotic spectrum (spectral points). We show that every spectral point admits a probabilistic refinement and characterize the functions arising in this way. This reveals that the asymptotic spectrum can be parameterized with a convex set and the evaluation function at every graph is logarithmically convex. One consequence is that for any incomparable pair of spectral points $f$ and $g$ there exists a third one $h$ and a graph $G$ such that $h(G)<\min\{f(G),g(G)\}$, thus $h$ gives a better upper bound on the Shannon capacity of $G$. In addition, we show that the (logarithmic) probabilistic refinement of a spectral point on a fixed graph is the entropy function associated with a convex corner.

math.CO↗

arXiv2018

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.

quant-ph↗

arXiv2018

Universal points in the asymptotic spectrum of tensors

The asymptotic restriction problem for tensors is to decide, given tensors $s$ and $t$, whether the nth tensor power of $s$ can be obtained from the $(n+o(n))$th tensor power of t by applying linear maps to the tensor legs (this we call restriction), when $n$ goes to infinity. In this context, Volker Strassen, striving to understand the complexity of matrix multiplication, introduced in 1986 the asymptotic spectrum of tensors. Essentially, the asymptotic restriction problem for a family of tensors $X$, closed under direct sum and tensor product, reduces to finding all maps from $X$ to the reals that are monotone under restriction, normalised on diagonal tensors, additive under direct sum and multiplicative under tensor product, which Strassen named spectral points. Strassen created the support functionals, which are spectral points for oblique tensors, a strict subfamily of all tensors. Universal spectral points are spectral points for the family of all tensors. The construction of nontrivial universal spectral points has been an open problem for more than thirty years. We construct for the first time a family of nontrivial universal spectral points over the complex numbers, using quantum entropy and covariants: the quantum functionals. In the process we connect the asymptotic spectrum to the quantum marginal problem and to the entanglement polytope. To demonstrate the asymptotic spectrum, we reprove (in hindsight) recent results on the cap set problem by reducing this problem to computing asymptotic spectrum of the reduced polynomial multiplication tensor, a prime example of Strassen. A better understanding of our universal spectral points construction may lead to further progress on related questions. We additionally show that the quantum functionals characterise asymptotic slice rank for complex tensors.

math.CO↗

arXiv2017

Reconstructing quantum states from single-party information

The possible compatibility of density matrices for single-party subsystems is described by linear constraints on their respective spectra. Whenever some of those quantum marginal constraints are saturated, the total quantum state has a specific, simplified structure. We prove that these remarkable global implications of extremal local information are stable, i.e. they hold approximately for spectra close to the boundary of the allowed region. Application of this general result to fermionic quantum systems allows us to characterize natural extensions of the Hartree-Fock ansatz and to quantify their accuracy by resorting to one-particle information, only: The fraction of the correlation energy not recovered by such an ansatz can be estimated from above by a simple geometric quantity in the occupation number picture.

quant-ph↗

arXiv2017

Homological codes and abelian anyons

We study a generalization of Kitaev's abelian toric code model defined on CW complexes. In this model qudits are attached to $n$ dimensional cells and the interaction is given by generalized star and plaquette operators. These are defined in terms of coboundary and boundary maps in the locally finite cellular cochain complex and the cellular chain complex. We find that the set of frustration free ground states and the types of charges carried by certain localized excitations depend only on the proper homotopy type of the CW complex. As an application we show that the homological product of a CSS code with the infinite toric code has excitations with abelian anyonic statistics.

math-ph↗

arXiv2016

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.

quant-ph↗

arXiv2015

The Role of Topology in Quantum Tomography

We investigate quantum tomography in scenarios where prior information restricts the state space to a smooth manifold of lower dimensionality. By considering stability we provide a general framework that relates the topology of the manifold to the minimal number of binary measurement settings that is necessary to discriminate any two states on the manifold. We apply these findings to cases where the subset of states under consideration is given by states with bounded rank, fixed spectrum, given unitary symmetry or taken from a unitary orbit. For all these cases we provide both upper and lower bounds on the minimal number of binary measurement settings necessary to discriminate any two states of these subsets.

quant-ph↗

arXiv2010

The Veldkamp space of multiple qubits

We introduce a point-line incidence geometry in which the commutation relations of the real Pauli group of multiple qubits are fully encoded. Its points are pairs of Pauli operators differing in sign and each line contains three pairwise commuting operators any of which is the product of the other two (up to sign). We study the properties of its Veldkamp space enabling us to identify subsets of operators which are distinguished from the geometric point of view. These are geometric hyperplanes and pairwise intersections thereof. Among the geometric hyperplanes one can find the set of self-dual operators with respect to the Wootters spin-flip operation well-known from studies concerning multiqubit entanglement measures. In the two- and three-qubit cases a class of hyperplanes gives rise to Mermin squares and other generalized quadrangles. In the three-qubit case the hyperplane with points corresponding to the 27 Wootters self-dual operators is just the underlying geometry of the E6(6) symmetric entropy formula describing black holes and strings in five dimensions.

quant-ph↗

arXiv2009

Special entangled quantum systems and the Freudenthal construction

We consider special quantum systems containing both distinguishable and identical constituents. It is shown that for these systems the Freudenthal construction based on cubic Jordan algebras naturally defines entanglement measures invariant under the group of stochastic local operations and classical communication (SLOCC). For this type of multipartite entanglement the SLOCC classes can be explicitly given. These results enable further explicit constructions of multiqubit entanglement measures for distinguishable constituents by embedding them into identical fermionic ones. We also prove that the Plucker relations for the embedding system provide a sufficient and necessary condition for the separability of the embedded one. We argue that this embedding procedure can be regarded as a convenient representation for quantum systems of particles which are really indistinguishable but for some reason they are not in the same state of some inner degree of freedom.

quant-ph↗

arXiv2009

Black Hole Entropy and Finite Geometry

It is shown that the $E_{6(6)}$ symmetric entropy formula describing black holes and black strings in D=5 is intimately tied to the geometry of the generalized quadrangle GQ$(2,4)$ with automorphism group the Weyl group $W(E_6)$. The 27 charges correspond to the points and the 45 terms in the entropy formula to the lines of GQ$(2,4)$. Different truncations with $15, 11$ and 9 charges are represented by three distinguished subconfigurations of GQ$(2,4)$, well-known to finite geometers; these are the "doily" (i. e. GQ$(2,2)$) with 15, the "perp-set" of a point with 11, and the "grid" (i. e. GQ$(2,1)$) with 9 points, respectively. In order to obtain the correct signs for the terms in the entropy formula, we use a non- commutative labelling for the points of GQ$(2,4)$. For the 40 different possible truncations with 9 charges this labelling yields 120 Mermin squares -- objects well-known from studies concerning Bell-Kochen-Specker-like theorems. These results are connected to our previous ones obtained for the $E_{7(7)}$ symmetric entropy formula in D=4 by observing that the structure of GQ$(2,4)$ is linked to a particular kind of geometric hyperplane of the split Cayley hexagon of order two, featuring 27 points located on 9 pairwise disjoint lines (a distance-3-spread). We conjecture that the different possibilities of describing the D=5 entropy formula using Jordan algebras, qubits and/or qutrits correspond to employing different coordinates for an underlying non-commutative geometric structure based on GQ$(2,4)$.

hep-th↗

arXiv2008

Three fermions with six single particle states can be entangled in two inequivalent ways

Using a generalization of Cayley's hyperdeterminant as a new measure of tripartite fermionic entanglement we obtain the SLOCC classification of three-fermion systems with six single particle states. A special subclass of such three-fermion systems is shown to have the same properties as the well-known three-qubit ones. Our results can be presented in a unified way using Freudenthal triple systems based on cubic Jordan algebras. For systems with an arbitrary number of fermions and single particle states we propose the Plücker relations as a sufficient and necessary condition of separability.

quant-ph↗