• 0 Posts
  • 4 Comments
Joined 1 year ago
cake
Cake day: June 27th, 2023

help-circle

  • I dont think redundant questions are the problem. But people’s historically short responses on reddit definitely were. Responses like “have you tried googling it” or “the question has already been answered, try searching before you post” do nothing but ostracize the person asking and make communities unwelcoming. I would like to see Lemmy more understanding, as to encourage and attract novice individuals in communities they are interested in



  • The problems which are calculated, such as finding prime factors of an integer, take non-polynomial (NP) time on a classical computer to solve. But NP problems, as opposed to NP-hard, can by definition be confirm in P (polynomial) time on a classical computer. Therefore, we can easily confirm that the answer is correct using classical computers.

    On an aside, I used the example of prime factorization because it is one of the most well known problems that can be accelerated via quantum computing using Shor’s algorithm. Using Shor’s algorithm on a quantum computer, an integer can be factorized in P time. This is opposed to NP time on a classical computer.