We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC) operations.
In their pioneering 2010 work, Kobayashi et al. showed how to convert any classical network coding protocol into a quantum network coding protocol. However, they left open whether the existence of a quantum network coding protocol implied the existence of a classical one. Motivated by this question, we characterize the set of distribution tasks achievable with non zero probability for both classical and quantum networks. We develop a formalism which encompasses both types of distribution protocols by reducing the solving of a distribution task to the factorization of a tensor with complex coefficients or real positive ones. Using this formalism, we examine the equivalences and differences between both types of distribution protocols exhibiting several elementary and fundamental relations between them as well as concrete examples of both convergence and divergence. We answer by the negative to the issue previously left open: some tasks are achievable in the quantum setting, but not in the classical one. We believe this formalism to be a useful tool for studying the extent of quantum network ability to perform multipartite distribution tasks.
Quantum computation is based on tensor products and entangled states. We discuss an alternative to the quantum framework where tensor products are replaced by geometric products and entangled states by multivectors. The resulting theory is analogous to quantum computation but does not involve quantum mechanics. We discuss in detail similarities and differences between the two approaches and illustrate the formulas by explicit geometric objects where multivector versions of the Bell-basis, GHZ, and Hadamard states are visualized by means of colored oriented polylines.
We extend quantum rate distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum rate distortion coding with the help of a classical side channel. Our result here is that the regularized entanglement of formation characterizes the quantum rate distortion function, extending earlier work of Devetak and Berger. We also combine this bound with the entanglement-assisted bound from our prior work to obtain the best known bounds on the quantum rate distortion functi…
Using invariance of the $n$-th tensored state w.r.t. the $n$-th symmetric group, we propose a 'variable length' universal entanglement concentration without classical communication. Like variable length data compression, arbitrary unknown states are concentrated into perfect Bell states and not approximate Bell states and the number of Bell states obtained is equal to the optimal rate asymptotically with the probability 1. One of the point of our scheme is that we need no classical communication at all. Using this method, we can construct a universal teleportation and a universal dense coding.
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between Alice and Bob. They are allowed to perform local operations on their respective systems and send quantum information to Charlie at limited rates. By doing measurements on the systems that he receives, Charlie needs to infer which of the two different states the original bipartite state was in, that is, which of the two hypotheses is true. We prove that the …
Let $\mathcal{B}_d$ be the unital $C^*$-algebra generated by the elements $u_{jk}, \, 0 \le i, j \le d-1$, satisfying the relations that $[u_{j,k}]$ is a unitary operator, and let $C^*(\mathbb{F}_{d^2})$ be the full group $C^*$-algebra of free group of $d^2$ generators. Based on the idea of teleportation and super-dense coding in quantum information theory, we exhibit the two $*$-isomorphisms $M_d(C^*(\mathbb{F}_{d^2}))\cong \mathcal{B}_d\rtimes \mathbb{Z}_d\rtimes \mathbb{Z}_d$ and $M_d(\mathcal{B}_d)\cong C^*(\mathbb{F}_{d^2})\rtimes \mathbb{Z}_d\rtimes \mathbb{Z}_d$, for certain actions of …
We present a generalized Schmidt decomposition for a pure system with any number of two-level subsystems. The basis is symmetric under the permutation of the parties and is derived from the product state defining the injective tensor norm of the state. The largest coefficient quantifies the quantum correlation of the state. Other coefficients have a lot of information such as the unentangled particles as well as the particles whose reduced states are completely mixed. The decomposition clearly distinguishes the states entangled in inequivalent ways and have an information on the applicability …
Singapore University of Technology and Design（新加坡科技设计大学）；Nanyang Technological University（南洋理工大学）；Zhejiang University（浙江大学）
The tensor network, as a facterization of tensors, aims at performing the operations that are common for normal tensors, such as addition, contraction and stacking. However, due to its non-unique network structure, only the tensor network contraction is so far well defined. In this paper, we propose a mathematically rigorous definition for the tensor network stack approach, that compress a large amount of tensor networks into a single one without changing their structures and configurations. We illustrate the main ideas with the matrix product states based machine learning as an example. Our r…
An introduction to the density matrix renormalization group is contained here, including coding examples. The focus of this code is on basic operations involved in tensor network computations, and this forms the foundation of the DMRjulia library. Algorithmic complexity, measurements from the matrix product state, convergence to the ground state, and other relevant features are also discussed. The present document covers the implementation of operations for dense tensors into the Julia language. The code can be used as an educational tool to understand how tensor network computations are done …
For bipartite pure and mixed quantum states, in addition to the quantum mutual information, there is another measure of total correlation, namely, the entanglement of purification. We study the monogamy, polygamy, and additivity properties of the entanglement of purification for pure and mixed states. In this paper, we show that, in contrast to the quantum mutual information which is strictly monogamous for any tripartite pure states, the entanglement of purification is polygamous for the same. This shows that there can be genuinely two types of total correlation across any bipartite cross in …
Simplest quantum teleportation algorithms can be represented in geometric terms in spaces of dimensions 3 (for real state-vectors) and 4 (for complex state-vectors). The geometric representation is based on geometric-algebra coding, a geometric alternative to the tensor-product coding typical of quantum mechanics. We discuss all the elementary ingredients of the geometric version of the algorithm: Geometric analogs of states and controlled Pauli gates. Fully geometric presentation is possible if one employs a nonstandard representation of directed magnitudes, formulated in terms of colors defi…
Clarke and Barron have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of this result for the two-level {\it quantum} systems. We restrict our considerations to prior probability distributions belonging to a certain one-parameter family, $q(u)$, $-\infty < u < 1$. Within this setting, we are able to compute exact redundancy formulas, for which we find the asymptotic limits. We compare our quantum asymptotic redundancy formulas to …
We develop a simple protocol for a one-shot version of quantum state redistribution, which is the most general two-terminal source coding problem. The protocol is simplified from a combination of protocols for the fully quantum reverse Shannon and fully quantum Slepian-Wolf problems, with its time-reversal symmetry being apparent. When the protocol is applied to the case where the redistributed states have a tensor power structure, more natural resource rates are obtained.
Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand, due to progress both on classical algorithms (e.g., graph isomorphism) and quantum algorithms (e.g., discrete logarithm). We propose the general linear group action on tensors as a new candidate to build cryptography based on group actions. Recent works (Futorny--Grochow--Sergeichuk, Lin. Alg. Appl., 2019) suggest that the underlying algorithmic problem, the tensor isomorphism problem,…
Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）；New Mexico Consortium（新墨西哥联盟）
We use a quantum annealing D-Wave 2X computer to obtain solutions to NP-hard sparse coding problems. To reduce the dimensionality of the sparse coding problem to fit on the quantum D-Wave 2X hardware, we passed downsampled MNIST images through a bottleneck autoencoder. To establish a benchmark for classification performance on this reduced dimensional data set, we used an AlexNet-like architecture implemented in TensorFlow, obtaining a classification score of $94.54 \pm 0.7 \%$. As a control, we showed that the same AlexNet-like architecture produced near-state-of-the-art classification perfor…
Dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one, reverse Shannon theorems concern the use of noiseless channels to simulate noisy ones, and more generally the use of one noisy channel to simulate another. For channels of nonzero capacity, this simulation is always possible, but for it to be efficient, auxiliary resources of the proper kind and amount are generally required. In the classical case, shared randomness between sender and receiver is a sufficient auxiliary resource, regardless of the nature of the sourc…
