arXiv subjects

S. Y. Kuo

Publications and source records attributed to S. Y. Kuo.

3 recordsLinked to original sources

arXiv2004

Experimental Realization of an NMR Quantum Switch

In this paper, we report an experimental realization of quantum switch using nuclear spins and magnetic resonant pulses. The nuclear spins of H and C in carbon-13 labelled chloroform are used to carry the information, then nuclear magnetic resonance pulses are applied to perform either bypass or cross function to achieve the switching. Compared with a traditional space or time domain switch, this switching architecture is much more scalable, therefore a high throughput switching device can be built simply by increasing the number of I/O ports. In addition, it can be used not only as a device to switch classical information, but also a building block of quantum information networks.

quant-ph↗

arXiv2002

Digital Switching in the Quantum Domain

In this paper, we present an architecture and implementation algorithm such that digital data can be switched in the quantum domain. First we define the connection digraph which can be used to describe the behavior of a switch at a given time, then we show how a connection digraph can be implemented using elementary quantum gates. The proposed mechanism supports unicasting as well as multicasting, and is strict-sense non-blocking. It can be applied to perform either circuit switching or packet switching. Compared with a traditional space or time domain switch, the proposed switching mechanism is more scalable. Assuming an n-by-n quantum switch, the space consumption grows linearly, i.e. O(n), while the time complexity is O(1) for unicasting, and O(log n) for multicasting. Based on these advantages, a high throughput switching device can be built simply by increasing the number of I/O ports.

quant-ph↗

arXiv2001

A Systematic Algorithm for Quantum Boolean Circuits Construction

To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This inefficient implementation causes a large number of auxiliary qubits to be used. In this paper, we have derived a systematic way of realizing any general m-to-n bit combinational boolean logic using elementary quantum gates. Our approach transforms the m-to-n bit classical mapping into a t-bit unitary quantum operation with minimum number of auxiliary qubits, then a variation of Toffoli gate is used as the basic building block to construct the unitary operation. Finally, each of these building blocks can be decomposed into one-bit rotation and two-bit control-U gates. The efficiency of the network is taken into consideration by formulating it as a constrained set partitioning problem.

quant-ph↗