본문

New Quantum Algorithms and Analyses for Hamiltonian Simulation
New Quantum Algorithms and Analyses for Hamiltonian Simulation
New Quantum Algorithms and Analyses for Hamiltonian Simulation

상세정보

자료유형  
 학위논문 서양
최종처리일시  
20250211151504
ISBN  
9798383215777
DDC  
530.1
저자명  
Watkins, Jacob.
서명/저자  
New Quantum Algorithms and Analyses for Hamiltonian Simulation
발행사항  
[Sl] : Michigan State University, 2024
발행사항  
Ann Arbor : ProQuest Dissertations & Theses, 2024
형태사항  
193 p
주기사항  
Source: Dissertations Abstracts International, Volume: 86-01, Section: B.
주기사항  
Advisor: Lee, Dean.
학위논문주기  
Thesis (Ph.D.)--Michigan State University, 2024.
초록/해제  
요약Digital quantum Hamiltonian simulation is, by now, a relatively mature field of study; however, new investigations are justified by the importance of quantum simulation for scientific and societal applications. In this dissertation, we discuss several advances in circuit-based Hamiltonian simulation.First, following two introductory chapters, we consider the mitigation of Trotter errors using Chebyshev interpolation, a standard yet powerful function approximation technique. Implications for estimating time-evolved expectation values are discussed, and a rigorous analysis of errors and complexity show near optimal estimation of dynamical expectation values using only Trotter and constant overhead. We supplement our theoretical findings with numerical demonstrations on a 1D random Heisenberg model.Next, we introduce a computational reduction from time dependent to time independent Hamiltonian simulation based on the standard (\uD835\uDC61, \uD835\uDC61') technique. Our approach achieves two advances. First, we provide an algorithm for simulating time dependent Hamiltonians using qubitization, an optimal algorithm that cannot handle time-ordering directly. Second, we provide an algorithm for time dependent simulation using a natural generalization of multiproduct formulas, achieving higher accuracies than product formulas while retaining commutator scaling. Rigorous performance analyses are performed for both algorithms, and simple numerics demonstrate the effectiveness of the multiproduct formulas procedure at reducing Trotter error.Finally, we consider several practical methods for near-term quantum simulation. First, we consider the analog quantum simulation of bound systems with discrete scale invariance using trapped-ion systems, with applications to Efimov physics. Next, we discuss the Projected Cooling Algorithm, a method for preparing bound states of non-relativistic quantum systems with localized interactions based on the dispersion of unbound states. Lastly, we discuss the Rodeo Algorithm, a probabilistic, iterative, phase-estimation-like protocol which is resource-frugal and effective at measuring and preparing eigenstates. Concluding remarks and possible future directions of research are given in a brief final chapter.
일반주제명  
Quantum physics
일반주제명  
Computer science
일반주제명  
Physics
일반주제명  
Computational physics
키워드  
Hamiltonian simulation
키워드  
Quantum algorithms
키워드  
Quantum computing
키워드  
Computational reduction
키워드  
Efimov physics
기타저자  
Michigan State University Physics - Doctor of Philosophy
기본자료저록  
Dissertations Abstracts International. 86-01B.
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008250123s2024        us                              c    eng  d
■001000017161932
■00520250211151504
■006m          o    d                
■007cr#unu||||||||
■020    ▼a9798383215777
■035    ▼a(MiAaPQ)AAI31298481
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a530.1
■1001  ▼aWatkins,  Jacob.▼0(orcid)0000-0003-1478-7230
■24510▼aNew  Quantum  Algorithms  and  Analyses  for  Hamiltonian  Simulation
■260    ▼a[Sl]▼bMichigan  State  University▼c2024
■260  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2024
■300    ▼a193  p
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  86-01,  Section:  B.
■500    ▼aAdvisor:  Lee,  Dean.
■5021  ▼aThesis  (Ph.D.)--Michigan  State  University,  2024.
■520    ▼aDigital  quantum  Hamiltonian  simulation  is,  by  now,  a  relatively  mature  field  of  study;  however,  new  investigations  are  justified  by  the  importance  of  quantum  simulation  for  scientific  and  societal  applications.  In  this  dissertation,  we  discuss  several  advances  in  circuit-based  Hamiltonian  simulation.First,  following  two  introductory  chapters,  we  consider  the  mitigation  of  Trotter  errors  using  Chebyshev  interpolation,  a  standard  yet  powerful  function  approximation  technique.  Implications  for  estimating  time-evolved  expectation  values  are  discussed,  and  a  rigorous  analysis  of  errors  and  complexity  show  near  optimal  estimation  of  dynamical  expectation  values  using  only  Trotter  and  constant  overhead.  We  supplement  our  theoretical  findings  with  numerical  demonstrations  on  a  1D  random  Heisenberg  model.Next,  we  introduce  a  computational  reduction  from  time  dependent  to  time  independent  Hamiltonian  simulation  based  on  the  standard  (\uD835\uDC61,  \uD835\uDC61')  technique.  Our  approach  achieves  two  advances.  First,  we  provide  an  algorithm  for  simulating  time  dependent  Hamiltonians  using  qubitization,  an  optimal  algorithm  that  cannot  handle  time-ordering  directly.  Second,  we  provide  an  algorithm  for  time  dependent  simulation  using  a  natural  generalization  of  multiproduct  formulas,  achieving  higher  accuracies  than  product  formulas  while  retaining  commutator  scaling.  Rigorous  performance  analyses  are  performed  for  both  algorithms,  and  simple  numerics  demonstrate  the  effectiveness  of  the  multiproduct  formulas  procedure  at  reducing  Trotter  error.Finally,  we  consider  several  practical  methods  for  near-term  quantum  simulation.  First,  we  consider  the  analog  quantum  simulation  of  bound  systems  with  discrete  scale  invariance  using  trapped-ion  systems,  with  applications  to  Efimov  physics.  Next,  we  discuss  the  Projected  Cooling  Algorithm,  a  method  for  preparing  bound  states  of  non-relativistic  quantum  systems  with  localized  interactions  based  on  the  dispersion  of  unbound  states.  Lastly,  we  discuss  the  Rodeo  Algorithm,  a  probabilistic,  iterative,  phase-estimation-like  protocol  which  is  resource-frugal  and  effective  at  measuring  and  preparing  eigenstates.  Concluding  remarks  and  possible  future  directions  of  research  are  given  in  a  brief  final  chapter.
■590    ▼aSchool  code:  0128.
■650  4▼aQuantum  physics
■650  4▼aComputer  science
■650  4▼aPhysics
■650  4▼aComputational  physics
■653    ▼aHamiltonian  simulation
■653    ▼aQuantum  algorithms
■653    ▼aQuantum  computing
■653    ▼aComputational  reduction
■653    ▼aEfimov  physics
■690    ▼a0599
■690    ▼a0984
■690    ▼a0216
■690    ▼a0605
■71020▼aMichigan  State  University▼bPhysics  -  Doctor  of  Philosophy.
■7730  ▼tDissertations  Abstracts  International▼g86-01B.
■790    ▼a0128
■791    ▼aPh.D.
■792    ▼a2024
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17161932▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.

미리보기

내보내기

chatGPT토론

Ai 추천 관련 도서


    신착도서 더보기
    최근 3년간 통계입니다.

    소장정보

    • 예약
    • 소재불명신고
    • 나의폴더
    • 우선정리요청
    • 비도서대출신청
    • 야간 도서대출신청
    소장자료
    등록번호 청구기호 소장처 대출가능여부 대출정보
    TF14168 전자도서 대출가능 마이폴더 부재도서신고 비도서대출신청 야간 도서대출신청

    * 대출중인 자료에 한하여 예약이 가능합니다. 예약을 원하시면 예약버튼을 클릭하십시오.

    해당 도서를 다른 이용자가 함께 대출한 도서

    관련 인기도서

    로그인 후 이용 가능합니다.