Kitaev, A. Yu (Alexei Yu.) 1963
Overview
Works:  6 works in 24 publications in 1 language and 388 library holdings 

Genres:  Academic theses 
Roles:  Author, Thesis advisor 
Publication Timeline
.
Most widely held works by
A. Yu Kitaev
Classical and quantum computation by
A. Yu Kitaev(
Book
)
17 editions published between 2002 and 2012 in English and held by 382 WorldCat member libraries worldwide
This book presents a concise introduction to an emerging and increasingly important topic, the theory of quantum computing. The development of quantum computing exploded in 1994 with the discovery of its use in factoring large numbersan extremely difficult and timeconsuming problem when using a conventional computer. In less than 300 pages, the authors set forth a solid foundation to the theory, including results that have not appeared elsewhere and improvements on existing works. The book starts with the basics of classical theory of computation, including NPcomplete problems and the idea of complexity of an algorithm. Then the authors introduce general principles of quantum computing and pass to the study of main quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. In concluding sections, several related topics are discussed (parallel quantum computation, a quantum analog of NPcompleteness, and quantum errorcorrecting codes). This is a suitable textbook for a graduate course in quantum computing. Prerequisites are very modest and include linear algebra, elements of group theory and probability, and the notion of an algorithm (on a formal or an intuitive level). The book is complete with problems, solutions, and an appendix summarizing the necessary results from number theory
17 editions published between 2002 and 2012 in English and held by 382 WorldCat member libraries worldwide
This book presents a concise introduction to an emerging and increasingly important topic, the theory of quantum computing. The development of quantum computing exploded in 1994 with the discovery of its use in factoring large numbersan extremely difficult and timeconsuming problem when using a conventional computer. In less than 300 pages, the authors set forth a solid foundation to the theory, including results that have not appeared elsewhere and improvements on existing works. The book starts with the basics of classical theory of computation, including NPcomplete problems and the idea of complexity of an algorithm. Then the authors introduce general principles of quantum computing and pass to the study of main quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. In concluding sections, several related topics are discussed (parallel quantum computation, a quantum analog of NPcompleteness, and quantum errorcorrecting codes). This is a suitable textbook for a graduate course in quantum computing. Prerequisites are very modest and include linear algebra, elements of group theory and probability, and the notion of an algorithm (on a formal or an intuitive level). The book is complete with problems, solutions, and an appendix summarizing the necessary results from number theory
Classical and quantum computation by
A. Yu Kitaev(
Book
)
2 editions published in 2002 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 2002 in English and held by 2 WorldCat member libraries worldwide
NonAbelian quantum Hall states and fractional statistics by Waheb Bishara(
Book
)
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
1 edition published in 2009 in English and held by 1 WorldCat member library worldwide
Ashrae transactions 2002 by
A. Yu Kitaev(
Book
)
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
Pmi book of project management forms by
A. Yu Kitaev(
Book
)
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
On quantum computing and pseudorandomness by William Jason Fefferman(
)
2 editions published in 2010 in English and held by 1 WorldCat member library worldwide
The relationship between efficient verification and quantum computing is one of the most important and least wellunderstood questions in the theory of computation. In particular, is there a problem that can be solved efficiently on a quantum computer that cannot be verified? In this thesis we give evidence that \BQP \not\subset \PH, relating the classes of languages decidable with a quantum computer to a generalization of \NP. In so doing we connect a question in pseudorandomness, first studied [BSW'03] to the problem of finding an oracle relative to which \BQP \not\subset \PH. The primary technical challenge is to construct a unitary matrix, realized by an efficient quantum circuit and whose rows are supported on nearly disjoint subsets. Using this matrix and assuming the validity of the aforementioned question in pseudorandomness, we show an instantiation of the NisanWigderson pseudorandom generator that can be broken with quantum computers, but not with the relevant mode of classical computation
2 editions published in 2010 in English and held by 1 WorldCat member library worldwide
The relationship between efficient verification and quantum computing is one of the most important and least wellunderstood questions in the theory of computation. In particular, is there a problem that can be solved efficiently on a quantum computer that cannot be verified? In this thesis we give evidence that \BQP \not\subset \PH, relating the classes of languages decidable with a quantum computer to a generalization of \NP. In so doing we connect a question in pseudorandomness, first studied [BSW'03] to the problem of finding an oracle relative to which \BQP \not\subset \PH. The primary technical challenge is to construct a unitary matrix, realized by an efficient quantum circuit and whose rows are supported on nearly disjoint subsets. Using this matrix and assuming the validity of the aforementioned question in pseudorandomness, we show an instantiation of the NisanWigderson pseudorandom generator that can be broken with quantum computers, but not with the relevant mode of classical computation
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Shen, A. (Alexander) 1958 Other
 Vyalyi, M. N. (Mikhail N.) 1961
 Senechal, Lester J. Translator
 California Institute of Technology Division of Engineering and Applied Science
 Nayak, Chetan Thesis advisor
 Vjalyj, Michail N. Other
 California Institute of Technology Division of Physics, Mathematics and Astronomy
 Bishara, Waheb Author
 Fefferman, William Jason Author
 Umans, Christopher M. Thesis advisor
Useful Links
Associated Subjects
Covers
Alternative Names
Alexei Jurjewitsch Kitajew russischUSamerikanischer Physiker
Alexei Kitaev
Alexei Kitaev RussianAmerican physicist
Alexei Kitaev Russisch natuurkundige
Kitaev, A. Yu.
Kitaev, A. Yu 1963
Kitaev Alekseï Iou. 1963....
Kitaev, Aleksej Ju
Kitaev, Aleksej Ju. [t]
Kitaev, Alexei Yu.
Kitaev Alexei Yu. 1963....
Китаев, Алексей Юрьевич
알렉세이 키타예프
阿列克谢·基塔耶夫
Languages