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

Proceedings Workshop on Physics and Computation. PhysComp '94最新文献

筛选
英文 中文
On a method of solving SAT efficiently using the quantum Turing machine 一种利用量子图灵机高效求解SAT的方法
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363683
T. Mihara, T. Nishino
{"title":"On a method of solving SAT efficiently using the quantum Turing machine","authors":"T. Mihara, T. Nishino","doi":"10.1109/PHYCMP.1994.363683","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363683","url":null,"abstract":"In this paper, under an assumption that superposed physical states can be observed without collapsing the superposition, we show that the satisfiability problem (SAT, for short) can be solved by a quantum Turing machine in O(2/sup n/4/) time. This assumption is not widely accepted among physicists, however, (Aharonov et al., 1993) conjecture that a physical state actually exists as a superposition and can be observed without collapsing the superposition.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585712","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}
引用次数: 5
The stabilisation of quantum computations 量子计算的稳定性
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363698
A. Berthiaume, D. Deutsch, R. Jozsa
{"title":"The stabilisation of quantum computations","authors":"A. Berthiaume, D. Deutsch, R. Jozsa","doi":"10.1109/PHYCMP.1994.363698","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363698","url":null,"abstract":"A quantum computer is a device capable of performing computational tasks that depend on characteristically quantum mechanical effects, in particular coherent quantum superposition. Such devices can efficiently perform classes of computation (e.g. factorisation) which are believed to be intractable on any classical computer. This makes it highly desirable to construct such devices. In this paper, we address the last remaining theoretical obstacle to such a construction, namely the problem of stability or error correction. This problem is more substantial in quantum computation than in classical computation because of the delicate nature of the interference phenomena on which quantum computation depends. We present a new, purely quantum mechanical method of error correction, which has no classical analogue, but can serve to stabilise coherent quantum computations. Like the classical methods, it utilises redundancy, but it does not depend on measuring intermediate results of the computation.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121524319","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}
引用次数: 34
Impact of locality and dimensionality limits on architectural trends 地域和维度限制对建筑趋势的影响
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363702
Douglas J Matzke
{"title":"Impact of locality and dimensionality limits on architectural trends","authors":"Douglas J Matzke","doi":"10.1109/PHYCMP.1994.363702","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363702","url":null,"abstract":"Since computing is a physical activity, all forms of computing must obey locality constraints imposed by physics. Unknowingly, many software abstractions violate locality constraints because they represent high dimensional topologies that have higher degrees of freedom than is uniformly implementable by the underlying physical architecture. This semantic gap between abstractions implemented in the virtual architecture and the physical machine resources results in poor performance for certain classes of computing problems. The paper discusses and analyzes the impact of locality constraints and dimensionality limits upon software and architecture trends with the specific goals of improved performance, lower cost, and the longevity of architectural investments.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134070692","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
Evolution, entropy, and parallel computation 进化、熵和并行计算
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363674
K. Thearling
{"title":"Evolution, entropy, and parallel computation","authors":"K. Thearling","doi":"10.1109/PHYCMP.1994.363674","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363674","url":null,"abstract":"The relationship between evolution and entropy is described for a model of self-reproducing parallel computation. As was recently shown by Thearling and Ray (1994), the performance of some types of parallel computation can be increased though a process analogous to evolution by natural selection. The work discussed in this paper explores the process by which evolution manipulates the entropy of instruction sequences in a population of parallel programs in an effort to discover more efficient uses of parallelism.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131966681","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}
引用次数: 9
Entropy cost of information 信息熵成本
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363678
P.N. Fahn
{"title":"Entropy cost of information","authors":"P.N. Fahn","doi":"10.1109/PHYCMP.1994.363678","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363678","url":null,"abstract":"An entropy analysis of Szilard's (1929) one-molecule Maxwell's demon suggests a general theory of the entropy cost of information. The entropy of the demon increases due to the decoupling of the molecule from the measurement information. In general, neither measurement nor erasure is fundamentally a thermodynamically costly operation; however, the decorrelation of the system from the information must always increase entropy in the system-with-information. This causes a net entropy increase in the universe unless, as in the Szilard demon, the information is used to decrease entropy elsewhere before the correlation is lost. Thus information is thermodynamically costly precisely to the extent that it is not used to obtain work from the measured system.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121152639","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
Space and time in computation, topology and discrete physics 计算中的空间和时间，拓扑和离散物理
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363700
L. Kauffman
{"title":"Space and time in computation, topology and discrete physics","authors":"L. Kauffman","doi":"10.1109/PHYCMP.1994.363700","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363700","url":null,"abstract":"A step can be regarded as an elementary ordering of two objects (or operators). A step is a distinction combined with an action that crosses the boundary of that distinction. The elementary step can be seen as a reference, as a division of space or as a tick of a clock. By looking at the structure of a step, we provide a context that unifies specific aspects of special relativity, Laws of Form, topology, discrete physics and logic design.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130055856","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}
引用次数: 6
Quantum oblivious transfer is secure against all individual measurements 量子无关转移对所有单独的测量都是安全的
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363696
D. Mayers, L. Salvail
{"title":"Quantum oblivious transfer is secure against all individual measurements","authors":"D. Mayers, L. Salvail","doi":"10.1109/PHYCMP.1994.363696","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363696","url":null,"abstract":"Shows that the BBCS-protocol (Bennett, Brassard, Cre/spl acute/peau and Skubiszewska, CRYPTO'91, 1992) implementing one of the most important cryptographic primitives-'oblivious transfer'-is secure against any individual measurement allowed by quantum mechanics. We analyze the common situation where successive measurements on the same photon could be used to cheat in the protocol. We model this situation by using a single inner-product-preserving (IPP) operator, followed by a complete composite-outcome Von Neumann measurement. A lower bound on the residual collision entropy is then obtained under the assumption that only individual measurements can be performed. This bound is used to apply privacy amplification techniques in order to conclude the security of the BBCS-protocol.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"32 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131434604","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}
引用次数: 53
Multiprocessor architectures and physical law 多处理器体系结构和物理定律
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363703
P. Vitányi
{"title":"Multiprocessor architectures and physical law","authors":"P. Vitányi","doi":"10.1109/PHYCMP.1994.363703","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363703","url":null,"abstract":"We show that all highly symmetrical interconnection topologies for multiprocessors with low diameter require very long interconnect lengths. Therefore, such multicomputers do not scale well in the physical world with 3 dimensions. On the other hand, highly irregular (random) interconnection topologies have a very large subgraph of diameter two and therefore also require very long interconnect lengths. Hence the only scaling topologies for future massively parallel computers are high diameter regular ones, like mesh networks. The techniques used are symmetry properties in terms of orbits of automorphism groups of graphs, and a modern notion of randomness of individual objects, Kolmogorov complexity.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124729834","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}
引用次数: 9
Can quantum computers have simple Hamiltonians? 量子计算机能有简单的哈密顿量吗?
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363697
Michael Biafore
{"title":"Can quantum computers have simple Hamiltonians?","authors":"Michael Biafore","doi":"10.1109/PHYCMP.1994.363697","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363697","url":null,"abstract":"Recently, P. Shor (1994) has shown that quantum computers (computers which can operate simultaneously on a quantum superposition of inputs) permit efficient (i.e. polynomial-time) solutions of problems for which no efficient classical-mechanical solution is known. This has led to renewed interest in the question of whether or not quantum computers can be physically realized. One kind of quantum computer, quantum cellular automata, can be described by relatively simple Hamiltonians that resemble the Hamiltonians of spin systems. In this paper, we report a quantum cellular automaton which, though not itself computation-universal, forms an essential part of any quantum cellular automaton which is synchronized using Feynman's technique. This quantum cellular automaton has as its Hamiltonian the one-dimensional XY Hamiltonian, which is exactly solvable. Furthermore, there is experimental evidence from low-temperature measurements of the heat capacity and electric susceptibility that the Hamiltonian of the quantum cellular automaton is realized in nature by the rare-earth compound praseodymium ethyl sulfate near 1 K.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126245913","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}
引用次数: 15
Thermal logic circuits 热逻辑电路
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-11-17 DOI: 10.1109/PHYCMP.1994.363691
J. Koller, W. Athas, L.J. Svensson
{"title":"Thermal logic circuits","authors":"J. Koller, W. Athas, L.J. Svensson","doi":"10.1109/PHYCMP.1994.363691","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363691","url":null,"abstract":"Thermal logic is a hypothetical device technology that allows one to analyze the energetics of computing machines in a simpler setting than real device technologies. The paper describes the rudiments of thermal logic, and uses it to analyze reversible logic pipelines. The similarity between thermal logic and electronic logic is explained, and thermal analogs of electronic devices and circuits are proposed. We show that adiabatically-reversible logic pipelines have a rich mathematical structure, including a local gauge symmetry, and suggest some directions for future research. Adiabatic power supplies are also addressed.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218042","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
首页 上一页 下一页 尾页
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学术官方微信