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.
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.
CMOS technology is expected to come to an end in performance and accuracy due to limitations of the shirking of the transistors. To overcome these limitations, researchers are working towards the development of quantum circuits that provide high-speed processing. In this work, high-end quantum multiplexer and demultiplexer circuits are proposed using a controlled SWAP (CSWAP) gate with low quantum cost. The proposed circuits are implemented using quantum gates and simulated to reduce complexity and improve performance. The software tool used for the design and simulation of the proposed structures is IBM Qiskit with python coding. It is observed from the simulation results that the proposed multiplexers are improved by more than 28% compared with the existing designs available so far in the literature.
In communication networks many different channels must share a limited amount of resources. In order to allow for multiple simultaneous communications, multiple access techniques are routinely employed. With quantum communication, it is possible to share a new kind of resource. All of the system channels can be accommodated into a single channel in a larger Hilbert space. In the scheme, a single line combines the information of all the users, and, at the receiver, the original quantum channels are recovered. The given multiplexer/demultiplexer circuit can perform this n qubits to qudit transformation. Connections with superdense coding and classical multiple access schemes are discussed.
A quantum multiplexer architecture is proposed based on quantum neural networks (QNNs), in which the routing of quantum information is realized through a trainable parameterized quantum circuit rather than the fixed controlled logic. In this approach, multiple quantum input channels and a selector register are jointly processed by a variational quantum circuit whose parameters are optimized to route the selected input state to a designated output register. The resulting QNN-based multiplexer naturally generalizes to multiple-input scenarios without requiring an explicit cascade of controlled-SWAP gates. We outline the circuit architecture, training strategy, and loss functions required to learn the multiplexing behavior, and discuss the advantages of adaptability, noise tolerance, and reduced circuit depth in near-term quantum devices. This framework provides a flexible alternative to conventional quantum multiplexers and may serve as a building block for quantum routing, data loading, and hybrid quantum– classical machine learning applications.
Quantum information science addresses how the storage, processing, and transmission of information are affected by uniquely quantum mechanical phenomena, such as superposition and entanglement. New technologies that harness these quantum effects are beginning to be realized in the areas of communication, information processing and precision measurement. For the realization of a universal gate set, by which, in principle, any quantum information task can be realized, two-qubit gates have been demonstrated and have been used to realize small-scale quantum circuits. However, scalability is becoming a critical problem. It may therefore be helpful to consider the use of three-qubit gates, which can simplify the structure of quantum circuits dramatically. Although both the controlled-SWAP (CSWAP) gate (also called Fredkin gate) and the controlled-controlled-NOT gate (also called Toffoli gate) are representative three-qubit gates, the Fredkin gates can be directly applied to many important quantum information protocols, e.g., error correction, fingerprinting, optimal cloning, and controlled entanglement filtering. Here we report a realization of the Fredkin gate using a photonic quantum circuit, following the theoretical proposal by Fiurasek. We achieve a fidelity of 0.85 for the classical truth table of CSWAP operation and an output state fidelity of 0.81 for a generated 3-photon Greenberger-Horne-Zeilinger (GHZ) state. We also confirmed that the gate is capable of genuine tripartite entanglement with a quantum coherence corresponding to a visibility of 0.69 for three-photon interferences. From these results, we estimate a process fidelity of 0.77, which indicates that our Fredkin gate can be applied to various quantum tasks.
As a model for quantum computation, quantum circuits have found their wide applications in communications, cryptography and information processing. In order to synthesize arbitrary quantum circuits, we present a new type of gate called quantum multiplex rotation gate, which is implemented by simply elementary gates. A method based on QR decomposition and two optimization rules are proposed to decompose general quantum circuit acting on n-qubits into quantum multiplex rotation gates. In comparison with other synthesis algorithms by QR decomposition, our methods achieve better performance in terms of elementary gate counts, 1.2 × 4n approximately.