1 resultado para Classical geography.
em Boston University Digital Common
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (4)
- Academic Research Repository at Institute of Developing Economies (4)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archive of European Integration (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Biblioteca Digital da Câmara dos Deputados (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (8)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (9)
- Biodiversity Heritage Library, United States (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (89)
- Boston University Digital Common (1)
- Brock University, Canada (1)
- Bucknell University Digital Commons - Pensilvania - USA (21)
- CaltechTHESIS (3)
- Cambridge University Engineering Department Publications Database (23)
- CentAUR: Central Archive University of Reading - UK (71)
- Central European University - Research Support Scheme (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (25)
- Cochin University of Science & Technology (CUSAT), India (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (41)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons @ DU | University of Denver Research (5)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (3)
- DRUM (Digital Repository at the University of Maryland) (4)
- Duke University (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (7)
- Greenwich Academic Literature Archive - UK (3)
- Harvard University (3)
- Helda - Digital Repository of University of Helsinki (7)
- Indian Institute of Science - Bangalore - Índia (31)
- Instituto Politécnico de Bragança (1)
- Massachusetts Institute of Technology (2)
- Memoria Académica - FaHCE, UNLP - Argentina (14)
- Ministerio de Cultura, Spain (111)
- National Center for Biotechnology Information - NCBI (8)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (158)
- Queensland University of Technology - ePrints Archive (40)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (53)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (3)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- School of Medicine, Washington University, United States (3)
- Universidad Autónoma de Nuevo León, Mexico (2)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (6)
- Universitat de Girona, Spain (8)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (4)
- Université de Montréal, Canada (4)
- University of Connecticut - USA (5)
- University of Michigan (145)
- University of Southampton, United Kingdom (2)
- WestminsterResearch - UK (4)
Resumo:
We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of such queries. This problem is related to determining the sensitivity of Boolean functions. We show how quantum parallelism can be used to detect such faults. Specifically, we show that a quantum algorithm can detect such faults more efficiently than a classical algorithm for a Parity gate and an AND gate. We give explicit constructions of quantum detector algorithms and show lower bounds for classical algorithms. We show that the model for detecting such faults is similar to algebraic decision trees and extend some known results from quantum query complexity to prove some of our results.