{"title":"Simulating the Quantum Fourier Transform","authors":"F. Pereira, Elloá B. Guedes, F. M. Assis","doi":"10.1109/WEIT.2013.10","DOIUrl":"https://doi.org/10.1109/WEIT.2013.10","url":null,"abstract":"Quantum Computing is a computational paradigm that takes into account the laws of Quantum Physics in the steps of the computation which advantages were verified both in Computation and Communications. No scalable quantum computer was developed so far and to execute, to test, and to create new quantum algorithms the simulation of quantum computers on classical computers plays an important role. In this work, we show the design, tools and results obtained for the simulation of the Quantum Fourier Transform algorithm. As a result, we developed an open-source tool, called FTSimulator, and we could simulate up to 12 qubits according to the procedures specified by an experimental test.","PeriodicalId":153767,"journal":{"name":"Workshop-School on Theoretical Computer Science","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321578","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}
{"title":"The Computational Complexity of Random Variables with Uniform, Exponential and Pareto Distributions in Real and Interval Forms","authors":"A. Finger, A. Loreto, V. Furlan","doi":"10.1109/WEIT.2013.28","DOIUrl":"https://doi.org/10.1109/WEIT.2013.28","url":null,"abstract":"To obtain the numerical value of the Uniform, Exponential and Pareto distributions is necessary to use numerical integration and its value is obtained by approximation and therefore affected by rounding or truncation errors. Through the use of intervals, there is an automatic control error with reliable limits. The objective of the work is to analyze the computational complexity for computing the random variables with Uniform, Exponential and Pareto distributions in real and interval form in order to justify that, it to the use intervals to represent the real form of these variables, it is possible to control the propagation of errors and maintain the computational effort.","PeriodicalId":153767,"journal":{"name":"Workshop-School on Theoretical Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116645284","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}
{"title":"Toward a Formal Reconstruction of Kelsen's Theory of Legal Systems","authors":"Antônio Carlos da Rocha Costa","doi":"10.1109/WEIT.2013.23","DOIUrl":"https://doi.org/10.1109/WEIT.2013.23","url":null,"abstract":"This paper sketches a set-theoretic reconstruction of the theory of legal systems originally developed by Hans Kelsen in an informal way. The reconstruction is cast in a temporal operational framework. The way the reconstructed theory may motivate an operational semantical model for Kelsen's theory of legal systems is briefly discussed.","PeriodicalId":153767,"journal":{"name":"Workshop-School on Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114934484","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}
Daniel Vaz dos Santos, Lucas Fernando Souza de Castro, G. V. Alves
{"title":"N-GraphML: Language and Formal Grammar for Proof-Graphs","authors":"Daniel Vaz dos Santos, Lucas Fernando Souza de Castro, G. V. Alves","doi":"10.1109/WEIT.2013.35","DOIUrl":"https://doi.org/10.1109/WEIT.2013.35","url":null,"abstract":"N-Graphs is a formal proof system based on natural deduction and sequent calculus rules, where derivations are represented via proof-graphs. The N-GraphML language has been developed in order to define a computational representation for N-Graphs. Here our work has a two-fold goal: i. define a formal grammar for N-GraphML, ii. build a proof editor for N-Graphs.","PeriodicalId":153767,"journal":{"name":"Workshop-School on Theoretical Computer Science","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124518264","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
