A Systematic Algorithm for Quantum Boolean Circuits Construction

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, LaTeX

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Systematic Algorithm for Quantum Boolean Circuits Construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Systematic Algorithm for Quantum Boolean Circuits Construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Systematic Algorithm for Quantum Boolean Circuits Construction will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-626586

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.