Deutsch-Jozsa Algorithm: Exponential Speedup on a Quantum Computer!

Поділитися
Вставка
  • Опубліковано 8 сер 2024
  • This video takes a look into the mathematics behind the Deutsch-Jozsa algorithm originally published in 1992 by David Deutsch and Richard Jozsa.
    Timestamps
    The Problem 0:00
    Classical Computers 0:50
    The Algorithm 1:38

КОМЕНТАРІ • 16

  • @holaamigos8401
    @holaamigos8401 Рік тому +1

    Great explanation and amazing visuals! This is so useful! Thanks

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

    The best tutorial in UA-cam! Excellent, thank you

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

    best video on the topic. thank you for an awesome explanation!

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

    Very nice video

  • @pradyumansinghshekhawat7364
    @pradyumansinghshekhawat7364 4 місяці тому

    Thank you

  • @ltrboks
    @ltrboks Рік тому +2

    In classical computers f(x) is a function that accepts a scalar argument and returns a scalar result. What type of argument does function f accept in quantum computers and what type of result does it return? If it returns a vector result, then how can you compute (-1) to the power of f(x) which is not scalar?

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

    Thanks u

  • @anibalismaelfermandois6943
    @anibalismaelfermandois6943 10 місяців тому +1

    This is a nice video, but even though I'm not a noobie in the field it still went over my head. Maybe a bit more definitions on the side?

    • @quantum-soar
      @quantum-soar  9 місяців тому +2

      Thanks for the comment! I will work on adding some more definitions thanks for the advice. Many of the formulas from this video I talk about in the previous video where I go over Deutsch's Algorithm, maybe give that one a watch if some of the concepts seem a bit new as they are detailed in that video. Take care!

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

    Amazing video, I was just wondering what would occur if the function f(x) were neither constant nor balanced. Is this even possible in quantum computing?

    • @quantum-soar
      @quantum-soar  9 місяців тому +3

      Thanks for the Comment. Yes it is possible to have functions that are not constant or balanced. With this algorithm it is used to detect if a function is constant or balanced so it assumes that the function is either of those options, but there are significantly more functions in quantum computing that are not constant or balanced. If the function was not constant or balanced then the algorithm would not work as it intended to as the phase would not cancel or add together, giving a superposition state before measurement. Thanks for the comment, take care!

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

    Quantum computing will never be a thing for the vast majority of people. It is only good for breaking the internet and a handful of highly specific niche computational problems. The number of hackers with a quantum computer will dwarf the number of legitimate users. Let's _not_ build quantum computers.

  • @Quantumphysicst99
    @Quantumphysicst99 4 місяці тому

    Sir email kindly

    • @Quantumphysicst99
      @Quantumphysicst99 4 місяці тому

      I am also quantum computer student I need help kindly shere email

    • @quantum-soar
      @quantum-soar  4 місяці тому

      Thanks for the comment! You can email at soar.quantum@gmail.com