Building the Bits and Qubits

Поділитися
Вставка
  • Опубліковано 28 тра 2014
  • What is computation? ...and what is quantum computation?
    CORRECTIONS:
    8:01 The Pauli-X gate does NOT flip the direction of the qubit. It rotates it 180 degrees about the x-axis, where the x-axis is pointing out of the screen.
    9:41 This graph is wrong. The Shor curve should be below the Classical curve since it takes LESS time.
    Sources:
    Quantum Computing for Computer Scientists
    books.google.ca/books/about/Qu...
    Quantum Computers: Fundamentals, Application and Implementation
    www.tngtech.com/assets/btd/btd6/BenjaminFeldman_BTD6.pptx
    Quantum Computation Roadmap
    qist.lanl.gov/qcomp_map.shtml
    WATERLOO NEWS
    uwaterloo.ca/news/news/experi...
    Engineer Guy
    www.engineerguy.com/
    Numberphile
    www.numberphile.com/
    Images:
    Cat:
    cheezburger.com/6403122944
    Dog:
    www.quickmeme.com/meme/3qmjkj
    Loop Quantum Gravity:
    commons.wikimedia.org/wiki/File:Loop_quantum_gravity.jpg
    Billiard Ball Tube Gate:
    commons.wikimedia.org/wiki/Fil...
    Republished under the terms of the Creative Commons Attribution-Share Alike 2.5 Generic license
    creativecommons.org/licenses/b...
    Water Valve Gate:
    en.wikipedia.org/wiki/File:Hyd...
    Republished under the terms of the GNU Free Documentation License
    en.wikipedia.org/wiki/Wikipedi...
    Boolean Algebra Book:
    books.google.ca/books/about/An...
    Music downloaded from the UA-cam Audio Library:
    Phase Three
    The Messenger
    Good Starts
    Camaguey
    First Day
    Where I am From

КОМЕНТАРІ • 277

  • @frameofessence
    @frameofessence  6 років тому +153

    CORRECTIONS:
    8:01 The Pauli-X gate does NOT flip the direction of the qubit. It rotates it 180 degrees about the x-axis, where the x-axis is pointing out of the screen.
    9:41 This graph is wrong. The Shor curve should be below the Classical curve since it takes LESS time.

    • @DPOBYWAJLO
      @DPOBYWAJLO 6 років тому

      V can come by. V c very v can come vv. V. V c. Vv. V v. Vvvv. V.v. Vv v. Vv vv vv. V vvvvvvvv. V c can vvvv. Vv vv v v v v vv v v v.

    • @avi8365
      @avi8365 5 років тому +4

      Did you quit UA-cam?? I just find your channel today and is really good!!!

    • @gamecoolguy619
      @gamecoolguy619 4 роки тому +1

      Thank you for saying orientation and not both heads and tails as most say including physics 😄

    • @sohammukherjee2754
      @sohammukherjee2754 4 роки тому +1

      @Frame of Essence , what is the best way/place/website to learn more about Quantum gates and the workings of combinations of Quantum gates?

    • @du42bz
      @du42bz 2 роки тому

      @@DPOBYWAJLO What

  • @madgick3
    @madgick3 9 років тому +165

    I came here to learn about Quantum computing, but its actually the overview of classic computing that interested me the most here. This is a fantastic visualisation of how 1's and 0's become complex computations

    • @sandpaperunderthetable6708
      @sandpaperunderthetable6708 2 роки тому

      Ay madjick, like undertale?

    • @haidaralhassan4621
      @haidaralhassan4621 Рік тому +3

      This was literally me when I started studying physics. I came here to learn General Relativity and Quantum Field Theory but got SUPER fascinated by classical mechanics 😭😭

  • @skroot7975
    @skroot7975 8 років тому +94

    Best explanation of how classical computers process data I've seen.

    • @fu_games
      @fu_games 7 років тому +1

      It's good but, in my opinion Richard Feynman's Computer Heuristics lecture was the best and most basic one.

    • @masternobody1896
      @masternobody1896 2 роки тому

      yes

  • @matt-stam
    @matt-stam 6 років тому +22

    It's amazing how, even though right now this channel only has 29k subscribers, this is 100% going to be one of the top tier educational channels on youtube just based off the quality of their content. If this channel doesn't have 200k+ subscribers in a year I would be shocked.

  • @nawarelsabaa
    @nawarelsabaa 6 років тому +8

    As someone who studied classic computing extensively, I must say your explanation rocks! You need more subscribers.

  • @sansyboy4181
    @sansyboy4181 8 років тому +203

    Look at the video URL the end says qark :o

    • @ARBB1
      @ARBB1 8 років тому +6

      +Darren Evans Lol.

    • @Rina25tir
      @Rina25tir 6 років тому +9

      In Albanian language "qark" means "circuit". :O :P

    • @ponponpatapon9670
      @ponponpatapon9670 5 років тому +3

      @Dawson Ditzler SAO fucking sucks

    • @alexander-jl6cs
      @alexander-jl6cs 3 роки тому

      Mobile users be like:what's that

  • @jakobygames
    @jakobygames 7 років тому +8

    I love knowing that in my lifetime these sciences in practice will become much more practical and likely commonplace.

  • @adampartridge1903
    @adampartridge1903 7 років тому +1

    This video explains quantum computing in a better detailed, not annoyingly vague, and generally better way than I've ever seen at all, while simultaneously not completely destroying my mind! The internet needs more education like this, thank you

  • @gpt-jcommentbot4759
    @gpt-jcommentbot4759 4 роки тому +4

    respects to the man who had to understand and memorize just for me not to be confused

  • @Mermaider
    @Mermaider 8 років тому +11

    +Frame of Essence
    Wow! What a channel you have here.
    I'm really glad I found you.
    You'll definitely hit 100k+ subscribers soon as your illustrations and explanations are fantastic.
    Thank you so much.
    Big fan!

    • @CadetGriffin
      @CadetGriffin 8 років тому +1

      It's like a tutorial on how to make calculators in LittleBigPlanet.

    • @ahmedzarin2247
      @ahmedzarin2247 3 роки тому

      i LOVE THIS CHANNEL
      sry 4 scremin :)

    • @Mermaider
      @Mermaider 3 роки тому

      @@ahmedzarin2247
      Scream as loud as u want habibi Ahmed.
      Wow my comment was posted 5 years ago!

  • @mikikiki
    @mikikiki 8 років тому +1

    How do you not have 3 million subs, dude! This video answered so many questions I had! Thank you! Subbing and passing on this link!

  • @charlesleninja
    @charlesleninja 8 років тому +38

    8:31 It can be complex...I see what you did there

  • @Arheisel
    @Arheisel 6 років тому +19

    In the graph at 9:45 the blue curve has negative time values, meaning that with a seemingly small number you can travel backwards in time!
    I need to get one of those quantum computers to go back in time and prevent Hitl... to prevent spilling ice-cream on my pants in front of my 3rd grade crush

  • @RichHandsome
    @RichHandsome 8 років тому

    Best most to the point explanations on computation ever !

  • @TheEshanDas
    @TheEshanDas 8 років тому

    on of the best science channels! keep up the good work. We need more educators like you :)

  • @vikrantmahajan142
    @vikrantmahajan142 Рік тому

    Great video, old is actually gold

  • @sheepperson8739
    @sheepperson8739 8 років тому +3

    your quantum computing videos are great! thank you so much... appreciate the corrections, too. takes someone real Sincere to do that

  • @NPCSpotter
    @NPCSpotter 8 років тому

    This was so informational and was explained clearly and concisely. Thanks and good job.

  • @herpsenderpsen
    @herpsenderpsen 8 років тому +2

    i love being alive in a time like this.

  • @yoavtamir7707
    @yoavtamir7707 8 років тому

    I have never seen such an amaizing explanation. subscribed!

  • @narlycat
    @narlycat 6 років тому

    i love the music at the end it was used on an Enerplex commercial and it grows on you.

  • @astronot1997
    @astronot1997 8 років тому +2

    Thank you a lot, finally I have found a video that actually says more than classic quantum sentences

  • @aleksandr_berdnikov
    @aleksandr_berdnikov 8 років тому +10

    As I understand, Pauli X-gate neither flips top-to-bottom, nor back-to-front, it rather rotates around x-axis at 2Pi (hence the name). Because if
    X(|1>)=|0> and X(|0>)=|1>
    then
    X(|1> + i|0>) = |0> + i|1> ~ |1> - i|0>

    • @frameofessence
      @frameofessence  8 років тому +2

      +Aleksandr Berdnikov Aw, you're right. I'll add this fix and the other one to the video.

    • @jmanzx5508
      @jmanzx5508 8 років тому +4

      +Aleksandr Berdnikov I have no idea what you wrote, but it looks cool.

    • @nawkwan
      @nawkwan 8 років тому +1

      One other question on the control gate @ 8:15. Why is the state (orientation) of the 2nd qubit (yellow) altered from (Longitude: ~225 degrees, Latitude: ~30 degrees) to something that looks rotated? I thought the state only changes upon measurement.

    • @frameofessence
      @frameofessence  8 років тому

      +nawkwan Gate U is meant to be an arbitrary quantum gate, and gates change the orientation of qubits. Measurement specifically collapses the state to 1 or 0, rather than rotating it in some arbitrary way like other gates.

  • @erickmusembi6319
    @erickmusembi6319 7 років тому

    This is definetly the best video I've ever seen on UA-cam, I'd thumbs up 500 times if I could lol
    Great vid man keep it going

  • @nullifier_
    @nullifier_ 8 років тому

    This is amazing. You should have a million views already

  • @scalpol
    @scalpol 7 років тому

    Really good introductory video, thank you!

  • @jacobvandijk6525
    @jacobvandijk6525 4 роки тому

    Great BIG PICTURE-video!!! From here I can go on. Thanks a lot!

  • @shivamchourey7792
    @shivamchourey7792 6 років тому

    one of the best video on this topic. Great job. 👍

  • @sabrango
    @sabrango 4 роки тому

    well done , keep making such tutorials

  • @Ycleptyk
    @Ycleptyk 10 років тому +6

    Very insightful!

  • @g_aya_thri5595
    @g_aya_thri5595 4 роки тому

    BEST EXPLANATION..THNKU SOOO MUCH

  • @tyfyh622
    @tyfyh622 3 роки тому

    well finally i found a video that's helpful (and interesting) thank you!

  • @orestissabethai830
    @orestissabethai830 8 років тому

    This channel is too awesome !!!

  • @ramsinitus
    @ramsinitus 8 років тому

    amazing video! keep up the good work

  • @sniffersmc2827
    @sniffersmc2827 4 роки тому

    i already knew all of this stuff, but your analogies are fucking amazing, i can't stop watching

  • @MIO9_sh
    @MIO9_sh 7 років тому +13

    1:45 That bitcoin attracts my attention....

  • @redshift2026
    @redshift2026 7 років тому

    Great explanation. Thanks.

  • @sauravsamanta6909
    @sauravsamanta6909 6 років тому

    Its really helpful to understand the basic...

  • @lordpeng4778
    @lordpeng4778 Рік тому

    Excelente trabajo, es un buen video introductorio muy explicito sobre la computacion cuantica, claro conviene estudiar mecanica cuantica y practicarla mucho para entenderla completamente.

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

    Very useful, thank you

  • @alijayameilio
    @alijayameilio 8 років тому +2

    keep making videos! this is good :D

  • @hilalalhakani9139
    @hilalalhakani9139 5 років тому

    great explanation

  • @TheGeorgevt
    @TheGeorgevt 7 років тому +10

    1:48 Literal BIT coin....

  • @TheNikhilmishras
    @TheNikhilmishras 8 років тому +1

    Awesome Video !! :D
    More vids on quantum computers ..plz :D

  • @MaxPicAxe
    @MaxPicAxe 5 років тому

    Amazing video!

  • @Xaminn
    @Xaminn 5 років тому

    Thanks for the great video!

  • @anilmajumdar6493
    @anilmajumdar6493 5 років тому

    I liked it a lot bro but can you make another video about the recent breakthroughs in quantum computing and the problems it can solve

  • @michaelloceff2873
    @michaelloceff2873 8 років тому +4

    technically, a measurement isn't a quantum gate, because quantum gates are unitary (and therefore reversible) operators, but besides that, i loved the video.

    • @tommarquet8271
      @tommarquet8271 5 років тому

      What if you used a memory wiper and removed the measurment from existance ...?

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

    Great Video!!

  • @MultiSciGeek
    @MultiSciGeek 7 років тому

    Really well explained and still confusing at the same time.

  • @icebluscorpion
    @icebluscorpion 3 роки тому

    Explain in detail Neuromorphic Chips next, please!!

  • @luizdemilon
    @luizdemilon 8 років тому +156

    BIT coin.
    HA, I get it.

    • @same69410
      @same69410 5 років тому +6

      @Orion D. Hunter quoin

    • @Nasho0101
      @Nasho0101 4 роки тому

      Thanks, now i get it too

  • @saskiavanhoutert3190
    @saskiavanhoutert3190 3 роки тому

    I like the expression WYSWYG or so tot say What You See Is What You Get, pictures without manipulation, but sometimes manipulation can make pictures more beautiful, kind regards, and thanks for this explanation again.

  • @jeehooahn9114
    @jeehooahn9114 8 років тому

    This is going to be a great channel. I know it.

  • @theman83744
    @theman83744 8 років тому

    really cool stuff

  • @hunterboerner
    @hunterboerner 8 років тому +1

    Are you doing all of those electrical circuit animations by hand? Damn...

  • @HammadBinSajid
    @HammadBinSajid 7 років тому

    Good , very informative.....! :)

  • @matansegal9936
    @matansegal9936 8 років тому

    a great video, i am happy to stumble upon this channel
    :a thing i think is worth a mentioning
    all of the boolen logic gates described in the video(2:20) can be composed soley by NAND gates or NOR gates alone (those and any other logic gate)
    this is due to the fact that AND,NOT,OR can represent any gate and you can represend all of those by NAND/NOR alone
    btw correct me if i wrong but RSA(/factorization problem) is yet to be proved to have no classical algorithem to solve it isnt it?

  • @SoberBro
    @SoberBro 8 років тому +9

    Correct me if I'm wrong, but despite that the outcome of a particle with measured spin is technically not random, from anybody's frame of reference is could be called random because we have no way of knowing what the spin was before measuring it and therefore changing its value. So it seems like the output of a qubit wouldn't matter because from any interaction, we couldn't influence another particle to act differently.
    Also wouldn't the sending of light through a fiber-optic cable be changing its polarization any time it reflects? By my understanding, any interaction with a particle in superposition would change its value.

    • @frameofessence
      @frameofessence  8 років тому +8

      +SoberBro Kind of. The outcome could be random, but you can manipulate the qubits to only collapse to certain values before measuring them. For example, Deutsch's algorithm is constructed so that the output qubits are not in superpositions anymore right before they're measured.
      Good point about the fiber optic cables. I just checked, and it turns out there are some types of cables which conserve polarization. Good news for quantum communication!

    • @andramoie
      @andramoie 8 років тому +1

      +Ieatutube " intercept quantum encryption signals without disturbing the
      "intercept detection" qbits by measuring the particles
      around them as opposed to the information itself"
      This is only the case, if you have a faulty implementation, that sends more than one qbit at a time. This can be provoked by so called detector blinding and used for hacking. But you can secure against it. If you implement it correctly you can't hack quantum crypto.
      +Frame of Essence "Good point about the fiber optic cables. I just checked, and it turns
      out there are some types of cables which conserve polarization. Good
      news for quantum communication!"
      They exist, but we usually don't use them in most applications: The fibre changes the polarisation unitarily; that means you can compensate for it easily by applying the inverse transformation on the light after that. The technique I mainly use, is putting stress on the fibre in such a way that |H> -> |H> and |V> -> |V> and then I can correct for the relative phase between those two polarisations with a birefringent crystal.
      And also you need loads and loads of tape, so that the fibre doesn't move after the compensation. ;)

    • @saltyman7888
      @saltyman7888 7 років тому

      love your profile picture. enjoying western man nakabashis video lecture?

    • @aidancollins1591
      @aidancollins1591 4 роки тому

      @Justa Fool Damn, I'd love to try whatever shrooms you're consuming.

  • @psuedonym3143
    @psuedonym3143 6 років тому +2

    I think it might have been easier to explain if you focused on the basic And Or Not gates before you got to Xor and Nand as X or is a not an and and an or and a nand is essentially an and plus a not.

  • @mina86
    @mina86 7 років тому

    It’s worth noting that the reason NAND and NOR gates are interesting is that you can do *any* computation using NAND or only NOR gates.

  • @brocanova
    @brocanova 2 роки тому

    Honestly, I regard myself as a noob, had dropped out of calculus (and the "everyone laughing at me in class") faster than light, call everything with a keyboard and some sort of screen connected to it "computer" and have been using the trial and error successfully for virtually all tasks in life.
    But now, after seeing that video my coin of assumptions just flipped to the other side.

  • @fernandolozano9898
    @fernandolozano9898 4 роки тому +1

    So if the QBit cant be measured, then how do we extract information?

  • @jjoeyay
    @jjoeyay 7 років тому

    Hmm, the subject of qubits being represented by photons made me wonder, could quantum computer technology potentially work in combination with light-based computers with processors that perform using photons, such as the ones being developed by Optalysys?

  • @ghassensmaoui6060
    @ghassensmaoui6060 8 років тому +23

    I would give 100 thumps up

  • @khoanguyen5321
    @khoanguyen5321 6 років тому

    wonderful

  • @julianschneck7748
    @julianschneck7748 8 років тому +2

    hey that was epic!

  • @phee4174
    @phee4174 4 роки тому +3

    3:37
    if the last three gates are just a combination of one of the first three gates with a NOT gate, why are other combinations of the basic gates not considered gates?

    • @zahoorahmed8334
      @zahoorahmed8334 3 роки тому

      To make any useful logic gates nand and nor combinations are used to make storage gates latch gates sr-flip flop etc for memory or register gates.

  • @e7ebr0w
    @e7ebr0w Рік тому

    how could the banker read said message if measuring changes the state. better yet, how is the sender to ensure the banker gets the right message instead of randomness

  • @ariescobar1346
    @ariescobar1346 5 років тому

    3:32 the drawing from 3:37 appears on screen for only 1 frame? is it an editing mistake?

  • @joshuabattlehammer6058
    @joshuabattlehammer6058 3 роки тому +1

    This best video on yotuube

  • @mahamadousacko823
    @mahamadousacko823 2 роки тому

    with the slider volume (like 5v = 8bit) and motor to move this volume so 10 volumes will store 8bits * 10 (in combination) so to store FFFFFF we put 1st to 9th on 0v and 10th on 5v so to read we calculate voltage of each volume.

  • @AltayHunter
    @AltayHunter 8 років тому +1

    9:42 Did you mix up the colors? It looks like you're showing Shor's algorithm as taking more time than classical algorithms. Also, based on the green line starting at 1 I'm guessing green is exponential and blue is polynomial.

    • @starwarsjk99
      @starwarsjk99 8 років тому

      +Altay Hunter I heard somewhere that for small numbers Shor's number takes more time than classical algorithms. Only for extremely large numbers that Shor's algorithm catches up with classical algorithms. I heard classical algorithms take an exponential amount of time while shor's algorithm takes polynomial amount. Eventually classical methods will take more time than shor's algorithm cause an exponential function will always catch up with a polynomial function eventually.

  • @amhakindu3619
    @amhakindu3619 5 років тому

    very cool video 10q i used to be very confused about the way quantum processing works but you have explained it so briefly wonderful.......it's really hard to find a video like this mostly there are junk........they just keep on saying the bullshit all the time so......thanks

  • @mikeatyouttube
    @mikeatyouttube 6 років тому

    At 12:11 your graph of Shor's vs Classical factoring algorithm shows that Shor's algorithm actually takes longer as the number size increases. Also the time taken with the classical algorithm seems to go negative (assuming the origin is at 0,0). Just a 'typo' for sure. Thanks for the informative video.

  • @MultiSciGeek
    @MultiSciGeek 7 років тому

    How exactly do we measure a spin of an electron?

  • @enigma647
    @enigma647 8 років тому

    subbed

  • @sanjaykapoor2804
    @sanjaykapoor2804 8 років тому

    why does shor's algo take -ve time in between?

  • @braveshine2579
    @braveshine2579 5 років тому

    4:14 does graph like this applies in 32 and 64xbits architecture and even 2-bits pc in old days? Is he trying to mean that here?

    • @frameofessence
      @frameofessence  5 років тому

      The architecture is ambiguous in the adder. The inputs are 3 bits and the output is 4 bits.

  • @AnesuMnyulwa
    @AnesuMnyulwa 8 років тому

    how do you measure bits as said at 6:20

  • @ScotsFurian
    @ScotsFurian 8 років тому

    Whats the music at the end ?

  • @srinivasaprasannaa915
    @srinivasaprasannaa915 7 років тому

    So, passing information (say, from A to B) using qubit stops anyone from accessing your information, but does it not allow the eavesdropper (C) to stop B from getting information? What I mean is that C need not get access to your info, but if he/she wants to, they can always stop you from getting it too. Is there a way around it?

    • @frameofessence
      @frameofessence  7 років тому +1

      As far as I understand, the only way around it is to find a different path through the network (assuming there is one).

  • @SupeHero00
    @SupeHero00 7 років тому +1

    Skip to 5:43 If you want to hear about qubits

  • @adamhahn6634
    @adamhahn6634 6 років тому

    Holy shit. He almost managed to get quantum computing to make sense to me XD. Wow.

  • @leerman22
    @leerman22 6 років тому +1

    How will we send quantum photons to our bank? A direct and personal fiber optic cable? I don't think you can relay quantum photons to a backbone internet fiber due to the no-cloning theorem, same problem as any eavesdropper.

    • @frameofessence
      @frameofessence  6 років тому +1

      True, we would need to build some new infrastructure to make it work. There are some types of fiber optic cable that preserve light polarization, so they could theoretically be used to transmit qubits. China is also experimenting with transmission via satellite as well.

  • @nsg650
    @nsg650 5 років тому +1

    1:46 that's a nice pun get it bit-coin

  • @HariS-ou9ht
    @HariS-ou9ht 4 роки тому

    Then 2+3 may be = 5 or 2 or 3 or any thing at the same time :) ,
    how will it work ??

  • @billymorris8079
    @billymorris8079 5 років тому

    One year later.. welcome to the future!

  • @aleksandr_berdnikov
    @aleksandr_berdnikov 8 років тому

    It is also weird that you graph says that Shor's algorithm requires strictly more time then any classical analog...

  • @ephellon
    @ephellon 5 років тому +6

    4 years later... you can purchase a quantum computer for a couple million...

  • @friendofzeus
    @friendofzeus 8 років тому

    So by reading a Qubit you'd actually be running it through a quantum gate. And there are different quantum gates. Does that mean that a quantum gate is determined based on "how" one "reads" the Qubit?

    • @frameofessence
      @frameofessence  8 років тому +1

      I guess it depends what you mean by "read". A measurement forces a collapse to 1 or 0. Quantum gates (except for the measurement gate) manipulate qubits without actually measuring them.

  • @anuel3780
    @anuel3780 7 років тому +1

    So a bit is like a computer interger
    and a qubit is a float value.
    And the number is limited to 0 to 1.
    Intergers can only be 0 and 1 and floats can be anything in between.
    And collapsing superposition is like rounding a float to a interger.
    How's that for an analogy?

    • @AndrejOdessit
      @AndrejOdessit 7 років тому

      Guynimator the Terrible - You mean BIT can only be 0 or 1. Integer int16 can be inbetween -32768 en 32768.

    • @anuel3780
      @anuel3780 7 років тому +1

      "And the number is limited to 0 to 1"
      I limited it to be between those numbers.

    • @frameofessence
      @frameofessence  7 років тому +1

      If you're dealing with single qubits, then that works. But the number of floats you need increases exponentially with respect to the number of qubits. You would need 3 floats to simulate 2 qubits, 7 floats to simulate 3 qubits,... 2^n - 1 floats for n qubits in general.

    • @anuel3780
      @anuel3780 7 років тому +1

      Okay got it.

  • @haotiangan2747
    @haotiangan2747 5 років тому

    YESS! THE FUTURE IS HERE

  • @vishalmishra4408
    @vishalmishra4408 5 років тому

    A qu-bit is complex bit. If it's phase angle is 0, that's a p-bit (probabilistic bit). If its probability of being 1 is either 0% or 100% (e.g. due to measurement) then this p-bit is really a classical bit. So, its best to understand what is a (classical) bit, then expand your understanding to p-bit (learn about probability) and then q-bit (learn about complex numbers).

  • @thinotmandresy
    @thinotmandresy 2 роки тому

    I know this is an extremely naive question and I'm pretty sure that scientists already came up with something but... what if the eavesdropper keeps listening, like, forever? Wouldn't that completely block the communication?

  • @issamhabash8131
    @issamhabash8131 7 років тому

    Hey man, Holy shit I love you.

  • @nautylo
    @nautylo 2 роки тому

    your explanations are very funny

  • @bennubyrd
    @bennubyrd 7 років тому

    excellent video. what is decoherence??? :(

  • @MrBadboy9111
    @MrBadboy9111 8 років тому

    I love your show because of the weirdest reason....because you're funny and because I get amazed for not understanding shit 😎 keep up the great work..( btw I'm kidding about not understanding...I understand few😜)

  • @anselmschueler
    @anselmschueler 6 років тому

    How about an enor gate?