Toggle menu
288
405
15
3.9K
QCLab
Toggle preferences menu
Toggle personal menu
Not logged in
Your IP address will be publicly visible if you make any edits.

Symbolic Quantum Simulation

From QCLab
이 프로그램의 일반과정(Regular Course)은 고려대 물리학과의 진리장학금 프로그램과 함께 운영됩니다. 진리장학금 프로그램 신청(2020년 6월 4일--19일)에 관해서는 물리학과 행정실에 문의하세요.
The core part of the superconducting quantum computer developed by IBM Q

양자컴퓨터는 일반 컴퓨터보다 왜 빠를까? 신문 잡지의 수많은 글이 있지만, 사실 위 질문에 대한 명쾌한 답을 주는 글은 거의 없다. 아이러니하게도 물리학과 양자역학을 수강한 학생이라면 위 질문에 대한 답을 쉽게 찾을 수 있다. 본 인턴 프로그램에서는 양자컴퓨터의 가장 기초적인 원리를 소개하고 몇 가지 대표적인 예를 통하여 양자컴퓨터가 일반 컴퓨터보다 왜 빠를 수 있는지 스스로 깨달을 수 있도록 한다. 이러한 모든 과정은 본 그룹에서 개발한 Mathematica(R) Application Q3를 이용함으로써 불필요하게 지루한 계산을 피할 수 있도록 할 예정이다.

Regular Course

  1. Introduction to the Quisso Package (1 week): You can try and get started with the Quisso package. The experienced graduate students in the QC Lab will guide you through installing and using the package. You will have chances to apply the package to some basic textbook examples of quantum mechanics.
  2. Single-Qubit Gate Operations (1 week): As the starting point of the quantum computing, single-qubit gate operations will be studied and their elementary properties will be examine. These properties will be used repeatedly in later studies on more advanced topics.
  3. Two-Qubit Gate Operations (1 week): In some sense, one can say that all the power of quantum computing is hidden in the two-qubit operations. Surprisingly, all two qubit operations are reduced to the single gate operation, i.e., CNOT. How? You can find it for yourself in this study.
  4. Multi-Qubit Controlled-U Gates (2 week): Many interesting tasks with quantum computers can be expressed in terms of a unitary gate controlled by multiple qubits. The efficiency of quantum algorithms crucially depends on how such a gate operation is implemented by means of elementary gates. There are several available methods. Some of them require only linearly-increasing computational costs while others are easier for a smaller number of qubits.
  5. Universal Quantum Computation (2 week): You will prove that any unitary operation eventually breaks down to single-qubit operations and CNOT gate.

Advanced Course

Motivated students are encouraged to move on to the Advanced Internship Program by choosing one of the following topics. Each topic would take half a semester or one depending on individual students.

  1. Shor's Factorization Algorithm: To be described later.
  2. Glover's Serrch Algorithm: To be described later.
  3. One-Way Quantum Computation: Introduction: To be described later.
  4. Quantum Computer Based on Superconducting Circuit: Introduction: To be described later.
  5. Quantum Information Theory: Inroduction: To be described later.