“1) https://www.nature.com/articles/nature18949 https://arxiv.org/abs/1411.7403 2. http://science.sciencemag.org/content/351/6277/1068 seems like it might satisfy your requirements. It doesn't seem to use the answer in its calculation, but I'm not sure.”
State preservation by repetitive error detection in a superconducting quantum circuit
Quantum computing becomes viable when a quantum state can be preserved from environmentally-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse and quantum error correction (QEC) is capable of identifying and correcting them. Adding more qubits improves the preservation by guaranteeing increasingly larger clusters of errors will not cause logical failure - a key requirement for large-scale systems. Using QEC to extend the qubit lifetime remains one of the outstanding experimental challenges in quantum computing. Here, we report the protection of classical states from environmental bit-flip errors and demonstrate the suppression of these errors with increasing system size. We use a linear array of nine qubits, which is a natural precursor of the two-dimensional surface code QEC scheme, and track errors as they occur by repeatedly performing projective quantum non-demolition (QND) parity measurements. Relative to a single physical qubit, we reduce the failure rate in retrieving an input state by a factor of 2.7 for five qubits and a factor of 8.5 for nine qubits after eight cycles. Additionally, we tomographically verify preservation of the non-classical Greenberger-Horne-Zeilinger (GHZ) state. The successful suppression of environmentally-induced errors strongly motivates further research into the many exciting challenges associated with building a large-scale superconducting quantum computer.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“Using the largest number factored as a benchmark for progress in quantum computing is like evaluating floor(f(0)) = 0 and floor(f(1)) = 0 and concluding f(x) = 0. You can't distinguish f(x) = 0 from f(x) = x/2 from f(x) = e^x/3 when your test is too coarse. If you want to see the progress in quantum computing today, pay attention to component reliability…”
“That paper is hilarious, and is correct that there's plenty of shit to make fun of... but there's also progress. I recommend watching Sam Jacques' talk from PQCrypto 2025 [0]. It would be silly to delay PQC adoption because of focusing on the irrelevant bad papers. In the past ten years, on the theory side, the expected cost of cryptographically relevant…”