Multiplexing is a technique used widely in electronics and networking to use a common channel or wire to transmit information between circuits or communicating agents on a network. Multiplexing is also economical as it saves the need for multiple transmission channels for different data pins. On the receiver end, a demultiplexer is used to divide the information from the common channel back to multiple data pins. To design a quantum multiplexer, this paper proposes two circuit designs using controlled SWAP (CSWAP) and controlled-R gates. A quantum circuit consists of combinations of quantum gates applied to one or more qubits in order to change or manipulate their quantum state. Here in this paper, we propose circuits for multiplexing multiple qubits. Generalized synthesis is done to construct higher-order multiplexers. Applications based on the proposed circuit design are also discussed along with the limit on the information that can be transferred using a quantum multiplexer which is presented as a corollary to the Holevo's Theorem. Holevo's theorem provides an upper limit to the amount of information that can be extracted from a qubit. It states that a qubit can encode only one bit of information. Later in this paper, we will see how this bound affects the design of a quantum multiplexer. Lastly, we also discuss and compare the complexities of the circuits that we have proposed.
Quantum computing is emerging as an alternative to the classical computer, based on the fundamental properties of quantum physics. This leads to develop quantum systems to solve complex problems which a classical system is unable to do. In this article, we propose the design of adders using low quantum cost full adder. Initially, full adder is proposed using CNOT and CCNOT gates, and later parallel adder and carry select adder are designed using it. Apart from full adder, additional gates are not required to design parallel adder while CSWAP gates are utilized to propose carry select adder. CSWAP gate is modeled as 2×1 multiplexer and used to select the output from any one among the two parallel adders that constitutes carry select adder. An open source IBM Qiskit tool is used to design and simulate the adder circuits and observed the metrics.
Abstract Designing conventional circuits present many challenges, including minimizing internal power dissipation. An approach to overcoming this problem is utilizing quantum technology, which has attracted significant attention as an alternative to Nanoscale CMOS technology. The reduction of energy dissipation makes quantum circuits an up-and-coming emerging technology. Ternary logic can potentially diminish the quantum circuit width, which is currently a limitation in quantum technologies. Using qutrit instead of qubit could play an essential role in the future of quantum computing. First, we propose two approaches for quantum ternary decoder circuit in this context. Then, we propose a quantum ternary multiplexer and quantum ternary demultiplexer to exploit the constructed quantum ternary decoder circuit. Techniques to achieve lower quantum cost are of importance. We considered two types of circuits, one in which the output states are always restored to the initial input states and the other in which the states of the output are irrelevant. We compare the proposed quantum ternary circuits with their existing counterparts and present the improvements. It is possible to realize the proposed designs using macro-level ternary gates that are based on the ion-trap realizable ternary 2-qutrit Muthukrishnan–Stroud and 1-qutrit permutation gates.
Multiplexer and demultiplexer circuits are among the main circuits in designing the complicated hardware. Therefore, enhancing their performance is very important. In the last few years one of the cases that got the attention of the researchers is designing circuits with low power. Using the reversible logic in designing the circuits can reduce power dissipation and power consumption. Using the ternary logic also leads to a better performance, reducing the power consumption and enhancing of fault tolerance in reversible circuits. In this paper, we have presented quantum reversible ternary multiplexer and demultiplexer circuits, we have used reversible ternary shift and controlled Feynman gates. Presented circuits in this paper have a better performance in compared to the previous designs. The improvements are reported.
Abstract In recent years, ternary reversible logic has become a promising paradigm for advancing low-power, high-performance quantum digital systems that preserve information and are energy efficient. This paper focuses on two primary objectives: first, the efficient realization of ternary reversible
3×1 3 × 1 multiplexers and
1×3 1 × 3 demultiplexers using quantum gates, specifically 1-qutrit Shift and 3-qutrit Controlled Feynman gates, and second, the design of generalized
n×1 n × 1 multiplexers and
1×n 1 × n demultiplexers. The proposed
9×1 9 × 1 multiplexer we propose in this study has demonstrated notable improvements in terms of quantum cost (20%), depth (18%), number of constant inputs (60%), and garbage outputs (30%), while the proposed
1×9 1 × 9 demultiplexer shows a 20% reduction in quantum cost, a 18% reduction in depth, a 33% reduction in constant inputs, and a 50% reduction in garbage outputs, compared to the most efficient existing designs. These optimizations represent an important step forward in the development of more efficient ternary and quantum reversible logic circuits, advancing the scalability of quantum systems.
This research paper presents an innovative approach to combinational circuit design that integrates quantum and conventional computation methods. Unlike traditional circuits utilizing logic gates, this approach exploits quantum gates, with a particular focus on replacing the CCNOT gate with the CSWAP gate. The substitution is aimed at improving computation performance and accuracy in quantum circuits while reducing gate consumption. The study offers a systematic methodology for designing combinational circuits, emphasizing the translation of classical logic functions into their quantum counterparts. This provides valuable insights into the development of precise and efficient quantum combinational circuits, advancing discussions on the integration of quantum computing through strategic utilization of the CSWAP gate.