DOCSLIB.ORG

Annalesai595nokkala.Pdf (1.381Mb)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. I am also deeply greatful for the considerable freedom I’ve had to pursue my interests, and how even in the busiest of times, you’ve always had time for me. I count myself lucky to have been a part of such a warm and friendly work community. In particular, I am grateful for having great office mates throughout my thesis project. When I started in 2014, I was welcomed with open arms and big smiles by the senior PhD students, which immediately made me feel at home and accepted. As years went by and office mates changed, the room I was in eventually became known as "the quiet room", as the occupants all quietly focused on their work. I greatly appreciated this distraction-free atmosphere. I also wish to thank the many people from outside of my home university that I’ve had the honor to meet and work with during the thesis project. In particular, I want to thank Bassano, Fernando, Francesco, Giacomo, Guillermo, Nicolas, Rebecca, Roberta, and Valentina. Each of you made important contributions to this thesis project, and I am very proud of how it turned out. I hope our paths will cross again in the future! While perhaps having little impact on the Thesis contents, the project itself could not have been possible without financial support from Jenny and Antti Wihuri foundation for the first three years, for which I am grateful. I also wish to thank the Department of Physics and Astronomy of the University of Turku for employing me for the final year, during which this Thesis was written. Throughout my life, my family has been a source of support, encou- ragement and inspiration. Although I didn’t have many opportunities to interact with him directly, what I heard of my grandfather Hokee Minn (cosmology) inspired me to pursue a career in physics. Further sources of 3 inspiration came from my grandmother Eeva Kangasmaa-Minn (linguis- tics) and my father Seppo and mother Christina (both genetics). Thanks to the biology department moving to Quantum, the trip to a coffee break with my parents has been short and I’ve enjoyed many a cup of coffee while discussing science, my thesis project, and life in general. These occasions have been important to me. Finally, I wish to thank the brightest star in my life, Nina. Your love and support have kept me going. Contents Acknowledgements 3 Abstract 7 Tiivistelmä 9 List of publications 11 1 Introduction 13 2 Motivation for quantum networks 17 2.1 Graph theory .......................... 18 2.2Networktheory......................... 21 2.3 Quantum networks ....................... 24 3 Networks of quantum harmonic oscillators 29 3.1 On notation and conventions ................. 29 3.2 Definition of the quantum network .............. 30 3.3 Gaussian quantum dynamics ................. 33 3.4 Open quantum systems theory ................ 38 4 Quantum networks as environments 43 4.1 Network spectral density .................... 43 4.2 Engineering of spectral density ................ 46 4.3 Network non-Markovianity .................. 49 5 Probing of quantum networks 53 5.1 Minimal access probing . ................. 54 5.2 Full access probing ....................... 58 5.3 On network discrimination ................... 60 5 6 Network mediated transport and routing 63 6.1 Transport of quantum information .............. 63 6.2Theroutingproblem...................... 67 6.3Networkroutingcapacity................... 69 7 Experimental implementation of quantum networks 73 7.1 Implementation generalities .................. 73 7.2 Reconfigurable implementation of quantum complex networks 76 8 Conclusions 83 Bibliography 87 Original publications 97 6 Abstract This Thesis focuses on networks of interacting quantum harmonic oscil- lators and in particular, on them as environments for an open quantum system, their probing via the open system, their transport properties, and their experimental implementation. Exact Gaussian dynamics of such net- works is considered throughout the Thesis. Networks of interacting quantum systems have been used to model structured environments before, but most studies have considered either small or non-complex networks. Here this problem is addressed by inves- tigating what kind of environments complex networks of quantum systems are, with specific attention paid on the presence or absence of memory ef- fects (non-Markovianity) of the reduced open system dynamics. The prob- ing of complex networks is considered in two different scenarios: when the probe can be coupled to any system in the network, and when it can be coupled to just one. It is shown that for identical oscillators and uniform interaction strengths between them, much can be said about the network also in the latter case. The problem of discriminating between two networks is also discussed. While state transfer between two sites in a (typically non-complex) net- work is a well-known problem, this Thesis considers a more general setting where multiple parties send and receive quantum information simultane- ously through a quantum network. It is discussed what properties would make a network suited for efficient routing, and what is needed for a system- atic search and ranking of such networks. Finding such networks complex enough to be resilient to random node or link failures would be ideal. The merit and applicability of the work described so far depends cru- cially on the ability to implement networks of both reasonable size and complex structure, which is something the previous proposals lack. The ability to implement several different networks with a fixed experimental setup is also highly desirable. In this Thesis the problem is solved with a proposal of a fully reconfigurable experimental realization, based on map- 7 ping the network dynamics to a multimode optical platform. 8 Tiivistelmä Tämä väitöskirja keskittyy vuorovaikuttavien kvanttimekaanisten harmo- nisten oskillaattorien muodostamiin verkkoihin ja erityisesti niihin ympäris- töinä avoimelle kvanttisysteemille, niiden luotaamisen avoimen systeemin kautta, niiden siirto-ominaisuuksiin, ja niiden kokeelliseen toteutukseen. Väitöskirjassa käsitellään näiden verkkojen eksaktia Gaussista dynamiik- kaa. Vuorovaikuttavien kvanttisysteemien verkkoja on käytetty rakenteel- listen ympäristöjen malleina aikaisemmin, mutta usein on käsitelty joko pieniä tai ei-kompleksisia verkkoja. Tässä väitöskirjassa tähän ongelmaan vastataan tutkimalla millaisia ympäristöjä kvanttisysteemien muodostamat kompleksiset verkot ovat, kiinnittäen erityistä huomiota mahdollisiin muis- tiefekteihin (ei-Markovisuuteen) avoimen systeemin redusoidussa dynamii- kassa. Kompleksisten verkkojen luotausta tarkastellaan kahdessa eri ta- pauksessa: kun luotaimen voi kytkeä mihin tahansa verkon osaan, ja kun sen voi kytkeä vain yhteen. Tullaan näkemään että identtisille oskillaat- toreille ja vakiokytkentävoimakkuudelle niiden välillä myös jälkimmäisessä tapauksessa verkosta voi oppia paljon. Lyhyesti tarkastellaan myös ongle- maa jossa tutkitaan ovatko kaksi annettua verkkoa samat vai ei. Tilan siirto verkon kahden osan välillä on tunnettu ongelma. Tässä väi- töskirjassa tarkastellaan yleisempää ongelmaa missä useat osapuolet lähet- tävät ja vastaanottavat kvantti-informaatiota samanaikaisesti kvanttiver- kon kautta. Väitöskirjassa pohditaan mitkä ominaisuudet tekisivät verkos- ta sopivan tämän tehtävän tehokkaaseen toteuttamiseen, ja mitä tarvitaan jotta voitaisiin järjestelmällisesti etsiä ja luokitella verkkoja tätä tarkoitusta varten. Olisi ihanteellista löytää soveliaita verkkoja jotka olisivat riittävän kompleksisia sietääkseen satunnaisia osan tai linkin menetyksiä. Tähän asti kuvatun työn tärkeys ja soveltuvuus riippuu merkittävällä tavalla kyvystä toteuttaa kokeellisesti verkkoja jotka ovat sekä melko
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]
  • 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.
    [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]
  • 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]