서브메뉴
검색
Towards Practical Fault-Tolerant Quantum Computing
Towards Practical Fault-Tolerant Quantum Computing
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211151114
- ISBN
- 9798382775449
- DDC
- 530
- 저자명
- Xu, Qian.
- 서명/저자
- Towards Practical Fault-Tolerant Quantum Computing
- 발행사항
- [Sl] : The University of Chicago, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 215 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-12, Section: B.
- 주기사항
- Advisor: Jiang, Liang.
- 학위논문주기
- Thesis (Ph.D.)--The University of Chicago, 2024.
- 초록/해제
- 요약Quantum computers hold the promise of solving classically intractable problems. However, quantum systems are intrinsically faulty due to the environment-induced noise and decoherence. As such, fault-tolerant quantum computers, which can run a quantum computation successfully even if the physical operations are faulty, are needed for solving utility-scale problems. Building such a fault-tolerant quantum computer requires a fault-tolerant scheme, which replaces target quantum circuits with new circuits that involve extra qubits and more gates but are robust against all physical faults with the help of quantum error correction. The state-of-the-art fault-tolerant scheme, which we refer to as the baseline scheme, encodes qubits into planar surface-code patches and performs encoded logical operations via code deformations and lattice surgeries. However, its large space-time overhead, which requires millions of physical qubits and takes days for large computations, poses a formidable challenge for scaling quantum computing to practical levels. In this thesis, we introduce new fault-tolerant schemes by leveraging new hardware and coding features not previously considered by the baseline scheme. Specifically, we present new schemes for bosonic systems that feature an infinite-dimensional Hilbert space, design noise-tailored topological codes, and investigate low-overhead schemes on hardware with long-range connectivity using the recently developed quantum low-density-parity-check codes. Our results demonstrate that by incorporating these hardware-specific schemes and employing improved quantum codes, we can drastically reduce the overhead barrier towards practical fault-tolerant quantum computing.
- 일반주제명
- Physics
- 일반주제명
- Quantum physics
- 일반주제명
- Applied physics
- 일반주제명
- Computer science
- 일반주제명
- Theoretical physics
- 키워드
- Fault tolerance
- 키워드
- Stabilizer codes
- 기타저자
- The University of Chicago Molecular Engineering
- 기본자료저록
- Dissertations Abstracts International. 85-12B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017160771
■00520250211151114
■006m o d
■007cr#unu||||||||
■020 ▼a9798382775449
■035 ▼a(MiAaPQ)AAI31145113
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a530
■1001 ▼aXu, Qian.▼0(orcid)0000-0002-8738-9420
■24510▼aTowards Practical Fault-Tolerant Quantum Computing
■260 ▼a[Sl]▼bThe University of Chicago▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a215 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-12, Section: B.
■500 ▼aAdvisor: Jiang, Liang.
■5021 ▼aThesis (Ph.D.)--The University of Chicago, 2024.
■520 ▼aQuantum computers hold the promise of solving classically intractable problems. However, quantum systems are intrinsically faulty due to the environment-induced noise and decoherence. As such, fault-tolerant quantum computers, which can run a quantum computation successfully even if the physical operations are faulty, are needed for solving utility-scale problems. Building such a fault-tolerant quantum computer requires a fault-tolerant scheme, which replaces target quantum circuits with new circuits that involve extra qubits and more gates but are robust against all physical faults with the help of quantum error correction. The state-of-the-art fault-tolerant scheme, which we refer to as the baseline scheme, encodes qubits into planar surface-code patches and performs encoded logical operations via code deformations and lattice surgeries. However, its large space-time overhead, which requires millions of physical qubits and takes days for large computations, poses a formidable challenge for scaling quantum computing to practical levels. In this thesis, we introduce new fault-tolerant schemes by leveraging new hardware and coding features not previously considered by the baseline scheme. Specifically, we present new schemes for bosonic systems that feature an infinite-dimensional Hilbert space, design noise-tailored topological codes, and investigate low-overhead schemes on hardware with long-range connectivity using the recently developed quantum low-density-parity-check codes. Our results demonstrate that by incorporating these hardware-specific schemes and employing improved quantum codes, we can drastically reduce the overhead barrier towards practical fault-tolerant quantum computing.
■590 ▼aSchool code: 0330.
■650 4▼aPhysics
■650 4▼aQuantum physics
■650 4▼aApplied physics
■650 4▼aComputer science
■650 4▼aTheoretical physics
■653 ▼aFault tolerance
■653 ▼aQuantum computing
■653 ▼aQuantum error correction
■653 ▼aDiscrete-variable ancillae
■653 ▼aStabilizer codes
■690 ▼a0605
■690 ▼a0599
■690 ▼a0984
■690 ▼a0753
■690 ▼a0215
■71020▼aThe University of Chicago▼bMolecular Engineering.
■7730 ▼tDissertations Abstracts International▼g85-12B.
■790 ▼a0330
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17160771▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
