Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Craig Gidney"'
Autor:
Craig Gidney
Publikováno v:
Quantum, Vol 8, p 1310 (2024)
In this paper, I cut the cost of Y basis measurement and initialization in the surface code by nearly an order of magnitude. Fusing twist defects diagonally across the surface code patch reaches the Y basis in $\lfloor d/2 \rfloor + 2$ rounds, withou
Externí odkaz:
https://doaj.org/article/223b8d6af622447aa165cfd195d690c5
Publikováno v:
Quantum, Vol 7, p 1172 (2023)
The typical time-independent view of quantum error correction (QEC) codes hides significant freedom in the decomposition into circuits that are executable on hardware. Using the concept of detecting regions, we design time-dynamic QEC circuits direct
Externí odkaz:
https://doaj.org/article/1f2a759efe244113885f81c92facc008
Autor:
Craig Gidney
Publikováno v:
Quantum, Vol 7, p 1156 (2023)
In this paper, I present a way to compile the surface code into two-body parity measurements ("pair measurements"), where the pair measurements run along the edges of a Cairo pentagonal tiling. The resulting circuit improves on prior work by Chao et
Externí odkaz:
https://doaj.org/article/e889d2baad2347029975f862a7f298d4
Publikováno v:
Quantum, Vol 6, p 813 (2022)
We improve the planar honeycomb code by describing boundaries that need no additional physical connectivity, and by optimizing the shape of the qubit patch. We then benchmark the code using Monte Carlo sampling to estimate logical error rates and der
Externí odkaz:
https://doaj.org/article/201ba09d27b346ef91b50c2790883022
Autor:
Craig Gidney
Publikováno v:
Quantum, Vol 6, p 786 (2022)
Topological quantum computations are built on a foundation of two basic tasks: preserving logical observables through time and moving logical observables through space. Memory experiments, which check how well logical observables are preserved throug
Externí odkaz:
https://doaj.org/article/e30d534ba98845c7933003551ca15856
Publikováno v:
Quantum, Vol 5, p 605 (2021)
Recently, Hastings & Haah introduced a quantum memory defined on the honeycomb lattice. Remarkably, this honeycomb code assembles weight-six parity checks using only two-local measurements. The sparse connectivity and two-local measurements are desir
Externí odkaz:
https://doaj.org/article/e1123062d2ab411c8498d6599816d0f5
Autor:
Craig Gidney
Publikováno v:
Quantum, Vol 5, p 497 (2021)
This paper presents “Stim", a fast simulator for quantum stabilizer circuits. The paper explains how Stim works and compares it to existing tools. With no foreknowledge, Stim can analyze a distance 100 surface code circuit (20 thousand qubits, 8 mi
Externí odkaz:
https://doaj.org/article/11617d6cd39e4f048609d9abb0ee6eae
Autor:
Joonho Lee, Dominic W. Berry, Craig Gidney, William J. Huggins, Jarrod R. McClean, Nathan Wiebe, Ryan Babbush
Publikováno v:
PRX Quantum, Vol 2, Iss 3, p 030305 (2021)
We describe quantum circuits with only O[over ~](N) Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (e.g., molecular) orbitals. With O(λ/ϵ) repetitions of these circuits one can use phase
Externí odkaz:
https://doaj.org/article/8e704eb504af455dbfe0df347b273c2b
Autor:
Craig Gidney, Martin Ekerå
Publikováno v:
Quantum, Vol 5, p 433 (2021)
We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu 1996, Zalka 2006, Fowler 2012, Ekerå-Håstad 2017, Ekerå 2017, Eke
Externí odkaz:
https://doaj.org/article/3dd8d98a98304787bcadf7a9a0825817
Publikováno v:
PRX Quantum, Vol 2, Iss 1, p 010103 (2021)
In this perspective we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algorithm with only a small polynomial speedup over the best classical alter
Externí odkaz:
https://doaj.org/article/809e333e26844f2a8c3894a44a92d706