From finite projective geometry to quantum phase enciphering (Discrete Math of MUBs) H. Rosu, M. Planat, M. Saniga (IPICyT-Mx, LPMO-Fr, Astronomical Inst.-Sk)

Slides:



Advertisements
Similar presentations
Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.
Advertisements

Quantum t-designs: t-wise independence in the quantum world Andris Ambainis, Joseph Emerson IQC, University of Waterloo.
10.4 Complex Vector Spaces.
3D Geometry for Computer Graphics
Finite Fields Rong-Jaye Chen. p2. Finite fields 1. Irreducible polynomial f(x)  K[x], f(x) has no proper divisors in K[x] Eg. f(x)=1+x+x 2 is irreducible.
Cryptography and Network Security
Quantum Computing MAS 725 Hartmut Klauck NTU
1 390-Elliptic Curves and Elliptic Curve Cryptography Michael Karls.
Short course on quantum computing Andris Ambainis University of Latvia.
MUBs and some other quantum designs Aleksandrs Belovs and Juris Smotrovs.
Advanced Information Security 4 Field Arithmetic
Block ciphers 1 Session 3. Contents Design of block ciphers Non-linear transformations 2/25.
Session 4 Asymmetric ciphers.
Quantum Phase Estimation using Multivalued Logic.
Symmetric Matrices and Quadratic Forms
Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Authors Faisal Shah Khan Marek A. Perkowski Slides prepared by Faisal Shah Khan.
ON MULTIVARIATE POLYNOMIAL INTERPOLATION
Matrices CS485/685 Computer Vision Dr. George Bebis.
Quantum One: Lecture 8. Continuously Indexed Basis Sets.
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
FINITE FIELDS 7/30 陳柏誠.
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
Hadamard matrices and the hadamard conjecture
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
CPSC 3730 Cryptography and Network Security
1 Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 4 – Finite Fields.
Information Security and Management 4. Finite Fields 8
Monoids, Groups, Rings, Fields
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Quantum Factoring Michele Mosca The Fifth Canadian Summer School on Quantum Information August 3, 2005.
Session 1 Stream ciphers 1.
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
Chapter 10 Real Inner Products and Least-Square
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
On the statistics of coherent quantum phase-locked states Michel Planat Institut FEMTO-ST, Dept. LPMO 32 Av. de l’Observatoire, Besançon Cedex
Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.
Mathematical Tools of Quantum Mechanics
Key Management Network Systems Security Mort Anvari.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
Lecture from Quantum Mechanics. Marek Zrałek Field Theory and Particle Physics Department. Silesian University Lecture 6.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
MA4229 Lectures 13, 14 Week 12 Nov 1, Chapter 13 Approximation to periodic functions.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
CS479/679 Pattern Recognition Dr. George Bebis
Matrices and vector spaces
COMPSCI 290.2: Computer Security
Postulates of Quantum Mechanics
Quantum Cryptography Quantum Computing
Properties Of the Quadratic Performance Surface
Lecture on Linear Algebra
CS485/685 Computer Vision Dr. George Bebis
Derivative of scalar forms
Symmetric Matrices and Quadratic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Finite Heisenberg group and its application in quantum computing
Subject :- Applied Mathematics
Linear Vector Space and Matrix Mechanics
Symmetric Matrices and Quadratic Forms
Presentation transcript:

From finite projective geometry to quantum phase enciphering (Discrete Math of MUBs) H. Rosu, M. Planat, M. Saniga (IPICyT-Mx, LPMO-Fr, Astronomical Inst.-Sk)

Abstract Scope: To review the derivation of mutually unbiased bases in arbitrary Hilbert space dimension. To study: Their relationship to Fourier transforms, Galois fields and rings, generalized Hopf fibrations and projective geometry. Some possible applications: state tomography secure exchange of quantum keys

Introduction Technical problems in quantum information theory already connect such distinct disciplines as number theory abstract algebra projective geometry For a partial list of open problems related to the development of quantum computing technologies, see

MUBs: Definition and Basic Facts Two different orthonormal bases A and B of a d-dimensional Hilbert space are called mutually unbiased if and only if for all a A and all b B. An aggregate of mutually unbiased bases is a set of orthonormal bases which are pairwise mutually unbiased. It has been found that the maximum number of such bases cannot be greater than d + 1 in d-dimensional Hilbert space [Wootters & Fields, 1989). It is also known that this limit is reached if d is a power of a prime. Yet, a still unanswered question is if there are non-prime-power values of d for which this bound is attained. Based on numerical calculations it is generally agreed [Zauner, 2003] that the maximum number of such bases is 1 + the lowest factor min( ) in the prime number decomposition of d = П i

MUBs and Finite Projective Planes (J. Opt. B: Quant. Semiclass. Opt., in press, Saniga,Planat,Rosu) CONJECTURE Whether or not there exists a set of d+1 MUBs in a d-dimensional Hilbert space if d not a power of a prime is intimately linked with the question of the existence of projective planes whose order is not a power of prime

MUBs: Applications The main application of MUBs pertains to secure quantum key exchange (quantum cryptography). This is because any attempt by an eavesdropper (say Eve) to distinguish between two non- orthogonal quantum states shared by two remote parties (say Alice and Bob) will occur at the price of introducing a disturbance to the signal, thus revealing the attack, and allowing to reject the corrupted quantum data. Modern protocols, e.g., the original BB84 protocol, use only 1- qubit technologies → dimension d = 2, usually the polarisation states of the photon. But the security against eavesdropping increases when all the three bases of qubits are used, or by using qudits, or entanglement-based protocols.

MUBs vs SIC-POVMS Quantum state recovery and secure quantum key distribution can also be achieved using positive operator valued measures (POVMs) which are symmetric informationally complete (SIC-POVMs) [Renes et al, JMP 2004]. These are sets of d 2 normalized vectors a and b such that | | = 1/(d + 1) 1/2 when a ≠ b. Unlike the MUBs the SIC-POVM’s could exist in all finite dimensions. Recently, SIC-POVMs have been constructed in dimension d = 6 by Grassl.

MUBs and Quantum Fourier Transforms There is a useful relationship between MUBs and QFTs. Consider a basis with indices n in the ring Z d of integers modulo d. The dual basis defined by the quantum Fourier transform is

Particular case: qubits d=2, ω=-1 Note that the two othogonal bases and are mutually unbiased. The third base, mutually unbiased to them is obtained from H (Hadamard matrix) by the action of a π/2 rotation S

2 d MUBs as eigenvectors of Pauli matrices B 0, B 1 and B 2 are also the eigenvectors of Pauli spin matrices respectively.

Generalization of Pauli matrices for prime dimension p For prime dimension p there is a natural generalization of σ x and σ z that are called shift and clock operators, respectively It can be shown that eigenvectors of the unitary operators generate the set of the d+1 MUBs in dimension p.

Problem: Could MUBs be obtained in any d and any field of numbers by Fourier transform as in d=2 ? Write the quantum Fourier transform such that the exponent ω now acts on a finite (Galois) field G=GF(p m ) with characteristic p and d=p m elements. Denote and ● the two operations in the field, corresponding to + and · in the field of real numbers. Then, the GF Fourier transform reads

Cont’d (1) Given any two polynomials k and n in G then there is a uniquely determined pair a and b in G such that where deg b < deg a, so that the exponent in the GF quantum Fourier transform could be written in the form

Cont’d (2) The last formula is valid for the case of prime dimension d=p when E is an integer. Otherwise, it has to be replaced by the trace of GF(p m ) down to GF(p) defined as follows and therefore

Cont’d (3) In a field of odd characteristic p the latter formula provides a set of d bases of index a for the base and the index b for the vector in the base, mutually unbiased to each other and to the computational base B 0. Formula was obtained by Wootters & Fields and also by Klappenecker & Rotteler

Cont’d (4) The same formula provides an interesting relation between the MUBs and quantum phase operators It is known that the Fourier basis can be derived as the eigenvectors of a quantum phase operator

Cont’d (5) Using the properties of the field trace, one can show that each base of index a can be associated to a quantum phase operator