added 185 characters in body
Source Link

From: https://www.ncbi.nlm.nih.gov/books/NBK538708/pdf/Bookshelf_NBK538708.pdf it references, "There are three properties of quantum mechanics that are different from standard computation and that are required for quantum speedups: superposition, interference, and entanglement." Hoping to get confirmation that these are the key properties or items that quantum computers offer over classic computer systems.

From: https://www.ncbi.nlm.nih.gov/books/NBK538708/pdf/Bookshelf_NBK538708.pdf it references, "There are three properties of quantum mechanics that are different from standard computation and that are required for quantum speedups: superposition, interference, and entanglement." Hoping to get confirmation that these are the key properties or items that quantum computers offer over classic computer systems.

added 779 characters in body
Source Link

I'm trying to understand the type of problems that Quantum Computers are/will be good at solving and if there is a special class to categorizes these types of problems (e. I hope this isg. Do we specify the proper forum to help medifference between Quantum Computer Polynomial time (like Shor's algorithm) versus classical computer polynomial time, or are they both just just considered P?).

If examples of types of problems that can be solved quickly by quantum computers can be shared it would also be greatly appreciated. Hoping to see enough examples that I can see the patterns of type of problems that can be solved or how to take advantage of what quantum computers offer.

I'm trying to understand the type of problems that Quantum Computers are/will be good at solving and if there is a special class to categorizes these types of problems. I hope this is the proper forum to help me.

If examples of types of problems that can be solved quickly by quantum computers can be shared it would also be greatly appreciated.

I'm trying to understand the type of problems that Quantum Computers are/will be good at solving and if there is a special class to categorizes these types of problems (e.g. Do we specify the difference between Quantum Computer Polynomial time (like Shor's algorithm) versus classical computer polynomial time, or are they both just just considered P?).

If examples of types of problems that can be solved quickly by quantum computers can be shared it would also be greatly appreciated. Hoping to see enough examples that I can see the patterns of type of problems that can be solved or how to take advantage of what quantum computers offer.

added 779 characters in body
Source Link
Loading
added 133 characters in body
Source Link
Loading
Source Link
Loading