Timeline for Is there a systematic way to build quantum circuits?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2020 at 9:13 | history | edited | glS♦ |
edited tags
|
|
| Mar 24, 2020 at 15:32 | vote | accept | Bidon | ||
| Mar 24, 2020 at 11:07 | comment | added | Martin Vesely | @Bidon: Partial answer: you can implement any classical logical function with construction I provided at the begining of my answer below. Or since Toffoli gate implements NAND function, you can use these gates to build any logical function you can build "classicaly" because NAND is universal gate. However, as gIS mentioned, this way in not efficient and there is no speed-up on quantum computer in comparison with classical one. | |
| Mar 24, 2020 at 10:29 | comment | added | Bidon | From the first part of your comment, can you reference me to any literature? How would I make a quantum circuit that would do the exact same thing as the classical counterpart? Is it a obvious proof? Couldn't it be a good starting point to any efficient algorithm? | |
| Mar 24, 2020 at 10:24 | comment | added | glS♦ | you can systematically build quantum circuits that do the same thing their classical counterparts do. It's worth stressing that this would not provide algorithms that give any advantage over classical computing. Quantum algorithms that outperform classical ones usually work in completely different ways, and there is no systematic way to find them as of yet (that I know of at least) | |
| Mar 23, 2020 at 23:09 | answer | added | Martin Vesely | timeline score: 4 | |
| Mar 23, 2020 at 22:41 | history | edited | Martin Vesely | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Mar 23, 2020 at 21:56 | history | asked | Bidon | CC BY-SA 4.0 |