Bandingkan metode
Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.
| Koreksi Kesalahan Kuantum Kode Permukaan× | Algoritma Grover× | |
|---|---|---|
| Bidang | Komputasi Kuantum | Komputasi Kuantum |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 2003 | 1996 |
| Pencetus≠ | Alexei Kitaev | Lov Grover |
| Tipe≠ | Error correction code | Quantum algorithm |
| Sumber perintis≠ | Kitaev, A. Y. (2003). Fault-tolerant quantum computation by anyons. Annals of Physics, 303, 2–30. DOI ↗ | Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219. DOI ↗ |
| Alias | surface code, topological error correction | quantum search, amplitude amplification |
| Terkait | 3 | 3 |
| Ringkasan≠ | Surface Code is a two-dimensional topological quantum error-correcting code that protects quantum information through geometric redundancy. Introduced by Alexei Kitaev in 2003, surface code is considered the leading candidate for large-scale fault-tolerant quantum computing due to its high error thresholds and feasibility on two-dimensional qubit arrays. | Grover's Algorithm is a quantum algorithm for searching an unsorted database, offering a quadratic speedup over classical linear search. Proposed by Lov Grover in 1996, it exploits quantum superposition and amplitude amplification to find a target item among N items in O(√N) queries, compared to the classical O(N) requirement. |
| ScholarGateSet data ↗ |
|
|