![]() This is the third edition updated September 2011. There are notes available for the courses An introduction to finite geometry in ![]() Read it to find out what it should be replaced by. Journal of Geometry and Journal of Combinatorial Theory, Series A.Ī quote from Lockhart's Lament "The mathematics curriculum doesn't need to be reformed, it needs to be scrapped". Institute of Communications Engineering, National Tsing Huan University. There is also a short background on codes and (n,r) arcs and a question relating to the attainability of the Griesmer bound. Quantum error-correcting codes and fault-tolerant quantum computation, 2020. I have compiled a table of the maximum lengths of three-dimensional linear codes, where the difference between the length and minimum distance is fixed. Alternatively, here is another video of a similar talk, but with a more coding theory bias, from the 3rd International Castle Meeting on Coding Theory and Applications, held in Cardona in September 2011. Here is a video of me trying to convince the participants of a BIRS (Banff International Research Station) workshop that it is a generalisation of Segre's ''arc is a conic'' theorem, the original proof of which is available here. Jaeger's conjecture on nowhere zero points for linear maps ( pdf), andįunctions over prime fields that do not determine all directions ( pdf).Ī proof of the MDS conjecture over prime fields (that linear maximum distance separable codes of dimension at most p have length at most p+1, where p is the number of elements in the field) is contained in this article. The MDS conjecture for linear codes ( pdf), The maximum weight of a linear code ( pdf),Īn alternative way to generalise the pentagon ( pdf), ![]() On sets defining few ordinary planes ( pdf), Maximum distance separable codes: recent advances and applications ( pdf), The following pdf files are edited from talks on Please e-mail me if you find any errors or have any comments. I have set-up an Erratum page for the books. There are also videos of the course I gave on Quantum Computation in the spring term of 2021. There are videos of the course I gave on Coding and Information theory in the spring term of 2020 that more or less follows the content of the book. The other entitled A Course in Algebraic Error-Correcting Codes was published by Birkhauser in May 2020. I have published two books, one entitled Finite Geometry and Combinatorial Applications, published in July 2015 by Cambridge University Press. My research interests include classical and quantum error-correcting codes, real and finite geometries, semifields and graphs and generally involve applying geometrical and linear algebra methods to these combinatorial objects. We will start with the basics: how to model errors on a quantum computer, what is a quantum. Additionally, the talk will be recorded and uploaded on our Youtube.Escola d'Enginyeria de Telecomunicacio i Aerospacial de Castelldefels The colloquium will be structured as follows: I will then discuss our efforts to engineer and build the next-generation of ion trap quantum devices. The presented experiments cover the initialization of a logical qubit, entangling two logical qubits via lattice surgery, the correction of qubit loss, and fault tolerant circuit design. In this presentation, I will introduce the basic concepts of quantum error correction and our efforts to demonstrate the required building blocks in an ion trap quantum information processor. Title: Quantum error correction in an ion trap quantum information processorĪbstract: Faithful operation of large-scale quantum computers will require error correction techniques that limit the effect of imperfections onto the algorithm's result. All costs for accommodations, meals, and travel from local airports to the summer school location will be covered by IBM. Learn more about the Tarrytown House Estate. Time/Venue: Wednesday, April 21 at 12 pm on Zoom The 2022 IBM Quantum Error Correction Summer School will take place in person at the Tarrytown House Estate in Tarrytown, New York, United States of America.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |