Invariants of groups and universality of quantum gate sets

Size: px
Start display at page:

Download "Invariants of groups and universality of quantum gate sets"

Transcription

1 Invariants of groups and universality of quantum gate sets Gábor Ivanyos MTA SZTAKI RWCA 2008, Levico Terme, June 19, 2008.

2 Reversible gates Universality of reversible gates Reversible gates Universality Jeandel s separation result reversible n-bit gates: bijections {0, 1} n {0, 1} n reversible circuits on K > n bits: sequences of reversible n-bit gates together with wirings to n of the K bits: injections {1,..., n} {1,..., K} equivalent: sequences of reversible gates on the first n bits and permutations of the K bits

3 Reversible gates Universality Jeandel s separation result Wired gates and an equivalent circuit using permutations A C B A B C (14253) (35241)*(12) (12)

4 Universality Universality of reversible gates Reversible gates Universality Jeandel s separation result Γ: a set of n-bit reversible gates K-universality: every π A 2 K can be realized by a circuit built from Γ: A 2 K is generated by Γ and the bit permutations Remark: For K > n, A 2 K is the largest possible... universality: K-universality for all K K 0. Monotone property: For L > K > 2 K-universality = L-universality, universality=k-universality form some K max{3, n}.

5 Known facts Universality of reversible gates Reversible gates Universality Jeandel s separation result Case K = 2: the 2-bit reversible gates are not universal: S 4 = AGL(2, 2): only affine maps can be realized De Vos, Storme 2004: Γ S 2 n is universal in a much weaker sense Γ AGL(2 n, 2) Toffoli gate: if x 1 = x 2 = 1 then flip x 3 3-universal together with the one-bit gate flip x 1

6 Jeandel s separation result Reversible gates Universality Jeandel s separation result For n = 2 r + 3, universal n-bit gate set which is not 2n 8-universal. Γ 0 : a 3-universal set involutive gates on 3 bits. (E.g., the transpositions in S 8.) The gates on r qubits { (γ(v), w) if w = (1,..., 1) or (0,..., 0), γ(v, w) = (v, w) otherwise. Γ = { γ γ Γ 0 }.

7 Separation 2. Universality of reversible gates Reversible gates Universality Jeandel s separation result On K = 2 r+1 2 bits, (0 K/2, 1 K/2 ) = (0,..., 0, 1,..., 1) is fixed by every wiring of every gate from Γ. Γ is universal on K = 2 r bits: Implementation of γ Γ 0 on bits 1, 2, 3: For T {4, 5,..., 2 r+1 + 2}, T = 2 r : γ T = γ, wired to 1, 2, 3 and T. In γ T, there are an odd number of T s allowing γ to act. T

8 Universality and invariants Universality and invariants Invariants and ideals Experimental results Orbits on 4-tuples Theorem (using CFSG): G S m G is 4 transitive G A m or G is Mathieu... Corollary (m {11, 12, 23, 24}) Γ is K-universal Γ + bit permutations has 15 orbits on 4-tuples dim of invariant vectors of Γ {bit permutations} in C 24K is 15 (Γ acts on the first n bits)

9 Invariants and ideals Universality and invariants Invariants and ideals Experimental results Bit slicing: B = C 2, W = B 4, invariants in W K Fixed points on the tensor algebra K=0 W K = Dual of a homogeneous ideal in the 2 4 -variable polynomial ring dual ideal because Γ acts on the first n levels commutative polynomial ring because of bit permutations The degree K level of the ideal is spanned by binomials corresponding the relation in the same orbit

10 Universality and invariants Invariants and ideals Experimental results dim of fixed points at level K Hilbert function Ultimately a polynomial, the Hilbert polynomial from which K?: regularity Hilbert polynomial=constant 15 zero dim. ideal D. Lazard s regularity bound gives approx. 16n.

11 Experimental results Universality and invariants Invariants and ideals Experimental results - GAP: 23 subgroups of S 8 containing the bit permutations are not 3-universal, but 4-universal. Smallest: order 72, not transitive. - C program + Macaulay 2: no further universal subgroups bits trits - action on triples sufficient (classification of 3-transitive groups) - the two-trit gates are universal - GAP (with Csaba Schneider) 1700 subgroups of S 9 containing the swap of trits are not 2-universal, but 3-universal. Smallest: order 6, abelian! - C program + Macaulay 2: no further universal subgroups

12 Quantum circuits Universality of reversible gates Quantum circuits A density criterion Jeandel s criterion aka Larsen s alternative bit (0 or 1) quantum bit (qubit): unit vector a 0 + b 1 in C 2 n-bit strings n-qubit systems: unit vectors in C 2n n-bit (reversible) gates n-qubit (quantum) gates: unitary transformations of C 2n K-universality: generating A 2 K approximating all the elements of PSU 2 K : = generating a dense subgroup The set of 2-qubit gates is universal. Jeandel s separation: originally quantum.

13 A density criterion Universality of reversible gates Quantum circuits A density criterion Jeandel s criterion aka Larsen s alternative Γ U 2 K generates (projectively) a dense subgroup of PSU 2 K The space of the vectors left invariant by the 2 8K 2 8K matrices γ γ γ γ γ γ γ γ (γ Γ ) has dimension 24. (Action on V 4 (V 4 ), V = C 2K ) (By classical invariant theory, 24 is the dimension of the invariants of the group (P)(S)U.) A consequence of a density criterion of Jeandel and a theorem of Guralnick and Tiep (2005) (latter uses CFSG). Universality bound: Lazard s regularity bound gives approx. 256n

14 Quantum circuits A density criterion Jeandel s criterion aka Larsen s alternative Jeandel s criterion aka Larsen s alternative Γ U 2 K generates a dense subgroup of PSU 2 K The following two conditions: (1) The space of the invariants of Γ on V 2 (V 2 ) has dimension 2, and (2) the group generated by Γ is infinite (test: Alla s talk) Proof: G = complex Zariski closure of the group gen. by Γ. (1) sl 2 K is irreducible under the conjugation action of G. Then either G 0 = {1} or G 0 = SL 2 K.

15 Better bounds? Universality of reversible gates Better bounds? Tensor resp. direct product structure Further questions Tight(er) bounds? Quantum: already for n = 2. Reversible: n = 4 hope to do soon. Special structure of the ideal: R: binomials corresponding to a partition R,Q: make use of tensor structure of W??? e.g., (Q): W = B 4 (B 4 ), W n inherits the decomposition W = Mat 16 (C), W n has a matrix multiplication as well. Fixed points: subalgebra. Is there a finite group ( U 2 n), containing the qubit permutations which is universal? Already for n = 2???

16 Tensor resp. direct product structure Better bounds? Tensor resp. direct product structure Further questions Galois connection between relations (Q) resp. subspaces of W n and groups R (Krasner): On Ω Ω 2 Ω 3..., S = S 1 S 2 S 3... is the system of invariant relations of a permutation group on Ω S is a Krasner-algebra, i.e, S is closed under union,intersection, complement (in Ω k ), permutation of coordinates, projection, extension, and contains the identity relation. Q (Schrijver): A subspace S = k,l = 0 Sk l of T (W ) T (W ) = k,l=0 W k W l is the system of tensor invariants of a group in GL(W ) iff it is a -subalgebra which is closed under tensor contractions and mutations (permutations of tensor-coordinates ), Q,R: Consequences to invariants on small powers? Q: Fixed points of finite groups???

17 Further questions Universality of reversible gates Better bounds? Tensor resp. direct product structure Further questions Can anything (e.g., decidability of universality) proved without CFSG???? R: Can one prove that for a constant m, infinitely many K s.t. on 2 K elements the m-transitive groups contain A 2 K? Ancillas (auxiliary memory) R: Elements of A 2 K+L mapping S = {(x 1,..., x K, 0,..., 0)} to itself (A 2 K 1) should be realized, action considered only on S. Q: Elements of U 2 K+L mapping S = C 2K to itself (U 2 K I ) should be realized, action considered only on S.

18 Approximate input (Q)? Better bounds? Tensor resp. direct product structure Further questions Closeness to a non-universal gate set is decidable. (Impractical algorithm, based on solving a system of polynomial inequalities.) Is there a more efficient method???? Is it true that if Γ on W n has approx. fixed point v of norm 1 then Γ is close to a set which has a fixed point close to v?

arxiv:quant-ph/0603009v3 8 Sep 2006

arxiv:quant-ph/0603009v3 8 Sep 2006 Deciding universality of quantum gates arxiv:quant-ph/0603009v3 8 Sep 2006 Gábor Ivanyos February 1, 2008 Abstract We say that collection of n-qudit gates is universal if there exists N 0 n such that for

More information

Techniques algébriques en calcul quantique

Techniques algébriques en calcul quantique Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul

More information

Group Theory. Contents

Group Theory. Contents Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

More information

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

More information

Orthogonal Diagonalization of Symmetric Matrices

Orthogonal Diagonalization of Symmetric Matrices MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

More information

Finite dimensional C -algebras

Finite dimensional C -algebras Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n

More information

Degree Bounds for Gröbner Bases in Algebras of Solvable Type

Degree Bounds for Gröbner Bases in Algebras of Solvable Type Degree Bounds for Gröbner Bases in Algebras of Solvable Type Matthias Aschenbrenner University of California, Los Angeles (joint with Anton Leykin) Algebras of Solvable Type... introduced by Kandri-Rody

More information

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

More information

Quantum Computing. Robert Sizemore

Quantum Computing. Robert Sizemore Quantum Computing Robert Sizemore Outline Introduction: What is quantum computing? What use is quantum computing? Overview of Quantum Systems Dirac notation & wave functions Two level systems Classical

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

More information

o-minimality and Uniformity in n 1 Graphs

o-minimality and Uniformity in n 1 Graphs o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions

More information

Chapter 7. Permutation Groups

Chapter 7. Permutation Groups Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

More information

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

More information

Classification of Cartan matrices

Classification of Cartan matrices Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

More information

Arithmetic complexity in algebraic extensions

Arithmetic complexity in algebraic extensions Arithmetic complexity in algebraic extensions Pavel Hrubeš Amir Yehudayoff Abstract Given a polynomial f with coefficients from a field F, is it easier to compute f over an extension R of F than over F?

More information

GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

MCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials

MCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from

More information

How To Prove The Dirichlet Unit Theorem

How To Prove The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

Quantum Computing Lecture 7. Quantum Factoring. Anuj Dawar

Quantum Computing Lecture 7. Quantum Factoring. Anuj Dawar Quantum Computing Lecture 7 Quantum Factoring Anuj Dawar Quantum Factoring A polynomial time quantum algorithm for factoring numbers was published by Peter Shor in 1994. polynomial time here means that

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional

More information

Introduction to computer science

Introduction to computer science Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.

More information

Lecture 18 - Clifford Algebras and Spin groups

Lecture 18 - Clifford Algebras and Spin groups Lecture 18 - Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning

More information

On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

More information

Killer Te categors of Subspace in CpNN

Killer Te categors of Subspace in CpNN Three observations regarding Schatten p classes Gideon Schechtman Abstract The paper contains three results, the common feature of which is that they deal with the Schatten p class. The first is a presentation

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

More information

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

More information

GROUPS ACTING ON A SET

GROUPS ACTING ON A SET GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

More information

Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur

Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards

More information

MATHEMATICAL METHODS OF STATISTICS

MATHEMATICAL METHODS OF STATISTICS MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS

More information

COHOMOLOGY OF GROUPS

COHOMOLOGY OF GROUPS Actes, Congrès intern. Math., 1970. Tome 2, p. 47 à 51. COHOMOLOGY OF GROUPS by Daniel QUILLEN * This is a report of research done at the Institute for Advanced Study the past year. It includes some general

More information

Chapter 13: Basic ring theory

Chapter 13: Basic ring theory Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

More information

Finite Projective demorgan Algebras. honoring Jorge Martínez

Finite Projective demorgan Algebras. honoring Jorge Martínez Finite Projective demorgan Algebras Simone Bova Vanderbilt University (Nashville TN, USA) joint work with Leonardo Cabrer March 11-13, 2011 Vanderbilt University (Nashville TN, USA) honoring Jorge Martínez

More information

Orthogonal Projections and Orthonormal Bases

Orthogonal Projections and Orthonormal Bases CS 3, HANDOUT -A, 3 November 04 (adjusted on 7 November 04) Orthogonal Projections and Orthonormal Bases (continuation of Handout 07 of 6 September 04) Definition (Orthogonality, length, unit vectors).

More information

FIELD DEGREES AND MULTIPLICITIES FOR NON-INTEGRAL EXTENSIONS

FIELD DEGREES AND MULTIPLICITIES FOR NON-INTEGRAL EXTENSIONS Illinois Journal of Mathematics Volume 51, Number 1, Spring 2007, Pages 299 311 S 0019-2082 FIELD DEGREES AND MULTIPLICITIES FOR NON-INTEGRAL EXTENSIONS BERND ULRICH AND CLARENCE W. WILKERSON Dedicated

More information

2.1 Complexity Classes

2.1 Complexity Classes 15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

More information

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria

More information

(67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7

(67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7 (67902) Topics in Theory and Complexity Nov 2, 2006 Lecturer: Irit Dinur Lecture 7 Scribe: Rani Lekach 1 Lecture overview This Lecture consists of two parts In the first part we will refresh the definition

More information

s-convexity, model sets and their relation

s-convexity, model sets and their relation s-convexity, model sets and their relation Zuzana Masáková Jiří Patera Edita Pelantová CRM-2639 November 1999 Department of Mathematics, Faculty of Nuclear Science and Physical Engineering, Czech Technical

More information

Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes

Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes Markus Grassl Institut für Algorithmen und Kognitive Systeme Fakultät für Informatik, Universität Karlsruhe T Am Fasanengarten

More information

The Markov-Zariski topology of an infinite group

The Markov-Zariski topology of an infinite group Mimar Sinan Güzel Sanatlar Üniversitesi Istanbul January 23, 2014 joint work with Daniele Toller and Dmitri Shakhmatov 1. Markov s problem 1 and 2 2. The three topologies on an infinite group 3. Problem

More information

Continuity of the Perron Root

Continuity of the Perron Root Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

More information

CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY

CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY ANDREW T. CARROLL Notes for this talk come primarily from two sources: M. Barot, ICTP Notes Representations of Quivers,

More information

3. Linear Programming and Polyhedral Combinatorics

3. Linear Programming and Polyhedral Combinatorics Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

More information

CONTINUOUS REINHARDT DOMAINS PROBLEMS ON PARTIAL JB*-TRIPLES

CONTINUOUS REINHARDT DOMAINS PROBLEMS ON PARTIAL JB*-TRIPLES CONTINUOUS REINHARDT DOMAINS PROBLEMS ON PARTIAL JB*-TRIPLES László STACHÓ Bolyai Institute Szeged, Hungary stacho@math.u-szeged.hu www.math.u-szeged.hu/ Stacho 13/11/2008, Granada László STACHÓ () CONTINUOUS

More information

Quantum Computing: Lecture Notes. Ronald de Wolf

Quantum Computing: Lecture Notes. Ronald de Wolf Quantum Computing: Lecture Notes Ronald de Wolf Preface These lecture notes were formed in small chunks during my Quantum computing course at the University of Amsterdam, Feb-May 2011, and compiled into

More information

( ) which must be a vector

( ) which must be a vector MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

More information

Deterministic polynomial factoring and association schemes

Deterministic polynomial factoring and association schemes LMS J. Comput. Math. 17 (1) (2014) 123 140 C 2014 Authors doi:10.1112/s1461157013000296 Deterministic polynomial factoring and association schemes Manuel Arora, Gábor Ivanyos, Marek Karpinski and Nitin

More information

Keywords Quantum logic gates, Quantum computing, Logic gate, Quantum computer

Keywords Quantum logic gates, Quantum computing, Logic gate, Quantum computer Volume 3 Issue 10 October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Introduction

More information

Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers

Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers Quantum Computers And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015 1 Includes joint work with Amlan Chakrabarti, U. Calcutta If you were designing Nature, how would

More information

Applied Linear Algebra I Review page 1

Applied Linear Algebra I Review page 1 Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties

More information

Abstract Algebra Cheat Sheet

Abstract Algebra Cheat Sheet Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the

More information

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

G = G 0 > G 1 > > G k = {e}

G = G 0 > G 1 > > G k = {e} Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

More information

FIBER PRODUCTS AND ZARISKI SHEAVES

FIBER PRODUCTS AND ZARISKI SHEAVES FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also

More information

Bounds For the Effective Nullstellensatz Ideals in Italy

Bounds For the Effective Nullstellensatz Ideals in Italy Bounds for the Hilbert Function of Polynomial Ideals and for the Degrees in the Nullstellensatz Martín Sombra 1 Departamento de Matemática, Facultad de Ciencias Exactas, Universidad de Buenos Aires, 1428

More information

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Let H and J be as in the above lemma. The result of the lemma shows that the integral Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;

More information

On the structure of C -algebra generated by a family of partial isometries and multipliers

On the structure of C -algebra generated by a family of partial isometries and multipliers Armenian Journal of Mathematics Volume 7, Number 1, 2015, 50 58 On the structure of C -algebra generated by a family of partial isometries and multipliers A. Yu. Kuznetsova and Ye. V. Patrin Kazan Federal

More information

Ideal Class Group and Units

Ideal Class Group and Units Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

More information

1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES 1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

More information

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

More information

Master of Arts in Mathematics

Master of Arts in Mathematics Master of Arts in Mathematics Administrative Unit The program is administered by the Office of Graduate Studies and Research through the Faculty of Mathematics and Mathematics Education, Department of

More information

Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic Fields and Power Bases Michael Decker 12/07/07 Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is

More information

GENERATING SETS KEITH CONRAD

GENERATING SETS KEITH CONRAD GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

More information

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

More information

Open Problems in Quantum Information Processing. John Watrous Department of Computer Science University of Calgary

Open Problems in Quantum Information Processing. John Watrous Department of Computer Science University of Calgary Open Problems in Quantum Information Processing John Watrous Department of Computer Science University of Calgary #1 Open Problem Find new quantum algorithms. Existing algorithms: Shor s Algorithm (+ extensions)

More information

arxiv:1206.3686v1 [quant-ph] 16 Jun 2012

arxiv:1206.3686v1 [quant-ph] 16 Jun 2012 Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics. Dorit Aharonov and Umesh Vazirani June 19, 2012 arxiv:1206.3686v1 [quant-ph] 16 Jun 2012 Abstract

More information

Blocking sets of nonsecant lines to a conic in P G(2, q), q odd

Blocking sets of nonsecant lines to a conic in P G(2, q), q odd Blocking sets of nonsecant lines to a conic in P G(2, q), q odd A. Aguglia G. Korchmáros Abstract In a previous paper [1], all point set of minimum size in P G(2, q), blocking all external lines to a given

More information

Gauged supergravity and E 10

Gauged supergravity and E 10 Gauged supergravity and E 10 Jakob Palmkvist Albert-Einstein-Institut in collaboration with Eric Bergshoeff, Olaf Hohm, Axel Kleinschmidt, Hermann Nicolai and Teake Nutma arxiv:0810.5767 JHEP01(2009)020

More information

MATH1231 Algebra, 2015 Chapter 7: Linear maps

MATH1231 Algebra, 2015 Chapter 7: Linear maps MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter

More information

The components of a variety of matrices with square zero and submaximal rank

The components of a variety of matrices with square zero and submaximal rank The components of a variety of matrices with square zero and submaximal ran DIKRAN KARAGUEUZIAN Mathematics Department, SUNY Binghamton, Binghamton, NY 13902, USA E-mail: diran@math.binghamton.edu BOB

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

More information

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

More information

Quantum Computing and Grover s Algorithm

Quantum Computing and Grover s Algorithm Quantum Computing and Grover s Algorithm Matthew Hayward January 14, 2015 1 Contents 1 Motivation for Study of Quantum Computing 3 1.1 A Killer App for Quantum Computing.............. 3 2 The Quantum Computer

More information

Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I. Ronald van Luijk, 2012 Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.

More information

Methods for Finding Bases

Methods for Finding Bases Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

More information

RINGS WITH A POLYNOMIAL IDENTITY

RINGS WITH A POLYNOMIAL IDENTITY RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in

More information

Cameron Liebler line classes

Cameron Liebler line classes Cameron Liebler line classes Alexander Gavrilyuk Krasovsky Institute of Mathematics and Mechanics, (Yekaterinburg, Russia) based on joint work with Ivan Mogilnykh, Institute of Mathematics (Novosibirsk,

More information

Factoring by Quantum Computers

Factoring by Quantum Computers Factoring by Quantum Computers Ragesh Jaiswal University of California, San Diego A Quantum computer is a device that uses uantum phenomenon to perform a computation. A classical system follows a single

More information

Critical points via monodromy and local methods

Critical points via monodromy and local methods Critical points via monodromy and local methods Abraham Martín del Campo joint w/ Jose Rodriguez (U. Notre Dame) SIAM Conference on Applied Algebraic Geometry August 3, 2015 Abraham Martín del Campo (IST)

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Modélisation et résolutions numérique et symbolique

Modélisation et résolutions numérique et symbolique Modélisation et résolutions numérique et symbolique via les logiciels Maple et Matlab Jeremy Berthomieu Mohab Safey El Din Stef Graillat Mohab.Safey@lip6.fr Outline Previous course: partial review of what

More information

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued). MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

More information

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE

ON SUPERCYCLICITY CRITERIA. Nuha H. Hamada Business Administration College Al Ain University of Science and Technology 5-th st, Abu Dhabi, 112612, UAE International Journal of Pure and Applied Mathematics Volume 101 No. 3 2015, 401-405 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v101i3.7

More information

SMALL SKEW FIELDS CÉDRIC MILLIET

SMALL SKEW FIELDS CÉDRIC MILLIET SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite

More information

3 1. Note that all cubes solve it; therefore, there are no more

3 1. Note that all cubes solve it; therefore, there are no more Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

More information

160 CHAPTER 4. VECTOR SPACES

160 CHAPTER 4. VECTOR SPACES 160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results

More information

Row Ideals and Fibers of Morphisms

Row Ideals and Fibers of Morphisms Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

More information

Test1. Due Friday, March 13, 2015.

Test1. Due Friday, March 13, 2015. 1 Abstract Algebra Professor M. Zuker Test1. Due Friday, March 13, 2015. 1. Euclidean algorithm and related. (a) Suppose that a and b are two positive integers and that gcd(a, b) = d. Find all solutions

More information

α = u v. In other words, Orthogonal Projection

α = u v. In other words, Orthogonal Projection Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

CHAPTER 1 BASIC TOPOLOGY

CHAPTER 1 BASIC TOPOLOGY CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

Quantum Algorithms Lecture Notes Summer School on Theory and Technology in Quantum Information, Communication, Computation and Cryptography

Quantum Algorithms Lecture Notes Summer School on Theory and Technology in Quantum Information, Communication, Computation and Cryptography Quantum Algorithms Lecture Notes Summer School on Theory and Technology in Quantum Information, Communication, Computation and Cryptography Julia Kempe CNRS & LRI, Université de Paris-Sud 9405 Orsay, France

More information

DETERMINISTIC POLYNOMIAL FACTORING AND ASSOCIATION SCHEMES

DETERMINISTIC POLYNOMIAL FACTORING AND ASSOCIATION SCHEMES DETERMINISTIC POLYNOMIAL FACTORING AND ASSOCIATION SCHEMES MANUEL ARORA, GÁBOR IVANYOS, MAREK KARPINSKI, AND NITIN SAXENA Abstract. The problem of finding a nontrivial factor of a polynomial f(x) over

More information

Quantum Physics II (8.05) Fall 2013 Assignment 4

Quantum Physics II (8.05) Fall 2013 Assignment 4 Quantum Physics II (8.05) Fall 2013 Assignment 4 Massachusetts Institute of Technology Physics Department Due October 4, 2013 September 27, 2013 3:00 pm Problem Set 4 1. Identitites for commutators (Based

More information