Down to the Wires
Down to the Wires
  • 117
  • 295 644
Classical logic with Quantum gates
The toffoli gate is universal, in that it can perform any classical logic. In this video I show briefly how to implement classical logic functions with only Toffoli gates. We introduce toffoli, show it's classical interpretation, show how to produce AND and NOT classical functions, how to build a simple logical function, and then we show OR. We remind the viewer that any input superposition values that are altered should be restored.
Переглядів: 1 428

Відео

Intro to Current Events playlist
Переглядів 153Рік тому
This playlist will be a place for conversations about issues of technology in general, from AI to social media, and the impact of technology on society. I am often asked to provide expert commentary to media organizations, and this is a way to expand the conversation to other audiences.
9 ARM autoindexing
Переглядів 150Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
8 ARM Load Store
Переглядів 155Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
7 ARM Multiply
Переглядів 72Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
6 ARM Shifting
Переглядів 83Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
5 ARM Immediate Encoding Examples
Переглядів 1,1 тис.Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
4 ARM Operand 2 for Data
Переглядів 182Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
3 ARM Data Instructions
Переглядів 189Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
2 ARM Programmer Model
Переглядів 180Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
1 ARMv7 Intro
Переглядів 468Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP8 Doing Math with Floating Point Numbers
Переглядів 922Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP7 Denormalized, Denormal, or Subnormal Numbers
Переглядів 1,1 тис.Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP6 Special numbers
Переглядів 193Рік тому
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
FP5 Conversion Examples
Переглядів 226Рік тому
FP5 Conversion Examples
FP4 Ranges and Exclusions of Floating Point Numbers
Переглядів 774Рік тому
FP4 Ranges and Exclusions of Floating Point Numbers
FP3 An 8-bit Toy Encoding of Floating Point Numbers
Переглядів 978Рік тому
FP3 An 8-bit Toy Encoding of Floating Point Numbers
FP2 Floating Point Theory
Переглядів 227Рік тому
FP2 Floating Point Theory
FP1 Fractional Numbers
Переглядів 382Рік тому
FP1 Fractional Numbers
Faster binary addition: the carry lookahead adder
Переглядів 1,1 тис.Рік тому
Faster binary addition: the carry lookahead adder
Architecture 2: introduction to the next series
Переглядів 1572 роки тому
Architecture 2: introduction to the next series
MD3: more efficient hardware
Переглядів 3163 роки тому
MD3: more efficient hardware
MD6: Sequential Division
Переглядів 7113 роки тому
MD6: Sequential Division
MD5: Signed (Arithmetic shifting)
Переглядів 2483 роки тому
MD5: Signed (Arithmetic shifting)
MD4: Signed Multiplication and Booth's Algorithm
Переглядів 3903 роки тому
MD4: Signed Multiplication and Booth's Algorithm
MD2: Multiplication Process
Переглядів 5023 роки тому
MD2: Multiplication Process
MD1: Intro to multiplication
Переглядів 7123 роки тому
MD1: Intro to multiplication
Simplification 6: NAND implementation example
Переглядів 8 тис.3 роки тому
Simplification 6: NAND implementation example
Simplification 5: Universal Gates
Переглядів 1 тис.3 роки тому
Simplification 5: Universal Gates
CircuitVerse
Переглядів 1,3 тис.3 роки тому
CircuitVerse

КОМЕНТАРІ

  • @igtg
    @igtg 7 днів тому

    thanks man !

  • @DanielAmaral-u7f
    @DanielAmaral-u7f 9 днів тому

    Great lesson, Master! Where can i access these slides?

  • @DeaMantel
    @DeaMantel 10 днів тому

    Your my Uncle

  • @SaturnSilk-uw8jn
    @SaturnSilk-uw8jn 16 днів тому

    7:17 I didn't get this 😢 someone please explain

  • @mohammadrezaramezani1134
    @mohammadrezaramezani1134 26 днів тому

    TNX a bunch sir, how can we get access to these shits ?

  • @jesonchen8556
    @jesonchen8556 Місяць тому

    brilliant!

  • @valsnemakonde6936
    @valsnemakonde6936 Місяць тому

    How do we just say the bias is 3, I didn't get that part

  • @oliviaabamba9686
    @oliviaabamba9686 Місяць тому

    Thank you

  • @EyubTosun
    @EyubTosun Місяць тому

    can you do an example for maxterms and pos

  • @ercodex
    @ercodex Місяць тому

    superb!!!

  • @Mashamelloow
    @Mashamelloow Місяць тому

    In 2:36 should be just ABD and not ABD'

  • @mba849
    @mba849 Місяць тому

    Watched all of your videos and now im ready for my exam coming up (hopefully). Thank you so much for making such easy and simple explanations.

  • @raztabraze
    @raztabraze Місяць тому

    very good explanation

  • @tharinduft
    @tharinduft 2 місяці тому

    These state diagrams made me go crazy, until I've watched this tutorial. Thank you so much!!!

  • @Thomas-mt9bt
    @Thomas-mt9bt 2 місяці тому

    thank you for this video! do you still have the reference sheet?

  • @borgin1031
    @borgin1031 2 місяці тому

    can you expound more on how line 4 was distributed in product of maxterms

  • @behnamyosufi3800
    @behnamyosufi3800 2 місяці тому

    THANK YOU! <3

  • @behnamyosufi3800
    @behnamyosufi3800 2 місяці тому

    Thank you so much! The whole playlist helped me a ton - never delete them; these videos are the best! God bless!

  • @danieldakin5977
    @danieldakin5977 2 місяці тому

    Thankyou so much

  • @steezydi
    @steezydi 2 місяці тому

    sir you are goated

  • @madmalik2776
    @madmalik2776 2 місяці тому

    I learned more with these 4 videos than in the past few weeks. Thanks a lot!

  • @madmalik2776
    @madmalik2776 2 місяці тому

    I wish I had a professor like you in my college

  • @madmalik2776
    @madmalik2776 2 місяці тому

    very helpful, thank you so much

  • @prism_schism
    @prism_schism 2 місяці тому

    uh

  • @cryptoinside8814
    @cryptoinside8814 3 місяці тому

    Another question…a qubit can represent more than one bit, is it due to its spin direction and angle ? For example, a qubit can spin up or down, therefore the spin up can represent 1 and spin down can represent 0, and thus one qubit can represent one bit. In addition to up/down spin, it can also spin at an angle, for example, 90 degrees, 180 degrees or 270 degrees. So, from this degree distinction, a qubit can represent more bits. Thus, more angles more bit representation. My question is, how do you detect and measure the direction and angle of a qubit ?

  • @cryptoinside8814
    @cryptoinside8814 3 місяці тому

    For example, when you implement an AND gate, there are two physical transistors tied together with two bit inputs and one output. So with qubits, how do you physically AND two qubits and detect the one output ?

  • @thanos2316
    @thanos2316 3 місяці тому

    Best explaination ever

  • @MohammadJavadd
    @MohammadJavadd 5 місяців тому

    Sir, you are a great teacher! Thanks so much ❤❤❤❤

  • @inxendere
    @inxendere 6 місяців тому

    This is the best, most concise explanation of this I've ever seen. Thank you.

  • @mertkayaer8964
    @mertkayaer8964 6 місяців тому

    that was very helpful. thanks

  • @lemessabedessa
    @lemessabedessa 6 місяців тому

    Thank you

  • @boyblockg
    @boyblockg 6 місяців тому

    thank you very much so easy to understand

  • @rissun3141
    @rissun3141 6 місяців тому

    Holy wow”, this explanation is so clear! 💫

  • @reapnia
    @reapnia 6 місяців тому

    ABI BEN SENIN DASAGINI YIYEYIM

  • @ИванИгнатенко-ш8п
    @ИванИгнатенко-ш8п 7 місяців тому

    You look like Ryan Gosling

  • @thepotatoofheaven
    @thepotatoofheaven 8 місяців тому

    what's a "literal"

  • @Gillass
    @Gillass 8 місяців тому

    very well explained, thank you

  • @KevinMuratalla
    @KevinMuratalla 8 місяців тому

    Thank you. Took long enough to find someone who could actually explain this in an easy matter

  • @cheesypizzajokes
    @cheesypizzajokes 8 місяців тому

    Thanks!

  • @labiribiri1901
    @labiribiri1901 8 місяців тому

    What is the difference between a bubble and an inverter if they both do the same?

    • @DowntotheWires
      @DowntotheWires 8 місяців тому

      A bubble is just a shorthand notation for logical inversion, either on an input or an output of a gate. its quicker and easier than drawing a complete inverter. The transistor implementation of a NAND gate is smaller and faster than an AND gate and a NOT gate, but for the logic problems it's the same.

  • @schavery
    @schavery 9 місяців тому

    Have to admit I was confused by the title - I was looking for a discussion of the 4-bit floating point representation commonly used in ML applications these days, and referred to as FP4 (as opposed to FP8, FP16, or FP32, talking about the bit representation length), and it seems that this video only discusses FP8. Then I realized that it might be the course or module number for this video. Whoops!

  • @Lyssemm
    @Lyssemm 9 місяців тому

    Great video! Just found your channel today! Will there be more "Current Event" Videos soon?

    • @DowntotheWires
      @DowntotheWires 9 місяців тому

      That’s the plan! Are there specific topics you’d like to see covered?

  • @dinosauce-u8f
    @dinosauce-u8f 9 місяців тому

    shoutout to u sir

  • @hugorico3872
    @hugorico3872 9 місяців тому

    Saviour!

  • @philobatirnabil7462
    @philobatirnabil7462 9 місяців тому

    I have been struggling with full adder for almost a year cause i was new to logical circuits and your explanation is amazing thank you.

  • @AthaillahS
    @AthaillahS 9 місяців тому

    Is there any difference in changing POM to SOM with duality and demorgan's law? Suppose i have POM of (a,b) = M0.M1. Is the SOM m0+m1 (using demorgans) or m2+m3 (using duality)?

  • @ChiemelieMomah
    @ChiemelieMomah 9 місяців тому

    amazing explanation

  • @wilsonchen5224
    @wilsonchen5224 10 місяців тому

    W rizz bro you're saving my life rn

  • @krishshah3974
    @krishshah3974 10 місяців тому

    great video, thank you

  • @calebkrauter4027
    @calebkrauter4027 10 місяців тому

    Amazing explanation. Thank you!