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...
{"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":null,"pages":null},"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}
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":null,"pages":null},"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}
Pub Date : 2007-11-01DOI: 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
{"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":null,"pages":null},"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}
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":null,"pages":null},"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}
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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
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":null,"pages":null},"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}
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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
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...
{"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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：