arXiv subjects

Pablo Arrighi

Publications and source records attributed to Pablo Arrighi.

79 records · Page 5Linked to original sources

arXiv2006

Blind Quantum Computation

We investigate the possibility of "having someone carry out the work of executing a function for you, but without letting him learn anything about your input". Say Alice wants Bob to compute some known function f upon her input x, but wants to prevent Bob from learning anything about x. The situation arises for instance if client Alice has limited computational resources in comparison with mistrusted server Bob, or if x is an inherently mobile piece of data. Could there be a protocol whereby Bob is forced to compute f(x) "blindly", i.e. without observing x? We provide such a blind computation protocol for the class of functions which admit an efficient procedure to generate random input-output pairs, e.g. factorization. The cheat-sensitive security achieved relies only upon quantum theory being true. The security analysis carried out assumes the eavesdropper performs individual attacks. Keywords: Secure Circuit Evaluation, Secure Two-party Computation, Information Hiding, Information gain vs disturbance.

quant-ph↗

arXiv2005

On Quantum Operations as Quantum States

We formalize the correspondence between quantum states and quantum operations isometrically, and harness its consequences. This correspondence was already implicit in the various proofs of the operator sum representation of Completely Positive-preserving linear maps; we go further and show that all of the important theorems concerning quantum operations can be derived directly from those concerning quantum states. As we do so the discussion first provides an elegant and original review of the main features of quantum operations. Next (in the second half of the paper) we find more results stemming from our formulation of the correspondence. Thus we provide a factorizability condition for quantum operations, and give two novel Schmidt-type decompositions of bipartite pure states. By translating the composition law of quantum operations, we define a group structure upon the set of totally entangled states. The question whether the correspondence is merely mathematical or can be given a physical interpretation is addressed throughout the text: we provide formulae which suggest quantum states inherently define a quantum operation between two of their subsystems, and which turn out to have applications in quantum cryptography. Keywords: Kraus, CP-maps, superoperators, extremality, trace-preserving, factorizable, triangular.

quant-ph↗

arXiv2005

Linear-algebraic lambda-calculus

With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an interpreter/simulator) is provided for this language in the form of a term rewrite system. The linear-algebraic lambda-calculus hereby constructed is linear in a different (yet related) sense to that, say, of the linear lambda-calculus. These various notions of linearity are discussed in the context of quantum programming languages. KEYWORDS: quantum lambda-calculus, linear lambda-calculus, $λ$-calculus, quantum logics.

quant-ph↗

arXiv2004

Quantum Decoys

Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise superpositions of possible words cannot be distinguished from the message words. Thus as malevolent Eve observes the quantum channel, she runs the risk of damaging the superpositions (by causing a collapse). At the receiving end honest Bob, whom we assume is warned of the quantum decoys' distribution, checks upon their integrity with a measurement. The present work establishes, in the case of individual attacks, the tradeoff between Eve's information gain (her chances, if a message word was sent, of guessing which) and the disturbance she induces (Bob's chances, if a quantum decoy was sent, to detect tampering). Besides secure channel protocols, quantum decoys seem a powerful primitive for constructing n-dimensional quantum cryptographic applications. Moreover the methods employed in this article should be of strong interest to anyone concerned with the old but fundamental problem of how much information may be gained about a system, versus how much this will disturb the system, in quantum mechanics. Keywords: d-level systems cryptography

quant-ph↗

arXiv2003

A Note on the correspondence between Qubit Quantum Operations and Special Relativity

We exploit a well-known isomorphism between complex hermitian $2\times 2$ matrices and $\mathbb{R}^4$, which yields a convenient real vector representation of qubit states. Because these do not need to be normalized we find that they map onto a Minkowskian future cone in $\mathbb{E}^{1,3}$, whose vertical cross-sections are nothing but Bloch spheres. Pure states are represented by light-like vectors, unitary operations correspond to special orthogonal transforms about the axis of the cone, positive operations correspond to pure Lorentz boosts. We formalize the equivalence between the generalized measurement formalism on qubit states and the Lorentz transformations of special relativity, or more precisely elements of the restricted Lorentz group together with future-directed null boosts. The note ends with a discussion of the equivalence and some of its possible consequences.

quant-ph↗

arXiv2003

Quantum Computation explained to my Mother

There are many falsely intuitive introductions to quantum theory and quantum computation in a handwave. There are also numerous documents which teach those subjects in a mathematically sound manner. To my knowledge this paper is the shortest of the latter category. The aim is to deliver a short yet rigorous and self-contained introduction to Quantum Computation, whilst assuming the reader has no prior knowledge of anything but the fundamental operations on real numbers. Successively I introduce complex matrices; the postulates of quantum theory and the simplest quantum algorithm. The document originates from a fifty minutes talk addressed to a non-specialist audience, in which I sought to take the shortest mathematical path that proves a quantum algorithm right.

quant-ph↗

arXiv2003

The Conal representation of Quantum States and Non Trace-Preserving Quantum Operations

We represent generalized density matrices of a $d$-complex dimensional quantum system as a subcone of a real pointed cone of revolution in $\mathbb{R}^{d^2}$, or indeed a Minkowskian cone in $\mathbb{E}^{1,d^2-1}$. Generalized pure states correspond to certain future-directed light-like vectors of $\mathbb{E}^{1,d^2-1}$. This extension of the Generalized Bloch Sphere enables us to cater for non-trace-preserving quantum operations, and in particluar to view the per-outcome effects of generalized measurements. We show that these consist of the product of an orthogonal transform about the axis of the cone of revolution and a positive real linear transform. We give detailed formulae for the one qubit case and express the post-measurement states in terms of the initial state vectors and measurement vectors. We apply these results in order to find the information gain versus disturbance tradeoff in the case of two equiprobable pure states. Thus we recover Fuchs and Peres' formula in an elegant manner.

quant-ph↗