2026-09-20T03:50:07Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1150252026-06-16T18:14:17Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

Isaac L. Chuang. Low, Guang Hao Massachusetts Institute of Technology. Department of Physics. Massachusetts Institute of Technology. Department of Physics 2018-04-27T18:10:33Z 2018-04-27T18:10:33Z 2017 2017 http://hdl.handle.net/1721.1/115025 1031219672 Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2017. Cataloged from PDF version of thesis. Includes bibliographical references (pages 117-125). Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems. by Guang Hao Low. Ph.D. 125 pages eng Massachusetts Institute of Technology MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 Physics. Quantum signal processing by single-qubit dynamics Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ed3edf0a-32d2-4fb2-8bfe-b47cd2a366ee"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Quantum signal processing by single-qubit dynamics</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2017</PublicationDate> <Authors> <Author> <DisplayName>Low, Guang Hao</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Physics.</Keyword> <Abstract>Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>