Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science

Google takes key step toward an error-free quantum computer

Adrian Cho

Published Dec 12, 2024• 1 citation
Publisher

Abstract

Quantum bits' delicate states preserved by expanding them.
DOI
10.1126/science.adv2421

Related papers

Quantum computers take step toward reliability

Adrian Y. Cho

Google's error-correction scheme works better as it gets bigger.

Science•Feb 24, 2023•1 citation

Google Takes a Big Step toward Quantum Computing

Chris Palmer

Engineering•Feb 19, 2020•4 citations

Creation of a persistent quantum bit using error correction

Isaac L. Chuang, Y. Yamamoto

The construction of large, coherent quantum systems necessary for quantum computation remains an entreating but elusive goal, due to the ubiquitous nature of decoherence. Recent progress in quantum error correction schemes have given new hope to this field, but thus far, the codes presented in the literature assume a restricted number of errors and error free encoding, decoding, and measurement. We investigate a specific scenario without these assumptions; in particular, we evaluate a scheme to preserve a single quantum bit against phase damping using a three-qubit encoding based on Shor, and study the effect of decoherence not only during storage but also during processing. We derive an general upper limit on the allowable decoherence per time step. Physically, our results suggest the feasibility of engineering artificial metastable states through repeated error correction.

Physical Review A•Jan 1, 1997•56 citations

Local Hamiltonians with Approximation-Robust Entanglement

Lior Eldar

Quantum entanglement is considered, by and large, to be a very delicate and non-robust phenomenon that is very hard to maintain in the presence of noise, or non-zero temperatures. In recent years however, and motivated, in part, by a quest for a quantum analog of the PCP theorem researches have tried to establish whether or not we can preserve quantum entanglement at "constant" temperatures that are independent of system size. This would imply that any quantum state with energy at most, say 0.05 of the total available energy of the Hamiltonian, would be highly-entangled. To this date, no such systems were found, and moreover, it became evident that even embedding local Hamiltonians on robust, albeit "non-physical" topologies, namely expanders, does not guarantee entanglement robustness. In this study, we indicate that such robustness may be possible after all: We construct an infinite family of O(1)-local Hamiltonians, corresponding to check terms of a quantum error-correcting code with the following property of inapproximability: any quantum state with energy at most 0.05 w.r.t. the total available energy cannot be even approximately simulated by classical circuits of bounded (sub-logarithmic) depth. In a sense, this implies that even providing a "witness" to the fact that the local Hamiltonian can be "almost" satisfied, already requires some measure of long-range entanglement. Our construction is but a first step in what, we believe, is a whole range of possible entanglement - robust local Hamiltonians. A natural next step, we believe, is to devise such local Hamiltonians that resist approximation in terms of bounded-depth quantum circuits (e.g. NLTS), and even find such robust forms of entanglement that are useful for some computation.

arXiv:1503.02269•Mar 8, 2015•4 citations

Google makes advance in universal quantum computing

Physics Today•Jun 9, 2016•0 citations

Google may be leading the way in quantum computing

Physics Today•Sep 1, 2016•0 citations
The construction of large, coherent quantum systems necessary for quantum computation remains an entreating but elusive goal, due to the ubiquitous nature of decoherence. Recent progress in quantum error correction schemes have given new hope to this field, but thus far, the codes presented in the literature assume a restricted number of errors and error free encoding, decoding, and measurement. We investigate a specific scenario without these assumptions; in particular, we evaluate a scheme to preserve a single quantum bit against phase damping using a three-qubit encoding based on Shor, and study the effect of decoherence not only during storage but also during processing. We derive an general upper limit on the allowable decoherence per time step. Physically, our results suggest the feasibility of engineering artificial metastable states through repeated error correction.
Quantum entanglement is considered, by and large, to be a very delicate and non-robust phenomenon that is very hard to maintain in the presence of noise, or non-zero temperatures. In recent years however, and motivated, in part, by a quest for a quantum analog of the PCP theorem researches have tried to establish whether or not we can preserve quantum entanglement at "constant" temperatures that are independent of system size. This would imply that any quantum state with energy at most, say 0.05 of the total available energy of the Hamiltonian, would be highly-entangled. To this date, no such systems were found, and moreover, it became evident that even embedding local Hamiltonians on robust, albeit "non-physical" topologies, namely expanders, does not guarantee entanglement robustness. In this study, we indicate that such robustness may be possible after all: We construct an infinite family of O(1)-local Hamiltonians, corresponding to check terms of a quantum error-correcting code with the following property of inapproximability: any quantum state with energy at most 0.05 w.r.t. the total available energy cannot be even approximately simulated by classical circuits of bounded (sub-logarithmic) depth. In a sense, this implies that even providing a "witness" to the fact that the local Hamiltonian can be "almost" satisfied, already requires some measure of long-range entanglement. Our construction is but a first step in what, we believe, is a whole range of possible entanglement - robust local Hamiltonians. A natural next step, we believe, is to devise such local Hamiltonians that resist approximation in terms of bounded-depth quantum circuits (e.g. NLTS), and even find such robust forms of entanglement that are useful for some computation.