Classical and Quantum Computation 作者:A. Yu. Kitaev/A. H. Shen/M. N. Vyalyi 出版社:Amer Mathematical Society 出版年:2002 页数:272 定价:$40.00 装帧:Pap 丛书:Graduate Studies in Mathematics ISBN:9780821832295 豆瓣评分 评价人数不足 评价:...
Classical and quantum computation, volume 47 of Graduate studies in mathematics. American Mathematical Society, 2002.A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation, volume 47 of Graduate Studies in Mathematics. 2002.
Classical and Quantum Computation 经典和量子计算.pdf,Classical and Quantum Computation Classical and Quantum Computation A. Yu. Kitaev A. H. Shen M. N. Vyalyi Graduate Studies in Mathematics Volume 47 American Mathematical Society Providence, Rhode Islan
BULLETIN(NewSeries)OFTHE AMERICANMATHEMATICALSOCIETY Volume40,Number1,Pages31–38 S0273-0979(02)00964-3 ArticleelectronicallypublishedonOctober10,2002 TOPOLOGICALQUANTUMCOMPUTATION MICHAELH.FREEDMAN,ALEXEIKITAEV,MICHAELJ.LARSEN, ANDZHENGHANWANG Abstract.Thetheoryofquantumcomputationcanbeconstructedfromthe abstract...
This explains the growing interest for a new field, namely the field of quantum information and quantum computation. Such a field, which started in the 1980s, is at the crossroads of quantum mechanics, discrete mathematics and informatics with the aim of building a quantum computer. We note ...
Bravyi S, Kitaev A . Quantum codes on a lattice with boundary. Preprint at arXiv:quant-ph/9811052, 1998. Raussendorf R, Harrington J . Fault-tolerant quantum computation with high threshold in two dimensions. Phys Rev Lett 2007; 98: 190504. Article ADS Google Scholar Gottesman D . Int...
Spanning a range of hardware platforms, the building-blocks of quantum processors are today sufficiently advanced to begin work on scaling-up these systems into complex quantum machines. A key subsystem of all quantum machinery is the interface between t
The traditional Kitaev QPE protocol for estimating the eigenvalues relies on a number of repetitions of a quantum circuit, where more repetitions results in additional accuracy (and fewer repetitions means less accuracy). However, iterative QPE offers a baseline level of accuracy after just a single...
has been quite successful, showing classical intractability of the experimen- tally feasible intermediate models, such as commuting quantum circuits (so-called IQP)19, liner optics (boson sampling)28, and highly-mixed state quantum computation (deterministic quantum computation with one-clean qubit15)...
An example of this would be a domain specific language that expresses a molecular Hamiltonian, and an associated Compiler realization that maps this Hamiltonian to quantum assembly via a Jordan–Wigner or Bravyi–Kitaev transformation [[40], [41]]. Note this design also facilitates general gate ...