Home »
Academic Articles & Research Papers
Showing 20 of 777 academic articles
A. O. Pittenger • Birkhäuser Boston eBooks
(2000)
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficult...
OPENALEX
DOI: https://doi.org/10.1007/978-1-4612-1390-1
Jared D. Weidman, Manas Sajjan, Camille A. Mikolas, Zachary J. Stewart et al. • Cell Reports Physical Science
(2024)
As the year-to-year gains in speeds of classical computers continue to taper off, computational chemists are increasingly examining quantum computing as a possible route to achieve greater computational performance. Quantum computers, built...
OPENALEX
cc-by-nc-nd
DOI: https://doi.org/10.1016/j.xcrp.2024.102105
N. Cody Jones, Rodney Van Meter, Austin G. Fowler, Peter L. McMahon et al. • Physical Review X
(2012)
We develop a layered quantum computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. We discuss many of the prominent techni...
OPENALEX
cc-by
DOI: https://doi.org/10.1103/physrevx.2.031007
Yifan Zhou, Zefan Tang, Nima Nikmehr, Pouya Babahajiani et al. • iEnergy
(2022)
Electric power systems provide the backbone of modern industrial societies. Enabling scalable grid analytics is the keystone to successfully operating large transmission and distribution systems. However, today's power systems are suffering...
OPENALEX
cc-by
DOI: https://doi.org/10.23919/ien.2022.0021
Daniel J. Egger, Claudio Gambella, Jakub Marecek, Scott McFaddin et al. • IEEE Transactions on Quantum Engineering
(2020)
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in fin...
OPENALEX
cc-by
DOI: https://doi.org/10.1109/tqe.2020.3030314
A. Narayanan • IEEE Congress on Evolutionary Computation (CEC)
(2003)
The paper introduces the basic concepts and principles behind quantum computing and examines in detail Shor's (1994) quantum algorithm for factoring very large numbers. Some basic methodological principles and guidelines for constructing qu...
OPENALEX
DOI: https://doi.org/10.1109/cec.1999.785552
John P. Preskill • Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
(1998)
I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones. Quan...
OPENALEX
Open Access
DOI: https://doi.org/10.1098/rspa.1998.0171
Stefanie Barz, Elham Kashefi, Anne Broadbent, Joseph F. Fitzsimons et al. • Science
(2012)
Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and out...
OPENALEX
Open Access
DOI: https://doi.org/10.1126/science.1214707
Yudong Cao, Jonathan Romero, Alán Aspuru‐Guzik • IBM Journal of Research and Development
(2018)
Quantum computing has rapidly advanced in recent years due to substantial development in both hardware and algorithms. These advances are carrying quantum computers closer to their impending commercial utility. Drug discovery is a promising...
OPENALEX
DOI: https://doi.org/10.1147/jrd.2018.2888987
James C. L. Chow • Medical Sciences
(2024)
Quantum computing (QC) represents a paradigm shift in computational power, offering unique capabilities for addressing complex problems that are infeasible for classical computers. This review paper provides a detailed account of the curren...
OPENALEX
cc-by
DOI: https://doi.org/10.3390/medsci12040067
PMC: 11586987
Mark Fingerhuth, Tomáš Babej, Péter Wittek • PLoS ONE
(2018)
Open source software is becoming crucial in the design and testing of quantum algorithms. Many of the tools are backed by major commercial vendors with the goal to make it easier to develop quantum software: this mirrors how well-funded ope...
OPENALEX
cc-by
DOI: https://doi.org/10.1371/journal.pone.0208561
PMC: 6301779
Dylan Herman, Cody Googin, Xiaoyuan Liu, Alexey Galda et al. • RePEc: Research Papers in Economics
(2022)
Quantum computers are expected to surpass the computational capabilities of classical computers during this decade and have transformative impact on numerous industry sectors, particularly finance. In fact, finance is estimated to be the fi...
OPENALEX
Open Access
DOI: https://doi.org/10.48550/arxiv.2201.02773
Xiao Chen • Scalable Computing Practice and Experience
(2000)
Jie Wu CRC Press Publishing Company, Boca Raton, FL, 1998, 496 pp. ISBN 0-8493-3178-1, $74.95 The Distributed System Design is a superbly organized, comprehensive exposition of basic concepts, issues, and some possible solutions in the di...
OPENALEX
DOI: https://doi.org/10.12694/scpe.v3i1.173
Aloysius K. Mok • DSpace@MIT (Massachusetts Institute of Technology)
(1983)
Software designed to function in a hard-real-time environment where strict timing constraints must be met often entails implicit assumptions about a programming language and the underlying system which supports it. Programs which are logica...
OPENALEX
cc-by-nc
Miron Livny, Myron Melman • ACM SIGMETRICS Performance Evaluation Review
(1982)
Three different load balancing algorithms for distributed systems that consist of a number of identical processors and a CSMA communication system are presented in this paper. Some of the properties of a multi-resource system and the balanc...
OPENALEX
DOI: https://doi.org/10.1145/1010631.801689
Guohong Cao, Mukesh Singhal • IEEE Transactions on Parallel and Distributed Systems
(1998)
Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, the approach suffers from high overhead associated with the che...
OPENALEX
DOI: https://doi.org/10.1109/71.737697
Patrick Th. Eugster, Rachid Guerraoui, Anne-Marie Kermarrec, Laurent Massoulié • Computer
(2004)
Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially effective mechanism for propagating information in large peer-to-peer systems deployed on Internet or ad hoc networks. It is possible to adjust ...
OPENALEX
Open Access
DOI: https://doi.org/10.1109/mc.2004.1297243
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih‐Jen Lin et al. • IEEE Transactions on Pattern Analysis and Machine Intelligence
(2010)
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms, such as k-means. However, spectral clustering suffers from a scalability problem in both memory use and computational ...
OPENALEX
DOI: https://doi.org/10.1109/tpami.2010.88
Tomoya Enokido, Makoto Takizawa • IEEE Transactions on Industrial Electronics
(2012)
In order to realize green ecosocieties, the total electric power consumption of computers and networks is required to be reduced. In applications on distributed systems, clients issue service requests to servers and then servers send replie...
OPENALEX
DOI: https://doi.org/10.1109/tie.2012.2206357
Virginia M. Lo • IEEE Transactions on Computers
(1988)
Investigate the problem of static task assignment in distributed computing systems, i.e. given a set of k communicating tasks to be executed on a distributed system of n processors, to which processor should each task be assigned? The autho...
OPENALEX
DOI: https://doi.org/10.1109/12.8704