Related papers: Construction of Boolean Logic Gates Using QFT-Base…

We propose a prime factoring machine operated in a frame work of quantum annealing (QA). The idea is inverse operation of a quantum-mechanically reversible multiplier implemented with QA-based Boolean logic circuits. We designed the QA…

Design paradigms of logic circuits with Quantum-dot Cellular Automata (QCA) have been extensively studied in the recent past. Unfortunately, due to the lack of mature fabrication support, QCA-based circuits often suffer from various types…

We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple…

Electromagnetic wave-based computing has emerged as an exciting paradigm with the potential to enable high-speed, parallel operations. In conventional computing, elementary logic gates, such as AND, OR, NOT and XOR, form the building blocks…

Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…

Scaling quantum computers remains a substantial scientific and technological challenge. Leveraging the full range of intrinsic degrees of freedom in quantum systems offers a promising route towards enhanced algorithmic performance and…

We present an architecture-algorithm co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware. Analyzing the OQFT structure, particularly…

A quantum computer based on an asymmetric coupled dot system has been proposed and shown to operate as the controlled-NOT-gate. The basic idea is (1) the electron is localized in one of the asymmetric coupled dots. (2)The electron transfer…

Qudit-based quantum gates offer several advantages over qubit-based counterparts, such as higher information density, the ability to address more complex problems, and richer quantum operations. In this paper, we present three realistic…

The Fredkin three-bit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible two-bit gates only. Here we construct the Fredkin gate using a combination of six…

In this paper, we present a resistive switching memristor cell for implementing universal logic gates. The cell has a weighted control input whose resistance is set based on a control signal that generalizes the operational regime from NAND…

Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more…

The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expressions of mid-level quantum gates such as Toffoli and CCZ. In…

In order for quantum communications systems to become widely used, it will probably be necessary to develop quantum repeaters that can extend the range of quantum key distribution systems and correct for errors in the transmission of…

We study quantum information processing using superpositions of Fock states in superconducting resonators, as quantum $d$-level systems (qudits). A universal set of single and coupled logic gates is theoretically proposed for resonators…

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…

We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in…

We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. This problem arises whenever the adder is embedded into a more complex circuit, e. g. a multiplier. Most previous results are…

Exploiting the effects of quantum interference we put forward an idea of designing three primary logic gates, OR, AND and NOT, using a benzene molecule. Under a specific molecule-lead interface geometry, anti-resonant states appear which…

It is shown that the two qubit CNOT (controlled NOT) gate can also be realised using q-deformed angular momentum states via the Jordan-Schwinger mechanism.Thus all the three gates necessary for universality i.e. Hadamard, Phase Shift and…