The importance of coroutines as a programming paradigm is recognized. This paper proposes to extend LOTOS with a coroutine operator, for which syntax, static semantics, and untimed semantics are provided. We show that this coroutine mechanism generalizes several other op-eratorrs, which exist in LOTOS or which have been proposed for E-LOTOS, including trap, suspend-resume, and hiding. 1 Comment...

In this lecture, we will talk about circuit lower bound for constant-depth circuit with MODp gates. Using switching lemma, we can prove exponential size lower bound for constant-depth circuit computing parity and majority. What if parity (=MOD2 gates) are allowed? It was conjectured that majority still needs exponential size to compute in constant-depth circuit. Razborov (1987) solves this conj...

Oscillating magnetic fields and field gradients can be used to implement single-qubit rotations and entangling multiqubit quantum gates for trapped-ion quantum information processing (QIP). With fields generated by currents in microfabricated surface-electrode traps, it should be possible to achieve gate speeds that are comparable to those of optically induced gates for realistic distances betw...

Abstract: Dynamic Domino logic circuits are widely used in modern digital VLSI circuits. Because it is simple to implement, low cost designs in CMOS Domino logic are presented. Compared to static CMOS logic, dynamic logic offers good performance. Wide fan-in logic such as domino circuits is used in high-performance applications. Domino gates typically consume higher dynamic switching and leakag...

Large-scale quantum computers will require the ability to apply long sequences of entangling gates to many qubits. In a photonic architecture, where single-qubit gates can be performed easily and precisely, the application of consecutive two-qubit entangling gates has been a significant obstacle. Here, we demonstrate a two-qubit photonic quantum processor that implements two consecutive CNOT ga...

It is known that every two-qubit unitary operation has Schmidt rank one, two or four, and the construction of three-qubit gates in terms remains an open problem. We explicitly construct from one to seven. turns out Toffoli Fredkin gate, respectively, have four. As application, we implement using quantum circuits CNOT local Hadamard flip gates. In particular, collective use three can generate a ...

This paper presents the first reported joint gate sizing and buffer insertion method for minimizing the delay of power constrained combinational logic networks that can incorporate a mixture of unbuffered and buffered gates (or mixture of CMOS and BiCMOS gates). In the method, buffered gates in a network are decided on by an iterative process that uses a sequence of sizing optimizations where a...

This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of π/2 k , into an efficient fault-tolerant form using only Hadamard, controlled-not, a...

We present some compact quantum circuits for a deterministic quantum computing on electron-spin qubits assisted by quantum dots inside single-side optical microcavities, including the CNOT, Toffoli, and Fredkin gates. They are constructed by exploiting the giant optical Faraday rotation induced by a single-electron spin in a quantum dot inside a single-side optical microcavity as a result of ca...