Reset
Showing 20 of 4,465 academic articles

Quantum computing, postselection, and probabilistic polynomial-time

Scott Aaronson • Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences (2005)

I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic pol...

OPENALEX Open Access DOI: https://doi.org/10.1098/rspa.2005.1546

Quantum computing with Qiskit

Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich, Christopher J. Wood et al. • arXiv (Cornell University) (2024)

We describe Qiskit, a software development kit for quantum information science. We discuss the key design decisions that have shaped its development, and examine the software architecture and its core components. We demonstrate an end-to-en...

OPENALEX cc-by DOI: https://doi.org/10.48550/arxiv.2405.08810

Quantum computing for beginners

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

Quantum computing: pro and con

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

Quantum Computing in the NISQ era and beyond

John P. Preskill • Quantum (2018)

Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in q...

OPENALEX cc-by DOI: https://doi.org/10.22331/q-2018-08-06-79

Open source software in quantum computing

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

A Survey of Quantum Computing for Finance

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

The Breakdown of Coordinated Decision Making in Distributed Systems

Christopher R. Bearman, Susannah B. F. Paletz, Judith M. Orasanu, Matthew J. W. Thomas • Human Factors The Journal of the Human Factors and Ergonomics Society (2010)

OBJECTIVE: This article aims to explore the nature and resolution of breakdowns in coordinated decision making in distributed safety-critical systems. BACKGROUND: In safety-critical domains, people with different roles and responsibilities ...

OPENALEX Open Access DOI: https://doi.org/10.1177/0018720810372104

Effective Concurrency Testing for Distributed Systems

Xinhao Yuan, Junfeng Yang • International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (2020)

Despite their wide deployment, distributed systems remain notoriously hard to reason about. Unexpected interleavings of concurrent operations and failures may lead to undefined behaviors and cause serious consequences. We present Morpheus, ...

OPENALEX Open Access DOI: https://doi.org/10.1145/3373376.3378484

Local and temporal predicates in distributed systems

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

Cooperative load balancing in distributed systems

Daniel Grosu, Anthony Theodore Chronopoulos, Ming‐Ying Leung • Concurrency and Computation Practice and Experience (2008)

Abstract A serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. In this paper, we formulate the static load‐bal...

OPENALEX DOI: https://doi.org/10.1002/cpe.1331

Optimal Control of Spatially Distributed Systems

Nader Motee, Ali Jadbabaie • IEEE Transactions on Automatic Control (2008)

In this paper, we study the structural properties of optimal control of spatially distributed systems. Such systems consist of an infinite collection of possibly heterogeneous linear control systems that are spatially interconnected via cer...

OPENALEX DOI: https://doi.org/10.1109/tac.2008.929366

Parallel Spectral Clustering in Distributed Systems

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