서브메뉴
검색
Near-Term Stepping Stones on the Path to Useful Quantum Computing
Near-Term Stepping Stones on the Path to Useful Quantum Computing
Detailed Information
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202105141
- ISBN
- 9798265410177
- DDC
- 530
- 서명/저자
- Near-Term Stepping Stones on the Path to Useful Quantum Computing
- 발행사항
- [Sl] : Harvard University, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 312 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 87-05, Section: B.
- 주기사항
- Advisor: Yelin, Susanne F.
- 학위논문주기
- Thesis (Ph.D.)--Harvard University, 2025.
- 초록/해제
- 요약In 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.
- 일반주제명
- Physics
- 일반주제명
- Quantum physics
- 일반주제명
- Applied physics
- 키워드
- Born machines
- 기타저자
- Harvard University Physics
- 기본자료저록
- Dissertations Abstracts International. 87-05B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017359581
■00520260202105141
■006m o d
■007cr#unu||||||||
■020 ▼a9798265410177
■035 ▼a(MiAaPQ)AAI32240689
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a530
■1001 ▼aMcClain Gomez, Abigail Lee.
■24510▼aNear-Term Stepping Stones on the Path to Useful Quantum Computing
■260 ▼a[Sl]▼bHarvard University▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a312 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-05, Section: B.
■500 ▼aAdvisor: Yelin, Susanne F.
■5021 ▼aThesis (Ph.D.)--Harvard University, 2025.
■520 ▼aIn 2000, David P. DiVincenzo proposed seven necessary criteria to construct a physical quantum computer. His requirements included device scalability, having well-defined qubits with long coherence times, and the ability to implement a universal gate set. Since then, research has propelled several experimental platforms to the forefront as contenders for quantum computing. The near-term implementations of these various architectures often face technical challenges -- such as limited scalability, short coherence times, or sub-universal computation -- leading to only a partial fulfillment of DiVincenzo's criteria. Despite device shortcomings, progress marches forward with increasingly useful demonstrations of quantum computation and simulation. Towards this end, the research compiled in this thesis presents novel quantum computing methods and applications that can be leveraged in the current era of constrained hardware capabilities. This thesis examines a diverse array of near-term topics, including the use of machine learning to aid in sample-efficient quantum state reconstruction via Born machines, methods to link distributed quantum simulators with incomplete information transfer for approximate fragmented simulation, universal computation with globally controlled analog simulators, and fast scrambling achieved with measurement-only quantum circuits.
■590 ▼aSchool code: 0084.
■650 4▼aPhysics
■650 4▼aQuantum physics
■650 4▼aApplied physics
■653 ▼aBorn machines
■653 ▼aQuantum machine learning
■653 ▼aQuantum simulators
■690 ▼a0605
■690 ▼a0599
■690 ▼a0215
■71020▼aHarvard University▼bPhysics.
■7730 ▼tDissertations Abstracts International▼g87-05B.
■790 ▼a0084
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17359581▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
Подробнее информация.
- Бронирование
- не существует
- моя папка
- Первый запрос зрения
- Non-Book Loan Application
- Nighttime Book Loan Application
Available after logging in.


