DOCSLIB.ORG

Book of Abstracts

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Book of Abstracts LANET 2017 Puebla (Mexico), September 25-29, 2017 1ST LATIN AMERICAN CONFERENCE ON COMPLEX NETWORKS AND LANET SCHOOL ON FUNDAMENTALS AND APPLICATIONS OF NETWORK SCIENCE LANET 2017 25-29 SEPTEMBER 2017 PUEBLA MEXICO BOOK OF ABSTRACTS ORGANIZED BY BENEMÉRITA UNIVERSIDAD AUTÓNOMA DE PUEBLA Benemérita Universidad Autónoma de Puebla LANET 2017 Puebla (Mexico), September 25-29, 2017 BENEMÉRITA UNIVERSIDAD DE PUEBLA LANET BOARD Rector Nuno Araujo (Universidade de Lisboa, Portugal) Dr. J. Alfonso Esparza Ortiz Pablo Balenzuela (Universidad de Buenos Aires, Argentina) Secretario General Javier M. Buldú (URJC & CTB, Spain) Dr. René Valdiviezo Sandoval Lidia Braunstein (CONICET-UNMdP, Argentina) Vicerrector de Investigación Mario Chávez (CNRS, Hospital Pitié-Salpetriere, France) Dr. Ygnacio Martínez Laguna Hilda Cerdeira (IFT-UNESP, Brazil) Directora del Instituto de Física Luciano da Fontoura (University of Sao Paulo, Brazil) Dra. Ma. Eugenia Mendoza Álvarez Bruno Gonçalves (New York University, USA) Rafael Germán Hurtado (Universidad Nacional de Colombia, Bogota) Ernesto Estrada (University of Strathclyde, UK) LOCAL ORGANIZING COMMITTEE Jesús Gómez-Gardeñes (Universidad de Zaragoza, Spain) José Antonio Méndez-Bermúdez Marta C. González (MIT, USA) (BUAP, Puebla, Mexico) Rafael Gutiérrez (Universidad Antonio Nariño, Colombia) Ygnacio Martínez Laguna Cesar Hidalgo (MIT Media Lab, USA) (BUAP, Puebla, Mexico) Gustavo Martínez-Mekler (UNAM, Mexico) Pedro Hugo Hernández Tejeda Johann H. Martínez (INSERM, France) (BUAP, Puebla, Mexico) Cristina Masoller (Universitat Politècnica de Catalunya, Spain) Javier M. Buldú José Luis Mateos (Instituto de Física, UNAM, Mexico) (URJC & CTB, Spain) José F. Mendes (University of Aveiro, Portugal) Jesús Gómez-Gardeñes José Antonio Méndez-Bermúdez (BUAP, Puebla Mexico) (Universidad de Zaragoza, Spain) Ronaldo Menezes (Florida Institute of Technology, USA) Johann H. Martínez Yamir Moreno (BIFI - UdZ, Spain) (INSERM, Francia) Adilson Motter (Northwestern University, USA) Ricardo Sevilla-Escoboza Gerard Olivar Tost (Universidad Nacional de Colombia, Colombia) (UDG-CULagos, Jalisco, México) Tiago Pereira (Universidade de Sao Paulo, Brazil) Osvaldo Rosso (Instituto Tecnológico de Buenos Aires, Argentina) Nicolás Rubido (Universidad de la República, Uruguay) Ricardo Sevilla-Escoboza (Universidad de Guadalajara, Mexico) Jose Soares de Andrade Jr. (Universidade Federal do Ceará, Brazil) Benemérita Universidad Autónoma de Puebla Program at a Glance Monday, September 25 Tuesday, September 26 Wednesday, September 27 8.00-9.00 REGISTRATION REGISTRATION REGISTRATION 9.00-9.15 Room 1: PT7 FORMAL OPENING The Scale Invariance of Crime 9.15-9.30 CCU Concentration in Cities Edif. Carolino: LANET Ronaldo Menezes 9.30-9.45 SCHOOL 1 Intro Networks 9.45-10.00 Ernesto Estrada CCU: PT3 A unified approach to percolation processes 10.00-10.15 on multiplex networks Room 1: MS3 Jose F.F. Mendes Explosive Transition in Networks 10.15-10.30 10.30-10.45 CCU: PT4 COFFEE BREAK Symmetric States Requiring System 10.45-11.00 Asymmetry in Network Synchronization COFFEE BREAK Adilson E. Motter 11.00-11.15 11.15-11.45 Edif. Carolino: LANET COFFEE BREAK SCHOOL 2 11.45-12.00 Contagion Processes Room 1: MS1 Jesus Gomez-Gardenes Networks, Games and Human Room 1: MS4 12.00-12.15 Behavior Southamerican Network Science 12.15-12.30 Room 2: MS2 Advances in Multiplex Networks 12.30-12.45 12.45-13.00 LUNCH BREAK LUNCH BREAK 13.30-13.45 13.45-14.00 14.00-14.15 14.15-14.30 Edif. Carolino: LANET LUNCH BREAK SCHOOL 3 14.30-14.45 Multilayer Networks Alex Arenas 14.45-15.00 Room 1: PT5 15.15-15.30 On the influence of competition and mutualism on the biodiversity of mutualistic 15.30-15.45 COFFEE BREAK ecosystems 15.45-16.00 Yamir Moreno 16.00-16.15 Room 1: C1 Visit to Cantona 16.15-16.30 Structure Edif. Carolino: LANET Room 2: C2 16.30-16.45 SCHOOL 4 Biological Applications Brain Networks 16.45-17.00 Javier Martin Buldú 17.00-17.15 COFFEE BREAK 17.15-17.30 17.30-17.45 Room 1: PT6 17.45-18.00 Spreading Processes on Networks Mason Alexander Porter 18.00-18.15 MAIN CONFERENCE BEGINS Edif. Carolino: PT1 18.15-18.30 Collective Phenomena Emergin from 18.30-18.45 Interactions Between Dynamical Processes in Multiplex Networks 18.45-19.00 Alex Arenas POSTER SESSION AND 19.00-19.15 COCKTAIL 19.15-19.30 Conference Hall 19.30-19.45 Reception Cocktail 19.45-20.00 and Registration CONFERENCE DINNER 20.00-20.30 Hotel Colonial 1st Latin American Conference on Complex Networks 2017 7 Program at a Glance Thursday, September 28 Friday, September 29 8.45-9.00 REGISTRATION REGISTRATION Room 1: PT9 9.00-9.15 Room 1: PT12 Long-range influences and dynamics on Spatio temporal analysis of language use 9.15-9.30 networks Bruno Gonçalves Ernesto Estrada 9.30-9.45 Room 1: PT10 9.45-10.00 Room 1: PT13 Network-based data analysis tools for Brain networks: is complexity jumping the identifying and characterizing dynamical 10.00-10.15 shark? transition in complex systems Mario Chávez 10.15-10.30 Cristina Masoller 10.30-10.45 COFFEE BREAK COFFEE BREAK 10.45-11.00 11.00-11.15 Room 2: C3 Synchronization and Brain Room 2: C11 11.15-11.30 Room 1: C4 Synchronization Interdisciplinary Applications Room 1: C12 11.30-11.45 Social Dynamics 11.45-12.00 12.00-12.30 Room 2: MS5 12.30-12.45 Colombian Networks Room 1: MS6 Room 1: MS7 12.45-13.00 Nonlinear Dynamical Dynamics of Networks and 13.00-13.15 Room 2: MS8 Complex Networks Network Biology Approaches to 13.15-13.30 Understand Complex Diseases 13.30-13.45 13.45-14.00 14.00-14.15 14.15-14.30 LUNCH BREAK 14.30-14.45 LUNCH BREAK 14.45-15.00 15.00-15.15 15.15-15.30 Room 1: PT11 Room 1: PT14 Synchronization in populations of moving Dynamics and Effective Connectivity in 15.30-15.45 oscillators Neural Cultures A. Diaz-Guilera Jordi Soriano-Fradera 15.45-16.00 16.00-16.15 Room 1: C13 Statical Physics and Critical 16.15-16.30 Room 2: C5 Structure Phenomena 16.30-16.45 Room 1: C6 Room 2: C14 Network Dynamics Network Dynamics 16.45-17.00 17.00-17.15 COFFEE BREAK COFFEE BREAK 17.15-17.30 17.30-17.45 Room 2: C7 CLOSING Epidemics 17.45-18.00 Room 1: C8 Spanish Session 18.00-18.15 18.15-18.30 Room 2: C9 Epidemics 18.30-18.45 Room 1: C10 Spanish Session 18.45-19.00 8 1st Latin American Conference on Complex Networks 2017 EXTENDED PROGRAM MONDAY, September 25, 2017 LANET SCHOOL REGISTRATION 8.15–9.00 LANET SCHOOL 1: Intro Networks 9.00–10.30 Network Analytics. Traditional vs. non-traditional methods Ernesto Estrada Auditorio (Edif. Carolino) Coffee break 10.30–11.00 LANET SCHOOL 2: Contagion Processes 11.00–12.30 Contagion Processes Jesus Gomez-Gardenes Auditorio (Edif. Carolino) Lunch break 12.30–14.00 LANET SCHOOL 3: Multilayer Networks 14.00–15.30 Mutilayer Networks Alex Arenas Auditorio (Edif. Carolino) Coffee break 15.30–16.00 LANET SCHOOL 4: Brain Networks 16.00–17.30 Brain Networks Javier Martin Buldú Auditorio (Edif. Carolino) MAIN CONFERENCE BEGINS 18.00–18.15 PT1: Plenary Talk Chair: Javier M. Buldú 18.15–19.00 Collective Phenomena Emerging from the Interactions Between Dynamical Processes in Multi- Auditorio (Edif. plex Networks Alex Arenas Carolino) Reception Cocktail and Registration to the Conference 19.00–20.30 1st Latin American Conference on Complex Networks 2017 11 TUESDAY 8.15–9.00 Registration 9.00–9.45 Formal Opening (Theatre CCU) 9.45–10.30 PT3: Plenary Talk Chair: Albert Díaz-Guilera Theatre CCU A unified approach to percolation processes on multiplex networks Jose F.F. Mendes 10.30–11.15 PT4: Plenary Talk Chair: Mason Porter Theatre CCU Symmetric States Requiring System Asymmetry in Network Synchronization Adilson E. Motter 11.15–11.45 Coffee break 11.45–13.45 MS1: "Networks, Games and Human Behavior" Room 1 Organizers: Alberto Antonioni and Federico Battiston 1. Promoters of Human Cooperation: Results from the Lab Yamir Moreno 2. How to model the decision making process in Game Theory experiments Jelena Grujic´ 3. Investigating the Coevolution of Institutions within an Adaptive Multiplex Network Model Francesca Lipari 4. Sequence of purchases in credit card data reveal life styles in urban populations Marta Gonzalez 5. Reputation Drives Cooperative Behavior and Network Formation in Human Groups Carlos Gracia-Lázaro 6. Spatial patterns in evolutionary games on scale-free networks and multiplexes Kolja Kleineberg 11.45–13.45 MS2: "Advances in Multiplex Networks" Room 2 Organizers: Sergio Gómez 1. Community Structure in Multilayer Networks Mason A. Porter 2. Communicability geometry in multiplexes Ernesto Estrada 3. Diffusion and reaction on multiplex networks Albert Diaz-Guilera 4. Epidemic spreading in localized environments with recurrent mobility patterns Clara Granell 13.45–15.15 Lunch break 15.15–16.00 PT5: Plenary Talk Chair: Antonio Méndez-Bermúdez Room 1 On the influence of competition and mutualism on the biodiversity of mutualistic ecosystems Yamir Moreno 16.00–17.00 C1: Structure Room 1 Chair: Alex Arenas 1. Geometric correlations mitigate the extreme vulnerability of multiplex networks against targeted attacks Kaj Kolja Kleineberg 2. Beyond classical metrics on complex Nethali Fernando 3. Mathematical analysis of k-path Laplacian operators on networks Ehsan Hameed 16.00–17.00 C2: Biological Applications Room 2 Chair: Jordi Soriano 1. The joint influence of competition and mutualism on the biodiversity of mutualistic ecosys- tems. Carlos Gracia-Lázaro 2. The use of a drug-gene perturbation network for the study of drug side effects: The case of drug-induced peripheral neuropathy Guillermo de Anda-Juáregui 3.
Load more

Recommended publications
  • CLEO/Europe-EQEC 2021 Advance Programme
    2021 Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference Advance Programme Virtual Meeting CEST time zone 21 - 25 June 2021 www.cleoeurope.org Sponsored by • European Physical Society / Quantum Electronics and Optics Division • IEEE Photonics Society • The Optical Society 25th International Congress on Photonics in Europe Collocated with Laser World of Photonics Industry Days https://world-of-photonics.com/en/ 10th EPS-QEOD Europhoton Conference EUROPHOTON SOLID-STATE, FIBRE, AND WAVEGUIDE COHERENT LIGHT SOURCES 28 August – 02 September 2022 Hannover, Germany www.europhoton.org Fotos: © HMTG - Lars Gerhardts Fotos: © HMTG Table of contents TABLE OF CONTENTS Welcome and Foreword 02 Days at a Glance 04 Sessions at a Glance 14 How to Read the Session Codes? 15 How to Find the Room? 17 Topics 20 General Information 24 Technical Programme 28 01 Welcome and foreword Welcome to the 2021 Conference CLEO®/Europe will showcase the latest Particular highlights of the 2021 programme 2021 Conference on Lasers and on Lasers and Electro-Optics developments in a wide range of laser and will be a series of symposia: Electro-Optics Europe & European Europe & European Quantum photonics areas including solid-state lasers, Nanophononics, High-Field THz Genera- Quantum Electronics Conference Electronics Conference (hereafter semiconductor lasers, terahertz sources and tion and Applications, Attochemistry, Deep CLEO®/Europe-EQEC) at the World applications, applications of nonlinear op- learning in Photonics and Flexible Photonics. CLEO®/Europe - EQEC 2021 of Photonics Congress 2021 tics, optical materials, optical fabrication and Additionally, two joint sessions (EC- characterization, ultrafast optical technologies, BO-CLEO®/Europe and LiM-CLEO®/Europe) Virtual Meeting high-field laser and attosecond science, optical will be held.
    [Show full text]
  • Reconfigurable Optical Implementation of Quantum Complex Networks J Nokkala, F
    Reconfigurable optical implementation of quantum complex networks J Nokkala, F. Arzani, F Galve, R Zambrini, S Maniscalco, J Piilo, Nicolas Treps, V Parigi To cite this version: J Nokkala, F. Arzani, F Galve, R Zambrini, S Maniscalco, et al.. Reconfigurable optical implemen- tation of quantum complex networks. New Journal of Physics, Institute of Physics: Open Access Journals, 2018, 20, pp.053024. 10.1088/1367-2630/aabc77. hal-01798144 HAL Id: hal-01798144 https://hal.sorbonne-universite.fr/hal-01798144 Submitted on 23 May 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution| 4.0 International License PAPER • OPEN ACCESS Related content - An Introduction to the Formalism of Reconfigurable optical implementation of quantum Quantum Information with Continuous Variables: Quantum information with continuous variables complex networks C Navarrete-Benlloch - Spacetime replication of continuous To cite this article: J Nokkala et al 2018 New J. Phys. 20 053024 variable quantum information Patrick Hayden, Sepehr Nezami, Grant Salton et al. - Coupled harmonic systems as quantum buses in thermal environments View the article online for updates and enhancements. F Nicacio and F L Semião This content was downloaded from IP address 134.157.80.157 on 23/05/2018 at 09:58 New J.
    [Show full text]
  • Quantum Key Distribution Protocols and Applications
    Quantum Key Distribution Protocols and Applications Sheila Cobourne Technical Report RHUL{MA{2011{05 8th March 2011 Department of Mathematics Royal Holloway, University of London Egham, Surrey TW20 0EX, England http://www.rhul.ac.uk/mathematics/techreports Title: Quantum Key Distribution – Protocols and Applications Name: Sheila Cobourne Student Number: 100627811 Supervisor: Carlos Cid Submitted as part of the requirements for the award of the MSc in Information Security at Royal Holloway, University of London. I declare that this assignment is all my own work and that I have acknowledged all quotations from the published or unpublished works of other people. I declare that I have also read the statements on plagiarism in Section 1 of the Regulations Governing Examination and Assessment Offences and in accordance with it I submit this project report as my own work. Signature: Date: Acknowledgements I would like to thank Carlos Cid for his helpful suggestions and guidance during this project. Also, I would like to express my appreciation to the lecturers at Royal Holloway who have increased my understanding of Information Security immensely over the course of the MSc, without which this project would not have been possible. Contents Table of Figures ................................................................................................... 6 Executive Summary ............................................................................................. 7 Chapter 1 Introduction ...................................................................................
    [Show full text]
  • Gr Qkd 003 V2.1.1 (2018-03)
    ETSI GR QKD 003 V2.1.1 (2018-03) GROUP REPORT Quantum Key Distribution (QKD); Components and Internal Interfaces Disclaimer The present document has been produced and approved by the Group Quantum Key Distribution (QKD) ETSI Industry Specification Group (ISG) and represents the views of those members who participated in this ISG. It does not necessarily represent the views of the entire ETSI membership. 2 ETSI GR QKD 003 V2.1.1 (2018-03) Reference RGR/QKD-003ed2 Keywords interface, quantum key distribution ETSI 650 Route des Lucioles F-06921 Sophia Antipolis Cedex - FRANCE Tel.: +33 4 92 94 42 00 Fax: +33 4 93 65 47 16 Siret N° 348 623 562 00017 - NAF 742 C Association à but non lucratif enregistrée à la Sous-Préfecture de Grasse (06) N° 7803/88 Important notice The present document can be downloaded from: http://www.etsi.org/standards-search The present document may be made available in electronic versions and/or in print. The content of any electronic and/or print versions of the present document shall not be modified without the prior written authorization of ETSI. In case of any existing or perceived difference in contents between such versions and/or in print, the only prevailing document is the print of the Portable Document Format (PDF) version kept on a specific network drive within ETSI Secretariat. Users of the present document should be aware that the document may be subject to revision or change of status. Information on the current status of this and other ETSI documents is available at https://portal.etsi.org/TB/ETSIDeliverableStatus.aspx If you find errors in the present document, please send your comment to one of the following services: https://portal.etsi.org/People/CommiteeSupportStaff.aspx Copyright Notification No part may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying and microfilm except as authorized by written permission of ETSI.
    [Show full text]
  • Towards a Novel Environment for Simulation of Quantum Computing
    Computer Science 16 (1) 2015 http://dx.doi.org/10.7494/csci.2015.16.1.103 • Joanna Patrzyk Bartłomiej Patrzyk Katarzyna Rycerz Marian Bubak TOWARDS A NOVEL ENVIRONMENT FOR SIMULATION OF QUANTUM COMPUTING Abstract In this paper, we analyze existing quantum computer simulation techniqu- es and their realizations to minimize the impact of the exponential complexity of simulated quantum computations. As a result of this investigation, we pro- pose a quantum computer simulator with an integrated development environ- ment – QuIDE – supporting the development of algorithms for future quantum computers. The simulator simplifies building and testing quantum circuits and understanding quantum algorithms in an efficient way. The development envi- ronment provides flexibility of source code edition and ease of the graphical building of circuit diagrams. We also describe and analyze the complexity of algorithms used for simulation as well as present performance results of the simulator as well as results of its deployment during university classes. Keywords quantum computation, quantum computer simulators, development environment, quantum algorithms, SUS survey Citation Computer Science 16 (1) 2015: 103–129 103 8 kwietnia 2015 str. 1/27 104 Joanna Patrzyk, Bartłomiej Patrzyk, Katarzyna Rycerz, Marian Bubak 1. Introduction In recent years, the field of quantum computing has developed significantly. In [25] and [30], the results of experimental realizations of Shor’s Prime Factorization Algorithm [44] are presented. Moreover, the first prototypes of a quantum central processing unit were built: one realizing the von Neumann’s architecture [28] and another exploiting quantum annealing [21, 24]. Quantum computers can offer an exponential speedup compared to conventional computers [7].
    [Show full text]
  • Arxiv:1609.01214V1 [Physics.Soc-Ph] 5 Sep 2016
    Spectral entropies as information-theoretic tools for complex network comparison Manlio De Domenico1 and Jacob Biamonte2, 3 1Departament d'Enginyeria Inform`atica i Matem`atiques, Universitat Rovira i Virgili, 43007 Tarragona, Spain 2Quantum Complexity Science Initiative Department of Physics, University of Malta, MSD 2080 Malta 3Institute for Quantum Computing University of Waterloo, Waterloo, N2L 3G1 Ontario, Canada Any physical system can be viewed from the perspective that information is implicitly represented in its state. However, the quantification of this information when it comes to complex networks has remained largely elusive. In this work, we use techniques inspired by quantum statistical mechanics to define an entropy measure for complex networks and to develop a set of information-theoretic tools, based on network spectral properties, such as R´enyi q−entropy, generalized Kullback-Leibler and Jensen-Shannon divergences, the latter allowing us to define a natural distance measure between com- plex networks. First we show that by minimizing the Kullback-Leibler divergence between an observed network and a parametric network model, inference of model parameter(s) by means of maximum-likelihood estimation can be achieved and model selection can be performed appropriate information criteria. Second, we show that the information-theoretic metric quantifies the distance between pairs of networks and we can use it, for instance, to cluster the layers of a multilayer system. By applying this framework to networks corresponding to sites of the human microbiome, we perform hierarchical cluster analysis and recover with high accuracy existing community-based associations. Our results imply that spectral based statistical inference in complex net- works results in demonstrably superior performance as well as a conceptual backbone, filling a gap towards a network information theory.
    [Show full text]
  • Annalesai595nokkala.Pdf (1.381Mb)
    ANNALES ANNALES TURKUENSIS UNIVERSITATIS AI 595 AI Johannes Nokkala QUANTUM COMPLEX NETWORKS Johannes Nokkala Grano Oy, Turku , Finland 2018 , Finland Turku Oy, Grano ISBN 978-951-29-7467-2 (PRINT) TURUN YLIOPISTON JULKAISUJA – ANNALES UNIVERSITATIS TURKUENSIS ISBN 978-951-29-7468-9 (PDF) SARJA - SER. AI OSA - TOM. 595 | ASTRONOMICA - CHEMICA - PHYSICA - MATHEMATICA | TURKU 2018 ISSN 0082-7002 (Print) ISSN 2343-3175 (Online) 30934012_Turun_yliopisto_Vaitoskirja_Johannes_Nokkala_Luonn_tiet_ja_tekniikan_kansi_18_10_29.indd 1 29.10.2018 11.37.41 QUANTUM COMPLEX NETWORKS Johannes Nokkala TURUN YLIOPISTON JULKAISUJA – ANNALES UNIVERSITATIS TURKUENSIS SARJA - SER. AI OSA - TOM. 595 | ASTRONOMICA - CHEMICA - PHYSICA - MATHEMATICA | TURKU 2018 University of Turku Faculty of Science and Engineering Department of Physics and Astronomy Supervised by Sabrina Maniscalco Jyrki Piilo Department of Physics and Astronomy Department of Physics and Astronomy University of Turku University of Turku Finland Finland Reviewed by Ginestra Bianconi Marco Genoni School of Mathematical Sciences Department of Physics Queen Mary University of London University of Milan United Kingdom Italy Opponent Sougato Bose Department of Physics and Astronomy University College London United Kingdom The originality of this thesis has been checked in accordance with the University of Turku quality assurance system using the Turnitin Originality Check service. ISBN 978-951-29-7467-2 (PRINT) ISBN 978-951-29-7468-9 (PDF) ISSN 0082-7002 (Print) ISSN 2343-3175 (Online) Grano Oy - Turku, Finland 2018 Acknowledgements First and foremost, I would like to thank my supervisors Jyrki and Sabrina for being my guides on my journey towards thesis defense. Your foresight and experience, the many ideas and discussions, and your continuous sup- port have been invaluable.
    [Show full text]
  • Graph Minor from Wikipedia, the Free Encyclopedia Contents
    Graph minor From Wikipedia, the free encyclopedia Contents 1 2 × 2 real matrices 1 1.1 Profile ................................................. 1 1.2 Equi-areal mapping .......................................... 2 1.3 Functions of 2 × 2 real matrices .................................... 2 1.4 2 × 2 real matrices as complex numbers ............................... 3 1.5 References ............................................... 4 2 Abelian group 5 2.1 Definition ............................................... 5 2.2 Facts ................................................. 5 2.2.1 Notation ........................................... 5 2.2.2 Multiplication table ...................................... 6 2.3 Examples ............................................... 6 2.4 Historical remarks .......................................... 6 2.5 Properties ............................................... 6 2.6 Finite abelian groups ......................................... 7 2.6.1 Classification ......................................... 7 2.6.2 Automorphisms ....................................... 7 2.7 Infinite abelian groups ........................................ 8 2.7.1 Torsion groups ........................................ 9 2.7.2 Torsion-free and mixed groups ................................ 9 2.7.3 Invariants and classification .................................. 9 2.7.4 Additive groups of rings ................................... 9 2.8 Relation to other mathematical topics ................................. 10 2.9 A note on the typography ......................................
    [Show full text]
  • Arxiv:2005.09665V2 [Quant-Ph] 31 Jul 2020 1
    Probing the spectral dimension of quantum network geometries Johannes Nokkala Instituto de F´ısicaInterdisciplinar y Sistemas Complejos (IFISC, UIB-CSIC), Campus Universitat de les Illes Balears E-07122, Palma de Mallorca, Spain E-mail: [email protected] Jyrki Piilo Turku Centre for Quantum Physics, Department of Physics and Astronomy, University of Turku, FI-20014 Turun yliopisto, Finland E-mail: [email protected] Ginestra Bianconi School of Mathematical Sciences, Queen Mary University of London, London, E1 4NS, United Kingdom Alan Turing Institute, The British Library, London, United Kingdom E-mail: [email protected] Abstract. We consider an environment for an open quantum system described by a \Quantum Network Geometry with Flavor" (QNGF) in which the nodes are coupled quantum oscillators. The geometrical nature of QNGF is reflected in the spectral properties of the Laplacian matrix of the network which display a finite spectral dimension, determining also the frequencies of the normal modes of QNGFs. We show that an a priori unknown spectral dimension can be indirectly estimated by coupling an auxiliary open quantum system to the network and probing the normal mode frequencies in the low frequency regime. We find that the network parameters do not affect the estimate; in this sense it is a property of the network geometry, rather than the values of, e.g., oscillator bare frequencies or the constant coupling strength. Numerical evidence suggests that the estimate is also robust both to small changes in the high frequency cutoff and noisy or missing normal mode frequencies. We propose to couple the auxiliary system to a subset of network nodes with random coupling strengths to reveal and resolve a sufficiently large subset of normal mode frequencies.
    [Show full text]
  • Security of Two Quantum Cryptography Protocols Using the Same Four Qubit States
    PHYSICAL REVIEW A 72, 032301 ͑2005͒ Security of two quantum cryptography protocols using the same four qubit states Cyril Branciard,1,2 Nicolas Gisin,1 Barbara Kraus,1 and Valerio Scarani1 1Group of Applied Physics, University of Geneva, 20, rue de l’Ecole-de-Médecine, 1211 Geneva 4, Switzerland 2Ecole Nationale Supérieure des Télécommunications, 46, rue Barrault, 75013 Paris, France ͑Received 10 May 2005; published 1 September 2005͒ The first quantum cryptography protocol, proposed by Bennett and Brassard in 1984 ͑BB84͒, has been widely studied in recent years. This protocol uses four states ͑more precisely, two complementary bases͒ for the encoding of the classical bit. Recently, it has been noticed that by using the same four states, but a different encoding of information, one can define a protocol which is more robust in practical implementations, specifi- cally when attenuated laser pulses are used instead of single-photon sources ͓V. Scarani et al., Phys. Rev. Lett. 92, 057901 ͑2004͒, referred to as the SARG04 protocol͔. We present a detailed study of SARG04 in two different regimes. In the first part, we consider an implementation with a single-photon source: we derive bounds on the error rate Q for security against all possible attacks by the eavesdropper. The lower and the upper bound obtained for SARG04 ͑QՇ10.95% and Qտ14.9%, respectively͒ are close to those obtained for BB84 ͑QՇ12.4% and Qտ14.6%, respectively͒. In the second part, we consider a realistic source consisting of an attenuated laser and improve on previous analysis by allowing Alice to optimize the mean number of photons as a function of the distance.
    [Show full text]
  • FPGA Emulation of Quantum Circuits
    FPGA Emulation of Quantum Circuits Ahmed Usman Khalid Zeljko Zilic Katarzyna Radecka Microelectronics and Computer Microelectronics and Computer Department of Electrical and Systems Laboratory Systems Laboratory Computer Engineering McGill University McGill University Concordia University Montreal, Quebec Montreal, Quebec Montreal, Quebec Email: [email protected] Email: [email protected] Email: [email protected] Abstract— Quantum computing offers immense speedup in tems, it is advantageous to have a hardware emulator which performing tasks such as data encryption and searching. The approximates quantum effects, but mimics the parallel nature quantum algorithms can be modeled using classical computing of quantum computation more closely than software-based devices, however classical computer simulations cannot deal efficiently with the parallelism present in quantum algorithms. simulators. The quantum circuit model for quantum algorithms is sufficient Quantum circuits are one convenient way of describing to describe the known quantum algorithms. Using analogies quantum algorithms. Such circuits comprise of analogues to between quantum and digital circuits, we design the emulator of digital bits and gates. These components can be emulated quantum algorithms in FPGAs that allows efficient experimen- in existing FPGAs, which can map inherently parallel com- tation with new quantum algorithms. This paper concentrates on new techniques for modeling quantum circuits, including the putational tasks more efficiently than software simulations. entanglement and probabilistic computing realization, as well as For this reason, we investigate the design of quantum circuit the critical issues in the required precision of computing. emulators by classical circuits, and devise an FPGA-based quantum circuit emulator. Using quantum circuit primitives, I. INTRODUCTION the construction of new quantum algorithms becomes intuitive There is an increased interest in quantum computing and and similar to the common software library approaches.
    [Show full text]
  • Advances in Quantum Cryptography
    Advances in Quantum Cryptography S. Pirandola1,2, U. L. Andersen3, L. Banchi4, M. Berta5, D. Bunandar2, R. Colbeck6, D. Englund2, T. Gehring3, C. Lupo7, C. Ottaviani1, J. Pereira1, M. Razavi8, J. S. Shaari9,10, M. Tomamichel11, V. C. Usenko12, G. Vallone13, P. Villoresi13, P. Wallden14 1Computer Science and York Centre for Quantum Technologies, University of York, York YO10 5GH, UK 2Research Laboratory of Electronics, Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts 02139, USA 3Center for Macroscopic Quantum States (bigQ), Department of Physics, Technical University of Denmark, Fysikvej, 2800 Kgs. Lyngby, Denmark 4Department of Physics and Astronomy, University of Florence, via G. Sansone 1, I-50019 Sesto Fiorentino (FI), Italy 5Department of Computing, Imperial College, Kensington, London SW7 2AZ, UK 6Department of Mathematics, University of York, York YO10 5DD, UK 7Department of Physics and Astronomy, University of Sheffield, Sheffield S3 7RH, UK 8School of Electronic and Electrical Engineering, University of Leeds, Leeds, LS2 9JT, UK 9Faculty of Science, International Islamic University Malaysia (IIUM), Jalan Sultan Ahmad Shah, 25200 Kuantan, Pahang, Malaysia 10Institute of Mathematical Research (INSPEM), University Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia 11Centre for Quantum Software and Information, School of Software, University of Technology Sydney, Sydney NSW 2007, Australia 12Department of Optics, Palacky University, 17. listopadu 50, 772 07 Olomouc, Czech Republic 13Dipartimento di Ingegneria dell’Informazione, Universit´adegli Studi di Padova, via Gradenigo 6B, 35131 Padova, Italy and 14School of Informatics, University of Edinburgh, 10 Crichton Street, Edinburgh EH8 9AB, UK Quantum cryptography is arguably the fastest growing area in quantum information science. Novel theoretical protocols are designed on a regular basis, security proofs are constantly improv- ing, and experiments are gradually moving from proof-of-principle lab demonstrations to in-field implementations and technological prototypes.
    [Show full text]