Advertisement

Towards a Scalable Quantum Computing Platform in the Ultrastrong Coupling Regime

  • Thi Ha Kyaw

Part of the Springer Theses book series (Springer Theses)

Table of contents

  1. Front Matter
    Pages i-xix
  2. Thi Ha Kyaw
    Pages 1-6
  3. Thi Ha Kyaw
    Pages 33-45
  4. Thi Ha Kyaw
    Pages 65-78
  5. Thi Ha Kyaw
    Pages 79-97
  6. Thi Ha Kyaw
    Pages 99-104
  7. Back Matter
    Pages 105-116

About this book

Introduction

The thesis devotes three introductory chapters to outline basic recipes to construct quantum Hamiltonian of an arbitrary superconducting circuit, starting from classical circuit design. Since superconducting circuit is one of the most promising platforms towards a practical quantum computer, anyone who is starting the field would be profoundly benefited from this thesis, and should be able to pick it up timely. The second focus of the introduction is the ultrastrong light-matter interaction (USC), summarizing latest developments in the community. It is then followed by the three main research work comprising- quantum memory in USC, scaling up the 1D circuit to 2D lattice configuration, creation of Noisy Intermediate-Scale Quantum era quantum error correction codes and polariton-mediated qubit-qubit interaction. We believe that the research work detailed in this thesis would eventually lead to development of quantum random access memory which is needed for various quantum machine learning algorithms and applications. 

Keywords

Scalable Quantum Computing Superconducting Qubit Ultrastrong Light-matter Interaction Quantum Random Access Memory Polariton-mediated Quantum Information Realizing Quantum Computers

Authors and affiliations

  • Thi Ha Kyaw
    • 1
  1. 1.Bahen Centre for Information TechnologyUniversity of TorontoTorontoCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-030-19658-5
  • Copyright Information Springer Nature Switzerland AG 2019
  • Publisher Name Springer, Cham
  • eBook Packages Physics and Astronomy
  • Print ISBN 978-3-030-19657-8
  • Online ISBN 978-3-030-19658-5
  • Series Print ISSN 2190-5053
  • Series Online ISSN 2190-5061
  • Buy this book on publisher's site