Zobrazeno 1 - 10
of 395
pro vyhledávání: '"Beverland, Michael"'
Stabilizer channels are stabilizer circuits that implement logical operations while mapping from an input stabilizer code to an output stabilizer code. They are widely used to implement fault tolerant error correction and logical operations in stabil
Externí odkaz:
http://arxiv.org/abs/2401.12017
For a quantum error correcting code to be used in practice, it needs to be equipped with an efficient decoding algorithm, which identifies corrections given the observed syndrome of errors.Hypergraph product codes are a promising family of constant-r
Externí odkaz:
http://arxiv.org/abs/2311.00877
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical computer, is
Externí odkaz:
http://arxiv.org/abs/2309.08676
Autor:
Beverland, Michael E., Murali, Prakash, Troyer, Matthias, Svore, Krysta M., Hoefler, Torsten, Kliuchnikov, Vadym, Low, Guang Hao, Soeken, Mathias, Sundaram, Aarthi, Vaschillo, Alexander
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require a large-scale quantum machine. Understanding the impact of architectur
Externí odkaz:
http://arxiv.org/abs/2211.07629
Publikováno v:
PRX Quantum 3 (2022) 020342
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit's qubits in surface codes
Externí odkaz:
http://arxiv.org/abs/2110.11493
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, na\"ive layouts couple many distant qubits with crossing connections which could be hard to build
Externí odkaz:
http://arxiv.org/abs/2109.14609
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli operators, and the
Externí odkaz:
http://arxiv.org/abs/2109.14599