找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Quantum Computing; Mika Hirvensalo Textbook 2004Latest edition Springer-Verlag Berlin Heidelberg 2004 Algorithmen.Computer.Probabilistik.Q

[复制链接]
查看: 34915|回复: 45
发表于 2025-3-21 16:12:23 | 显示全部楼层 |阅读模式
书目名称Quantum Computing
编辑Mika Hirvensalo
视频video
丛书名称Natural Computing Series
图书封面Titlebook: Quantum Computing;  Mika Hirvensalo Textbook 2004Latest edition Springer-Verlag Berlin Heidelberg 2004 Algorithmen.Computer.Probabilistik.Q
描述After the first edition of this book was published, I received much positive feedback from the readers. It was very helpful to have all those comments sug­ gesting improvements and corrections. In many cases, it was suggested that more aspects on quantum information would be welcome. Unfortunately, I am afraid that an attempt to cover such a broad area as quantum informa­ tion theory would make this book too scattered to be helpful for educational purposes. On the other hand, ladmit that some aspects of quantum information should be discussed. The first edition already contained the so-called No­ Cloning Theorem. In this edition, I have added a stronger version of the aforementioned theorem due to R. Jozsa, a variant which also covers the no-deleting principle. Moreover, in this edition, I have added some famous protocols, such as quantum teleportation. The response to the first edition strongly supports the idea that the main function of this book should be educational, and I have not included furt her aspects of quantum information theory here. For further reading, I suggest [43] by Josef Gruska and [62] by Michael A. Nielsen and Isaac L. Chuang. Chapter 1, especially Section 1.4
出版日期Textbook 2004Latest edition
关键词Algorithmen; Computer; Probabilistik; Quantum Computing; Quantum computation; Wahrscheinlichkeitsrechnung
版次2
doihttps://doi.org/10.1007/978-3-662-09636-9
isbn_softcover978-3-642-07383-0
isbn_ebook978-3-662-09636-9Series ISSN 1619-7127 Series E-ISSN 2627-6461
issn_series 1619-7127
copyrightSpringer-Verlag Berlin Heidelberg 2004
The information of publication is updating

书目名称Quantum Computing影响因子(影响力)




书目名称Quantum Computing影响因子(影响力)学科排名




书目名称Quantum Computing网络公开度




书目名称Quantum Computing网络公开度学科排名




书目名称Quantum Computing被引频次




书目名称Quantum Computing被引频次学科排名




书目名称Quantum Computing年度引用




书目名称Quantum Computing年度引用学科排名




书目名称Quantum Computing读者反馈




书目名称Quantum Computing读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:39:07 | 显示全部楼层
Quantum Computing978-3-662-09636-9Series ISSN 1619-7127 Series E-ISSN 2627-6461
发表于 2025-3-22 01:44:21 | 显示全部楼层
Natural Computing Serieshttp://image.papertrans.cn/q/image/781097.jpg
发表于 2025-3-22 06:45:29 | 显示全部楼层
发表于 2025-3-22 09:35:23 | 显示全部楼层
发表于 2025-3-22 12:58:13 | 显示全部楼层
Complexity Lower Bounds for Quantum Circuits,Unfortunately, the most interesting questions related to quantum complexity theory, for example, “Is . contained in . or not?”, are extremely difficult and far beyond recent knowledge. In this chapter we will mention some complexity theoretical aspects of quantum computation, which may somehow illustrate these difficult questions.
发表于 2025-3-22 20:17:19 | 显示全部楼层
发表于 2025-3-23 01:09:43 | 显示全部楼层
发表于 2025-3-23 05:13:52 | 显示全部楼层
Fast Factorization,elated to Fourier transforms and other mathematical details are handled in Chapter 9, but a reader having a solid mathematical knowledge of these concepts is advised to ignore the references to Chapter 9.
发表于 2025-3-23 07:26:57 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 22:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表