发布求助
文献互助 智能选刊 最新文献

Quantum Inf. Comput.最新文献

筛选
英文 中文
Quantum Communication Complexity of Distribution Testing 分布测试的量子通信复杂性
Quantum Inf. Comput. Pub Date : 2020-06-26 DOI: 10.26421/qic21.15-16-1
Aleksandrs Belovs, Arturo Castellanos, Franccois Le Gall, Guillaume Malod, Alexander A. Sherstov
{"title":"Quantum Communication Complexity of Distribution Testing","authors":"Aleksandrs Belovs, Arturo Castellanos, Franccois Le Gall, Guillaume Malod, Alexander A. Sherstov","doi":"10.26421/qic21.15-16-1","DOIUrl":"https://doi.org/10.26421/qic21.15-16-1","url":null,"abstract":"The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $epsilon$-far apart in the $l_1$-distance. In the present paper we show that the quantum communication complexity of this problem is $tilde{O}(n/(tepsilon^2))$ qubits when the distributions have low $l_2$-norm, which gives a quadratic improvement over the classical communication complexity obtained by Andoni, Malkin and Nosatzki. We also obtain a matching lower bound by using the pattern matrix method. Let us stress that the samples received by each of the parties are classical, and it is only communication between them that is quantum. Our results thus give one setting where quantum protocols overcome classical protocols for a testing problem with purely classical samples.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"27 1","pages":"1261-1273"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76267930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Quantum algorithmic differentiation 量子算法微分
Quantum Inf. Comput. Pub Date : 2020-06-23 DOI: 10.26421/QIC21.1-2-5
G. Colucci, F. Giacosa
{"title":"Quantum algorithmic differentiation","authors":"G. Colucci, F. Giacosa","doi":"10.26421/QIC21.1-2-5","DOIUrl":"https://doi.org/10.26421/QIC21.1-2-5","url":null,"abstract":"In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid approach). Since the implementation of elementary functions is already possible on quantum computers, the scheme that we propose can be easily applied. Moreover, since some steps (such as the CNOT operator) can (or will be) faster on a quantum computer than on a classical one, our procedure may ultimately emonstrate that quantum algorithmic differentiation has an advantage relative to its classical counterpart.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"3 1","pages":"80-94"},"PeriodicalIF":0.0,"publicationDate":"2020-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74105522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multilevel polarization for quantum Channels 量子通道的多能级极化
Quantum Inf. Comput. Pub Date : 2020-06-22 DOI: 10.26421/QIC21.7-8-4
Ashutosh Goswami, M. Mhalla, V. Savin
{"title":"Multilevel polarization for quantum Channels","authors":"Ashutosh Goswami, M. Mhalla, V. Savin","doi":"10.26421/QIC21.7-8-4","DOIUrl":"https://doi.org/10.26421/QIC21.7-8-4","url":null,"abstract":"Recently, a purely quantum version of polar codes has been proposed in [3] based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as channel combining operation. Here, we consider the quantum polar code construction using the same channel combining and splitting procedure as in [3] but with a fixed two-qubit Clifford unitary. For the family of Pauli channels, we show that the polarization happens although in multilevels, where synthesised quantum virtual channels tend to become completely noisy, half-noisy or noiseless. Further, it is shown that half-noisy channels can be frozen by fixing their inputs in either amplitude or phase basis, which reduces the number of preshared EPR pairs with respect to the construction in [3]. We also give an upper bound on the number of preshared EPR pairs, which is an equality in the case of quantum erasure channel. To improve the speed of polarization, we provide an alternative construction, which again polarizes in multilevel way and the earlier upper bound on preshared EPR pairs also holds. We confirm by numerical analysis for a quantum erasure channel that the multilevel polarization happens relatively faster for the alternative construction.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"26 1","pages":"577-606"},"PeriodicalIF":0.0,"publicationDate":"2020-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82750385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Can't touch this: unconditional tamper evidence from short keys 不能碰这个:短密钥的无条件篡改证据
Quantum Inf. Comput. Pub Date : 2020-06-03 DOI: 10.26421/qic22.5-6-1
B. V. D. Vecht, Xavier Coiteux-Roy, Boris Skoric
{"title":"Can't touch this: unconditional tamper evidence from short keys","authors":"B. V. D. Vecht, Xavier Coiteux-Roy, Boris Skoric","doi":"10.26421/qic22.5-6-1","DOIUrl":"https://doi.org/10.26421/qic22.5-6-1","url":null,"abstract":"Storing data on an external server with information-theoretic security, while using a key shorter than the data itself, is impossible. As an alternative, we propose a scheme that achieves information-theoretically secure tamper evidence: The server is able to obtain information about the stored data, but not while staying undetected. Moreover, the client only needs to remember a key whose length is much shorter than the data. We provide a security proof for our scheme, based on an entropic uncertainty relation, similar to QKD proofs. Our scheme works if Alice is able to (reversibly) randomise the message to almost-uniformity with only a short key. By constructing an explicit attack we show that short-key unconditional tamper evidence cannot be achieved without this randomisability.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"23 1","pages":"361-384"},"PeriodicalIF":0.0,"publicationDate":"2020-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83237972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Image processing: why quantum? 图像处理:为什么是量子?
Quantum Inf. Comput. Pub Date : 2020-06-01 DOI: 10.26421/QIC20.7-8-6
Marius Nagy, Naya Nagy
{"title":"Image processing: why quantum?","authors":"Marius Nagy, Naya Nagy","doi":"10.26421/QIC20.7-8-6","DOIUrl":"https://doi.org/10.26421/QIC20.7-8-6","url":null,"abstract":"Quantum Image Processing has exploded in recent years with dozens of papers trying to take advantage of quantum parallelism in order to offer a better alternative to how current computers are dealing with digital images. The vast majority of these papers define or make use of quantum representations based on very large superposition states spanning as many terms as there are pixels in the image they try to represent. While such a representation may apparently offer an advantage in terms of space (number of qubits used) and speed of processing (due to quantum parallelism), it also harbors a fundamental flaw: only one pixel can be recovered from the quantum representation of the entire image, and even that one is obtained non-deterministically through a measurement operation applied on the superposition state. We investigate in detail this measurement bottleneck problem by looking at the number of copies of the quantum representation that are necessary in order to recover various fractions of the original image. The results clearly show that any potential advantage a quantum representation might bring with respect to a classical one is paid for dearly with the huge amount of resources (space and time) required by a quantum approach to image processing.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"156 1","pages":"616-626"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76094706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
SudoQ - a quantum variant of the popular game 数独-量子变体的流行游戏
Quantum Inf. Comput. Pub Date : 2020-05-21 DOI: 10.26421/QIC21.9-10-4
I. Nechita, Jordi Pillet
{"title":"SudoQ - a quantum variant of the popular game","authors":"I. Nechita, Jordi Pillet","doi":"10.26421/QIC21.9-10-4","DOIUrl":"https://doi.org/10.26421/QIC21.9-10-4","url":null,"abstract":"We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical (commutative) setting. We introduce and analyze a randomized algorithm for computing solutions of SudoQ puzzles. Finally, we state two important conjectures relating the quantum and the classical solutions of SudoQ puzzles, corroborated by analytical and numerical evidence.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"55 1","pages":"781-799"},"PeriodicalIF":0.0,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84370843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Quantum Alice and Silent Bob: Qubit-Based Quantum Key Recycling With Almost No Classical Communication 量子爱丽丝和沉默鲍勃:几乎没有经典通信的基于量子比特的量子密钥回收
Quantum Inf. Comput. Pub Date : 2020-03-26 DOI: 10.26421/QIC21.1-2-1
D. Leermakers, B. Škorić
{"title":"Quantum Alice and Silent Bob: Qubit-Based Quantum Key Recycling With Almost No Classical Communication","authors":"D. Leermakers, B. Škorić","doi":"10.26421/QIC21.1-2-1","DOIUrl":"https://doi.org/10.26421/QIC21.1-2-1","url":null,"abstract":"We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in the qubits without increasing the number of qubits compared to existing QKR schemes? We show that this is indeed possible. We introduce a prepare-and-measure QKR protocol where the communication from Alice to Bob consists entirely of qubits. As usual, Bob responds with an authenticated one-bit accept/reject classical message. Compared to Quantum Key Distribution (QKD), QKR has reduced round complexity. Compared to previous qubit-based QKR protocols, our scheme has far less classical communication. We provide a security proof in the universal composability framework and find that the communication rate is asymptotically the same as for QKD with one-way postprocessing.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"24 1","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2020-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85222807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A method of mapping and nearest neighbor optimization for 2-D quantum circuits 二维量子电路的映射与最近邻优化方法
Quantum Inf. Comput. Pub Date : 2020-03-01 DOI: 10.26421/QIC20.3-4-2
Yu-xin Zhang, Z. Guan, Longyong Ji, Qingbin Luan, Yizhen Wang
{"title":"A method of mapping and nearest neighbor optimization for 2-D quantum circuits","authors":"Yu-xin Zhang, Z. Guan, Longyong Ji, Qingbin Luan, Yizhen Wang","doi":"10.26421/QIC20.3-4-2","DOIUrl":"https://doi.org/10.26421/QIC20.3-4-2","url":null,"abstract":"In some practical quantum physical architectures, the qubits need to be distributed on 2-dimensional (2-D) grid structure to implement quantum computation. In order to map an 1-dimensional (1-D) quantum circuit into a 2-D grid structure and satisfy the nearest neighbor constraint of qubit interaction in the grid structure, a mapping method from 1-D quantum circuit to 2-D grid structure is proposed in this paper. This method firstly determines the order of placing qubits, and then presents the layout strategy of qubits in 2-D grid. We also proposed an algorithm for establishing interaction paths between non-adjacent qubits in 2-D grid structure, which can satisfy the physical constraints of the interaction of quantum bits in the grid in the process of mapping an 1-D quantum circuit to a 2-D grid structure. For some benchmark circuits, after using the method of this paper to place qubits, it is possible to make every 2-qubit gate in the circuit have a nearest neighbor, so that there is no need to use SWAP gate to establish channel routing. Compared with the latest available methods, the average optimization rate is 82.38%.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"105 1","pages":"194-212"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87421169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Faster amplitude estimation 更快的幅度估计
Quantum Inf. Comput. Pub Date : 2020-03-01 DOI: 10.26421/QIC20.13-14-2
Kouhei Nakaji
{"title":"Faster amplitude estimation","authors":"Kouhei Nakaji","doi":"10.26421/QIC20.13-14-2","DOIUrl":"https://doi.org/10.26421/QIC20.13-14-2","url":null,"abstract":"In this paper, we introduce an efficient algorithm for the quantum amplitude estimation task which is tailored for near-term quantum computers. The quantum amplitude estimation is an important problem which has various applications in fields such as quantum chemistry, machine learning, and finance. Because the well-known algorithm for the quantum amplitude estimation using the phase estimation does not work in near-term quantum computers, alternative approaches have been proposed in recent literature. Some of them provide a proof of the upper bound which almost achieves the Heisenberg scaling. However, the constant factor is large and thus the bound is loose. Our contribution in this paper is to provide the algorithm such that the upper bound of query complexity almost achieves the Heisenberg scaling and the constant factor is small.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"23 1","pages":"1109-1122"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90998204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 49
Analysis of lackadaisical quantum walks 非均匀量子行走的分析
Quantum Inf. Comput. Pub Date : 2020-02-26 DOI: 10.26421/QIC20.13-14-4
P. Høyer, Zhan Yu
{"title":"Analysis of lackadaisical quantum walks","authors":"P. Høyer, Zhan Yu","doi":"10.26421/QIC20.13-14-4","DOIUrl":"https://doi.org/10.26421/QIC20.13-14-4","url":null,"abstract":"The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular locally arc-transitive graph with constant success probability quadratically faster than the hitting time. This result proves several speculations and numerical findings in previous work, including the conjectures that the lackadaisical quantum walk finds a unique marked vertex with constant success probability on the torus, cycle, Johnson graphs, and other classes of vertex-transitive graphs. Our proof establishes and uses a relationship between lackadaisical quantum walks and quantum interpolated walks for any regular locally arc-transitive graph.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"47 1","pages":"1137-1152"},"PeriodicalIF":0.0,"publicationDate":"2020-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91091543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信