I believe it's just math -- am I wrong?

npub16xnpfx85k8wzdhctang6860g3u64lds5kac73ddjwlg0lxdg9g3su56z6l
hex
fc42591508f9f83ec17a21162a153508526582409d43cb29fd78532c0fa4cfbfnevent
nevent1qqs0csjez5y0n7p7c9azz932z56ss5n9sfqf6s7t987hs5evp7jvl0cprpmhxue69uhhyetvv9ujuem4d36kwatvw5hx6mm9qgsdrfs5nr6trhpxmu97e5dra85g7d2lkc2twu0gkke8058lnx5z5gcc8au5cKind-1 (TextNote)
↳ 回复 事件不存在
0a4560a4a418a43c09d4cb261ba866b79e256c14e2f780c0d934cd3dc14c7808...
I believe it's just math -- am I wrong?
It's a life dream of mine to learn the basics of quantum computing, maybe enough to understand Shor's algorithm. I've tried and made it through a good amount of linear algebra, bra-ket notation, etc., and then I got distracted. I hope to go back.
The reason I want to study it is that I'd like to grasp conceptually what it is about quantum computers that could lead to such a speed-up in, say, finding the prime factors of a large integer.
Is it that there is a natural process that constitutes a sort of "oracle" suggesting correct answers to problems that are normally difficult to compute?
I'm not too well-informed, but I'm currently under the impression that on the computational side it is just math, i.e. that one doesn't need to experiment to determine the computational complexity of the relevant algorithms.
原始 JSON
{
"kind": 1,
"id": "fc42591508f9f83ec17a21162a153508526582409d43cb29fd78532c0fa4cfbf",
"pubkey": "d1a61498f4b1dc26df0becd1a3e9e88f355fb614b771e8b5b277d0ff99a82a23",
"created_at": 1775902769,
"tags": [
[
"e",
"5cef312ecce58e2f1a5762dd7b00b3798a6062e03c6c674d0f52245d2f5c7c6b",
"wss://relay.44billion.net/",
"root",
"c21b1a6cdb247ccbd938dcb16b15a4fa382d00ffd7b12d5cbbad172a0cd4d170"
],
[
"e",
"0a4560a4a418a43c09d4cb261ba866b79e256c14e2f780c0d934cd3dc14c7808",
"wss://nos.lol/",
"reply",
"c21b1a6cdb247ccbd938dcb16b15a4fa382d00ffd7b12d5cbbad172a0cd4d170"
],
[
"p",
"c21b1a6cdb247ccbd938dcb16b15a4fa382d00ffd7b12d5cbbad172a0cd4d170"
]
],
"content": "I believe it's just math -- am I wrong?\n\nIt's a life dream of mine to learn the basics of quantum computing, maybe enough to understand Shor's algorithm. I've tried and made it through a good amount of linear algebra, bra-ket notation, etc., and then I got distracted. I hope to go back.\n\nThe reason I want to study it is that I'd like to grasp conceptually what it is about quantum computers that could lead to such a speed-up in, say, finding the prime factors of a large integer.\n\nIs it that there is a natural process that constitutes a sort of \"oracle\" suggesting correct answers to problems that are normally difficult to compute?\n\nI'm not too well-informed, but I'm currently under the impression that on the computational side it is just math, i.e. that one doesn't need to experiment to determine the computational complexity of the relevant algorithms.",
"sig": "e3ea454c8cf7f99b95aa111d186e49374c804cd99841ef1f690308e47f33cfd9e4e84da33240a7413167f5db1bfb9e676790cf3e191764914d9a0fb359ecd167"
}