Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Lackey, Brad"'
Autor:
Kukliansky, Alon, Lackey, Brad
We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We introduce
Externí odkaz:
http://arxiv.org/abs/2405.19643
Autor:
Grans-Samuelsson, Linnea, Mishmash, Ryan V., Aasen, David, Knapp, Christina, Bauer, Bela, Lackey, Brad, da Silva, Marcus P., Bonderson, Parsa
Publikováno v:
Quantum 8, 1429 (2024)
We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements and three auxiliary qubits per plaquette. This realization gains substantial advantages over p
Externí odkaz:
http://arxiv.org/abs/2310.12981
We provide the first tensor network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor network construction of its encoding map, our method is far more efficient, and in some case
Externí odkaz:
http://arxiv.org/abs/2308.05152
Autor:
Cao, ChunJun, Lackey, Brad
We examine the use of weight enumerators for analyzing tensor network constructions, and specifically the quantum lego framework recently introduced. We extend the notion of quantum weight enumerators to so-called tensor enumerators, and prove that t
Externí odkaz:
http://arxiv.org/abs/2211.02756
Autor:
Rodrigues, Nishant, Lackey, Brad
We derive a device-independent quantum key distribution protocol based on synchronous correlations and their Bell inequalities. This protocol offers several advantages over other device-independent schemes including symmetry between the two users and
Externí odkaz:
http://arxiv.org/abs/2110.14530
Autor:
Rodrigues, Nishant, Lackey, Brad
Lattices are very important objects in the effort to construct cryptographic primitives that are secure against quantum attacks. A central problem in the study of lattices is that of finding the shortest non-zero vector in the lattice. Asymptotically
Externí odkaz:
http://arxiv.org/abs/2110.13352
Autor:
Cao, ChunJun, Lackey, Brad
Publikováno v:
PRX Quantum 3, 020332 (2022)
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor
Externí odkaz:
http://arxiv.org/abs/2109.08158
Publikováno v:
EPTCS 340, 2021, pp. 279-290
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that we can us
Externí odkaz:
http://arxiv.org/abs/2109.02197
We show that Gottesman's semantics (GROUP22, 1998) for Clifford circuits based on the Heisenberg representation can be treated as a type system that can efficiently characterize a common subset of quantum programs. Our applications include (i) certif
Externí odkaz:
http://arxiv.org/abs/2101.08939
Autor:
Cao, ChunJun, Lackey, Brad
We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fi
Externí odkaz:
http://arxiv.org/abs/2010.05960