Academic Articles & Research Papers

Evidence for the utility of quantum computing before fault tolerance

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 ...

Potential of quantum computing for drug discovery

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...

Quantum Computing in the NISQ era and beyond

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...

Making reliable distributed systems in the presence of software errors

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...

STATE RESTORATION IN DISTRIBUTED SYSTEMS

A Fault-Tolerant Communication Architecture for Distributed Systems

A communication architecture for distributed processors is presented here. This architecture is based on a new topolgy we have developed, one which interconnects n nodes by using rn links where the maximum internode distance is logrn, and w...

Task allocation in fault-tolerant distributed systems

FAULT-DIAGNOSIS IN FULLY DISTRIBUTED SYSTEMS

The problem of diagnosis of failures, at the system level, in large, truly distributed networks of processing elements is considered. A model proposed earlier, in which nodes of the network perform tests upon certain neighboring nodes and p...

Exploiting virtual synchrony in distributed systems

We describe applications of a virtually synchronous environment for distributed programming, which underlies a collection of distributed programming tools in the ISIS 2 system. A virtually synchronous environment allows processes to be stru...

The timed asynchronous distributed system model

We propose a formal definition for the timed asynchronous distributed system model and we describe extensive measurements of actual message and process scheduling delays and hardware clock drifts that confirm that this model adequately desc...

Fault-Tolerant Message-Passing Distributed Systems

Fault Tolerance in Distributed Systems

The earlier parts of this book studied the coordinated behavior that can be achieved in distributed systems where processes are reliable . For several reasons it is attractive to study what coordinated behavior of processes is possible unde...

Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.

A general method is described for implementing a distributed system with any desired degree of faulttolerance.Instead of relying upon explicit timeouts, processes execute a simple clock-driven algorithm.Reliable clock synchronization and a ...

Broadcast protocols for distributed systems

An innovative approach is presented to the design of fault-tolerant distributed systems that avoids the several rounds of message exchange required by current protocols for consensus agreement. The approach is based on broadcast communicati...

Fault-tolerant clock synchronization in distributed systems

Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as ...

Quantum computing

The Church-Turing thesis says that a digital computer is a universal computational device; that is, it is able to simulate any physically realizable computational device. It has generally been believed that this simulation can be made effic...

Blind spots of randomized benchmarking under temporal correlations

Randomized benchmarking (RB) is a widely adopted protocol for estimating the average gate fidelity in quantum hardware. However, its standard formulation relies on the assumption of temporally uncorrelated noise, an assumption often violate...

Cryo-CMOS for quantum computing

Cryogenic CMOS, or cryo-CMOS circuits and systems, are emerging in VLSI design for many applications, in primis quantum computing. Fault-tolerant quantum bits (qubits) in surface code configurations, one of the most accepted implementations...

Identification of Different Types of High-Frequency Defects in Superconducting Qubits

Parasitic two-level-system (TLS) defects are one of the major factors limiting the coherence times of superconducting qubits. Although there has been significant progress in characterizing basic parameters of TLS defects, exact mechanisms o...

ZX-Diagram T-Count Reduction Based on Proximal Policy Optimization

In fault-tolerant quantum computing systems, the T gates consume more fault-tolerant resources. In this paper, we propose an automated optimization method based on the Proximal Policy Optimization (PPO) algorithm. We first translate quantum...