Home »
Academic Articles & Research Papers
Showing 20 of 4,567 academic articles
Zebo Yang, Maede Zolanvari, Raj Kumar Jain • IEEE Communications Surveys & Tutorials
(2023)
Driven by the rapid progress in quantum hardware, recent years have witnessed a furious race for quantum technologies in both academia and industry. Universal quantum computers have supported up to hundreds of qubits, while the scale of qua...
OPENALEX
cc-by
DOI: https://doi.org/10.1109/comst.2023.3254481
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
Prashant S. Emani, Jonathan Warrell, Alan Anticevic, Stefan Bekiranov et al. • Nature Methods
(2021)
OPENALEX
Open Access
DOI: https://doi.org/10.1038/s41592-020-01004-3
PMC: 8254820
Marcello Caleffi, Michele Amoretti, Davide Ferrari, Jessica Illiano et al. • Computer Networks
(2024)
Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundreds of noisy qubits. Yet – to fully unveil the potential of quantum computing out of the labs into the business reality...
OPENALEX
cc-by-nc-nd
DOI: https://doi.org/10.1016/j.comnet.2024.110672
Young‐Seok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei et al. • Nature
(2023)
Abstract Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely ...
OPENALEX
cc-by
DOI: https://doi.org/10.1038/s41586-023-06096-3
PMC: 10266970
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
Joe Armstrong (2003)
The work described in this thesis is the result of aresearch program started in 1981 to find better ways ofprogramming Telecom applications. These applications are largeprograms which despite careful testing will probably containmany errors...
OPENALEX
Open Access
Jian Chen, Valerie Taylor • ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)
(2002)
Distributed systems, which consist of a collection of high performance systems interconnected via high performance networks (e.g. ATM), are becoming feasible platforms for execution of large-scale, complex problems. We address various issue...
OPENALEX
DOI: https://doi.org/10.1109/hpdc.1998.710015
Pei-Jyun Leu, Bharat Bhargava • IEEE International Conference on Data Engineering (ICDE)
(2003)
A checkpoint/rollback algorithm is presented for multiple processes in a distributed system that uses message passing for communication. Each process in the system can initiate the algorithm autonomously. If only one instance of the algorit...
OPENALEX
DOI: https://doi.org/10.1109/icde.1988.105457
G.R. Nudd, Darren J. Kerbyson, E. Papaefstathiou, S. C. Perry et al. • The International Journal of High Performance Computing Applications
(2000)
This paper describes a methodology that provides detailed predictive performance information throughout the software design and implementation cycles. It is structured around a hierarchy of performance models that describe the computing sys...
OPENALEX
DOI: https://doi.org/10.1177/109434200001400306
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
Massimo Bartoletti, Emilio Tuosto, Roberto Zunino • Electronic Proceedings in Theoretical Computer Science
(2011)
We present a parametric calculus for contract-based computing in distributed systems. By abstracting from the actual contract language, our calculus generalises both the contracts-as-processes and contracts-as-formulae paradigms. The calcul...
OPENALEX
cc-by-nc-nd
DOI: https://doi.org/10.4204/eptcs.59.11
Bernadette Charron-Bost, Carole Delporte-Gallet, Hugues Fauconnier • ACM Transactions on Programming Languages and Systems
(1995)
The definitions of the predicates Possibly φ and Definitely φ, where φ is a global predicate of a distributed computation, lead to the definitions of two predicate transformers P and D . We show that P plays the same role with respect to ti...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/200994.201005
George Coulouris, Jean Dollimore, Tim Kindberg • Addison-Wesley Longman Publishing Co., Inc. eBooks
(2000)
OPENALEX
Tushar Deepak Chandra, Sam Toueg • Journal of the ACM
(1996)
We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties—completeness and...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/226643.226647
Andriy Luntovskyy, Dietbert Gütter • Springer eBooks
(2022)
OPENALEX
DOI: https://doi.org/10.1007/978-3-030-92829-2
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
Roberto Baldoni, Maarten R. van Steen, Nicolas Nisse • Lecture notes in computer science
(2013)
OPENALEX
DOI: https://doi.org/10.1007/978-3-319-03850-6