인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록·키워드
A bstract In this work, we propose a quantum-mechanically measurable basis for the computation of spread complexity. Current literature focuses on computing different powers of the Hamiltonian to construct a basis for the Krylov state space and the computation of the spread complexity. We show, through a series of proofs, that time-evolved states with different evolution times can be used to construct an equivalent space to the Krylov state space used in the computation of the spread complexity. Afterwards, we introduce the effective dimension, which is upper-bounded by the number of pairwise distinct eigenvalues of the Hamiltonian. The computation of the spread complexity requires knowledge of the Hamiltonian and a classical computation of the different powers of the Hamiltonian. The computation of large powers of the Hamiltonian becomes increasingly difficult for large systems. The first part of our work addresses these issues by defining an equivalent space, where the original basis consists of quantum-mechanically measurable states. We demonstrate that a set of different time-evolved states can be used to construct a basis. We subsequently verify the results through numerical analysis, demonstrating that every time-evolved state can be reconstructed using the defined vector space. Based on this new space, we define an upper-bounded effective dimension and analyze its influence on finite-dimensional systems. We further show that the Krylov space dimension is equal to the number of pairwise distinct eigenvalues of the Hamiltonian, enabling a method to determine the number of eigenenergies the system has experimentally. Lastly, we compute the spread complexities of both basis representations and observe almost identical behavior, thus enabling the computation of spread complexities through measurements.
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
최근 본 자료 전체보기
