首页 > 最新文献

Quantum Information & Computation最新文献

英文 中文
Multi-partite quantum cryptographic protocols with noisy GHZ States 具有噪声GHZ状态的多部量子密码协议
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2007-11-01 DOI: 10.5555/2011742.2011743
ChenKai, LoHoi-Kwong
We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection b...
我们提出了一类广泛的多部纠缠态的蒸馏方案,这些纠缠态是css状态。我们的建议不仅提供了卓越的效率,而且提供了关于连接的新见解…
{"title":"Multi-partite quantum cryptographic protocols with noisy GHZ States","authors":"ChenKai, LoHoi-Kwong","doi":"10.5555/2011742.2011743","DOIUrl":"https://doi.org/10.5555/2011742.2011743","url":null,"abstract":"We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection b...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71125658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Universal mixing of quantum walk on graphs 图上量子行走的普遍混合
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2007-11-01 DOI: 10.5555/2011742.2011746
CarlsonWilliam, ForAllison, HarrisElizabeth, RosenJulian, TamonChristino, WrobelKathleen
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribut...
我们研究图上连续时间量子行走所访问的概率分布集。边加权图G是普遍混合图,如果瞬时或平均概率分布…
{"title":"Universal mixing of quantum walk on graphs","authors":"CarlsonWilliam, ForAllison, HarrisElizabeth, RosenJulian, TamonChristino, WrobelKathleen","doi":"10.5555/2011742.2011746","DOIUrl":"https://doi.org/10.5555/2011742.2011746","url":null,"abstract":"We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribut...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71125697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Introduction to Quantum Computing 量子计算导论
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2007-11-01 DOI: 10.1093/oso/9780198570004.001.0001
G. Milburn
Preface 1. Introduction and background 2. Linear algebra and the Dirac notation 3. Qubits and the framework of quantum mechanics 4. A quantum model of computation 5. Superdense coding and quantum teleportation 6. Introductory quantum algorithms 7. Algorithms with super-polynomial speed-up 8. Algorithms based on amplitude amplification 9. Quantum computational complexity theory and lower bounds 10. Quantum error correction Appendices Bibliography Index
前言1。介绍和背景线性代数和狄拉克符号3。量子比特和量子力学的框架计算的量子模型。超密编码和量子隐形传态量子算法入门具有超多项式加速的算法基于幅度放大的算法量子计算复杂性理论与下界量子纠错附录书目索引
{"title":"An Introduction to Quantum Computing","authors":"G. Milburn","doi":"10.1093/oso/9780198570004.001.0001","DOIUrl":"https://doi.org/10.1093/oso/9780198570004.001.0001","url":null,"abstract":"Preface 1. Introduction and background 2. Linear algebra and the Dirac notation 3. Qubits and the framework of quantum mechanics 4. A quantum model of computation 5. Superdense coding and quantum teleportation 6. Introductory quantum algorithms 7. Algorithms with super-polynomial speed-up 8. Algorithms based on amplitude amplification 9. Quantum computational complexity theory and lower bounds 10. Quantum error correction Appendices Bibliography Index","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"7 1","pages":"I-XI, 1-274"},"PeriodicalIF":1.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82921089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 676
The quantum fourier transform on a linear nearest neighbor architecture 线性最近邻结构上的量子傅里叶变换
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2007-05-01 DOI: 10.5555/2011725.2011732
TakahashiYasuhiro, KunihiroNoboru, OhtaKazuo
We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a linear nearest neighbor architecture. The constructed circuit uses no ...
我们展示了如何构建一个有效的量子电路来计算线性最近邻结构上的量子傅里叶变换的良好近似值。所构建的电路不使用…
{"title":"The quantum fourier transform on a linear nearest neighbor architecture","authors":"TakahashiYasuhiro, KunihiroNoboru, OhtaKazuo","doi":"10.5555/2011725.2011732","DOIUrl":"https://doi.org/10.5555/2011725.2011732","url":null,"abstract":"We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a linear nearest neighbor architecture. The constructed circuit uses no ...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71125604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the complexity of the two-variable guarded fragment with transitive guards 带传递保护的二变量保护片段的复杂性
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2006-11-01 DOI: 10.5555/1225970.1225973
KierońskiEmanuel
We investigate the complexity of the satisfiability problem for the two-variable guarded fragment with transitive guards. We prove that the satisfiability problem for the monadic version of this lo...
研究了具有传递保护的二变量保护片段的可满足性问题的复杂性。我们证明了该模型一元型的可满足性问题。
{"title":"On the complexity of the two-variable guarded fragment with transitive guards","authors":"KierońskiEmanuel","doi":"10.5555/1225970.1225973","DOIUrl":"https://doi.org/10.5555/1225970.1225973","url":null,"abstract":"We investigate the complexity of the satisfiability problem for the two-variable guarded fragment with transitive guards. We prove that the satisfiability problem for the monadic version of this lo...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"12 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82894458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
BTL 2 and the expressive power of ECTL btl2与ECTL表达能力的关系
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2006-07-01 DOI: 10.1016/J.IC.005.07.006
A. Rabinovich, P. Schnoebelen
{"title":"BTL 2 and the expressive power of ECTL","authors":"A. Rabinovich, P. Schnoebelen","doi":"10.1016/J.IC.005.07.006","DOIUrl":"https://doi.org/10.1016/J.IC.005.07.006","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"16 1","pages":"1023-1044"},"PeriodicalIF":1.0,"publicationDate":"2006-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89017206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Quantum entanglement measure based on wedge product 基于楔积的量子纠缠测量
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2006-03-01 DOI: 10.5555/2011665.2011667
HeydariHoshang
We construct an entanglement measure that coincides with the generalized concurrencefor a general pure bipartite state based on wedge product. Moreover, we construct anentanglement measure for pure...
我们基于楔形积构造了一个与一般纯二部态的广义并发性一致的纠缠测度。此外,我们构造了纯…
{"title":"Quantum entanglement measure based on wedge product","authors":"HeydariHoshang","doi":"10.5555/2011665.2011667","DOIUrl":"https://doi.org/10.5555/2011665.2011667","url":null,"abstract":"We construct an entanglement measure that coincides with the generalized concurrencefor a general pure bipartite state based on wedge product. Moreover, we construct anentanglement measure for pure...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2006-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71125591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Two slightly-entangled NP-complete problems 两个轻微纠缠的np完全问题
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2005-09-01 DOI: 10.5555/2011670.2011673
OrúsRomán
We perform a mathematical analysis of the classical computational complexity of two genuine quantum-mechanical problems, which are inspired in the calculation of the expected magnetizations and the...
我们对两个真正的量子力学问题的经典计算复杂性进行了数学分析,这两个问题在计算预期磁化率和期望磁化率时受到了启发。
{"title":"Two slightly-entangled NP-complete problems","authors":"OrúsRomán","doi":"10.5555/2011670.2011673","DOIUrl":"https://doi.org/10.5555/2011670.2011673","url":null,"abstract":"We perform a mathematical analysis of the classical computational complexity of two genuine quantum-mechanical problems, which are inspired in the calculation of the expected magnetizations and the...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2005-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71125597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comments on multiplicativity of maximal p -norms when p=2 关于p=2时最大p -范数的乘法性的注释
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2004-01-07 DOI: 10.26421/QIC4.6-7-9
C. King, M. Ruskai
We consider the maximal p-norm associated with a completely positivemap and the question of its multiplicativity under tensor products. Wegive a condition under which this multiplicativity holds when p = 2, andwe describe some maps which satisfy our condition. This class includesmaps for which multiplicativity is known to fail for large p.Our work raises some questions of independent interest in matrix theory; these are discussed in two appendices.
研究了与完全正映射相关的极大p-范数及其在张量积下的可乘法性问题。我们给出了当p = 2时这个乘法性成立的一个条件,并描述了一些满足这个条件的映射。我们的工作提出了一些在矩阵理论中独立的兴趣问题;这些在两个附录中进行了讨论。
{"title":"Comments on multiplicativity of maximal p -norms when p=2","authors":"C. King, M. Ruskai","doi":"10.26421/QIC4.6-7-9","DOIUrl":"https://doi.org/10.26421/QIC4.6-7-9","url":null,"abstract":"We consider the maximal p-norm associated with a completely positivemap and the question of its multiplicativity under tensor products. Wegive a condition under which this multiplicativity holds when p = 2, andwe describe some maps which satisfy our condition. This class includesmaps for which multiplicativity is known to fail for large p.Our work raises some questions of independent interest in matrix theory; these are discussed in two appendices.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"4 1","pages":"500-512"},"PeriodicalIF":1.0,"publicationDate":"2004-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69278645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Security bounds in quantum cryptography using d-level systems 使用d级系统的量子密码学中的安全边界
IF 1 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2003-11-01 DOI: 10.5555/2011556.2011557
AcínAntonio, GisinNicolas, ScaraniValerio
We analyze the security of quantum cryptography schemes for d-level systems using 2 or d + 1 maximally conjugated bases, under individual eavesdropping attacks based on cloning machines and measure...
在基于克隆机的个体窃听攻击下,我们分析了使用2或d + 1最大共轭基的d级系统的量子密码方案的安全性。
{"title":"Security bounds in quantum cryptography using d-level systems","authors":"AcínAntonio, GisinNicolas, ScaraniValerio","doi":"10.5555/2011556.2011557","DOIUrl":"https://doi.org/10.5555/2011556.2011557","url":null,"abstract":"We analyze the security of quantum cryptography schemes for d-level systems using 2 or d + 1 maximally conjugated bases, under individual eavesdropping attacks based on cloning machines and measure...","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2003-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71126005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Quantum Information & Computation
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1