Skip to main content
9 events
when toggle format what by license comment
Mar 24, 2020 at 15:32 vote accept Bidon
Mar 24, 2020 at 11:31 comment added Bidon @MartinVesely Yes, I meant Karnaugh map. The pronounciation tricked me. Thank you
Mar 24, 2020 at 11:20 comment added Martin Vesely @gIS: But what about NAND implemented by Toffoli? This gate is also decomposed to CNOTs, H, S and T gates. Or swap gate implemented by three CNOTs.
Mar 24, 2020 at 11:17 comment added glS @MartinVesely "After that you have to decompose the matrix to some basic gates" Do you? If the overall gate can be built from a truth table, presumably it's performing some classical algorithm. Then you can just use the elementary logic gates defining the classical algorithm and replace each one with its reversible counterpart. No need to further decompose the gate afterwards (well unless the gates implementing the elementary operations need to be decomposed)
Mar 24, 2020 at 11:02 comment added Martin Vesely @Bidon: Yes, you are right. The process is not very straighforward on quantum computers. I added two more articles on quantum gate decomposition, maybe they help. Besides, you mentioned Carnot map, did you mean Karnaugh map for logical function minimization?
Mar 24, 2020 at 11:00 history edited Martin Vesely CC BY-SA 4.0
Added other sources.
Mar 24, 2020 at 10:22 comment added Bidon Well yes, that is a quite straightforward way to make single qubit gates, but what about 2,3 and even 4 qubit circuits? We then have to account for several kinds of gates, even taking sometimes two qubit gates, or maybe three qubit gates. Classically Carnot maps are independent of the number of variables used, we can always apply it. But in QC that doesn't seem to be the case
Mar 23, 2020 at 23:15 history edited Martin Vesely CC BY-SA 4.0
added 1 character in body
Mar 23, 2020 at 23:09 history answered Martin Vesely CC BY-SA 4.0