16 resultados para fault-tolerant quantum computation
Filtro por publicador
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (10)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (5)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (105)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (1)
- Brock University, Canada (8)
- CentAUR: Central Archive University of Reading - UK (16)
- Cochin University of Science & Technology (CUSAT), India (31)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (151)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (4)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (5)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Diposit Digital de la UB - Universidade de Barcelona (38)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (44)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (1)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (2)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Institutional Repository of Leibniz University Hannover (3)
- Instituto Politécnico do Porto, Portugal (21)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (2)
- Martin Luther Universitat Halle Wittenberg, Germany (3)
- Massachusetts Institute of Technology (7)
- Publishing Network for Geoscientific & Environmental Data (4)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (3)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (12)
- Repositório da Produção Científica e Intelectual da Unicamp (6)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (16)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (8)
- Scielo Saúde Pública - SP (16)
- Universidad Autónoma de Nuevo León, Mexico (4)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (15)
- Universidade Complutense de Madrid (3)
- Universidade do Minho (10)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universita di Parma (1)
- Universitat de Girona, Spain (26)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (16)
- Université de Lausanne, Switzerland (55)
- Université de Montréal, Canada (12)
- University of Michigan (5)
- University of Queensland eSpace - Australia (239)
- University of Southampton, United Kingdom (8)
- WestminsterResearch - UK (1)
Resumo:
A parallel formulation of an algorithm for the histogram computation of n data items using an on-the-fly data decomposition and a novel quantum-like representation (QR) is developed. The QR transformation separates multiple data read operations from multiple bin update operations thereby making it easier to bind data items into their corresponding histogram bins. Under this model the steps required to compute the histogram is n/s + t steps, where s is a speedup factor and t is associated with pipeline latency. Here, we show that an overall speedup factor, s, is available for up to an eightfold acceleration. Our evaluation also shows that each one of these cells requires less area/time complexity compared to similar proposals found in the literature.