a lattice perspective

We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes. We derive formal bounds on code parameters, show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the tensor product of lattices and point to natural resource savings that have remained hidden in recent approaches. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the concatenated surface-GKP code

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem

We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are good in that they exhibit constant rate and average distance scaling $\Delta \propto \sqrt{n}$ with high probability, where $n$ is the number of bosonic modes, which is a distance scaling equivalent to that of a GKP code obtained by concatenating single mode GKP codes into a qubit-quantum error correcting code with linear distance. The derived class of NTRU-GKP codes has the additional property that decoding for a stochastic displacement noise model is equivalent to decrypting the NTRU cryptosystem, such that every random instance of the code naturally comes with an efficient decoder. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography. We underscore this connection by discussing the computational hardness of decoding GKP codes and propose, as a new application, a simple public key quantum communication protocol with security inherited from the NTRU cryptosystem.Comment: 23 pages, 10 figures, comments welcome! Version 2 has minor correction

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem

We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are good in that they exhibit constant rate and average distance scaling Δ∝√n with high probability, where n is the number of bosonic modes, which is a distance scaling equivalent to that of a GKP code obtained by concatenating single mode GKP codes into a qubit-quantum error correcting code with linear distance. The derived class of NTRU-GKP codes has the additional property that decoding for a stochastic displacement noise model is equivalent to decrypting the NTRU cryptosystem, such that every random instance of the code naturally comes with an efficient decoder. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography. We underscore this connection by discussing the computational hardness of decoding GKP codes and propose, as a new application, a simple public key quantum communication protocol with security inherited from the NTRU cryptosystem

Basic limitations for entanglement catalysis

In this paper we summarize the necessary condition for incomparable states which can be catalyzed under entanglement-assisted LQCC (ELQCC). When we apply an extended condition for entanglement transformation to entanglement-assisted local manipulation we obtain a fundamental limit for entanglement catalysts. Some relative questions are also discussed.Comment: 4 pages, revtex, no figure

General linear-optical quantum state generation scheme: Applications to maximally path-entangled states

We introduce schemes for linear-optical quantum state generation. A quantum state generator is a device that prepares a desired quantum state using product inputs from photon sources, linear-optical networks, and postselection using photon counters. We show that this device can be concisely described in terms of polynomial equations and unitary constraints. We illustrate the power of this language by applying the Grobner-basis technique along with the notion of vacuum extensions to solve the problem of how to construct a quantum state generator analytically for any desired state, and use methods of convex optimization to identify bounds to success probabilities. In particular, we disprove a conjecture concerning the preparation of the maximally path-entangled |n,0)+|0,n) (NOON) state by providing a counterexample using these methods, and we derive a new upper bound on the resources required for NOON-state generation.Comment: 5 pages, 2 figure

Applications of Face Analysis and Modeling in Media Production

Facial expressions play an important role in day-by-day communication as well as media production. This article surveys automatic facial analysis and modeling methods using computer vision techniques and their applications for media production. The authors give a brief overview of the psychology of face perception and then describe some of the applications of computer vision and pattern recognition applied to face recognition in media production. This article also covers the automatic generation of face models, which are used in movie and TV productions for special effects in order to manipulate people's faces or combine real actors with computer graphics

Ordering states with entanglement measures

We demonstrate that all good asymptotic entanglement measures are either identical or place a different ordering on the set of all quantum states.Comment: 6 pages, minor changes, references updated, all conclusions unchanged, now accepted for publicatio

A classical analogue of entanglement

We show that quantum entanglement has a very close classical analogue, namely secret classical correlations. The fundamental analogy stems from the behavior of quantum entanglement under local operations and classical communication and the behavior of secret correlations under local operations and public communication. A large number of derived analogies follow. In particular teleportation is analogous to the one-time-pad, the concept of ``pure state'' exists in the classical domain, entanglement concentration and dilution are essentially classical secrecy protocols, and single copy entanglement manipulations have such a close classical analog that the majorization results are reproduced in the classical setting. This analogy allows one to import questions from the quantum domain into the classical one, and vice-versa, helping to get a better understanding of both. Also, by identifying classical aspects of quantum entanglement it allows one to identify those aspects of entanglement which are uniquely quantum mechanical.Comment: 13 pages, references update

Relativity of pure states entanglement

Entanglement of any pure state of an N times N bi-partite quantum system may be characterized by the vector of coefficients arising by its Schmidt decomposition. We analyze various measures of entanglement derived from the generalized entropies of the vector of Schmidt coefficients. For N >= 3 they generate different ordering in the set of pure states and for some states their ordering depends on the measure of entanglement used. This odd-looking property is acceptable, since these incomparable states cannot be transformed to each other with unit efficiency by any local operation. In analogy to special relativity the set of pure states equivalent under local unitaries has a causal structure so that at each point the set splits into three parts: the 'Future', the 'Past' and the set of noncomparable states.Comment: 18 pages 7 figure

Optimal local implementation of non-local quantum gates

We investigate the minimal resources that are required in the local implementation of non-local quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We present general statements on the minimal resource requirements and present optimal procedures for a number of important gates, including CNOT and Toffoli gates. We show that one bit of classical communication in each direction is both necessary and sufficient for the non-local implementation of the quantum CNOT, while in general two bits in each direction is required for the implementation of a general two bit quantum gate. In particular, the state-swapper requires this maximum classical communication overhead. Extensions of these ideas to multi-party gates are presented.Comment: 7 pages, 5 figures; Replaced with published version, correcting minor typo