89 citations · 286 across the 12 of their papers we have counts for
12 papers
Tour de gross: A modular quantum computer based on bivariate bicycle codes
Theodore J. Yoder, Eddie Schoute, Patrick Rall +5
We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate…
Quantum Routing and Entanglement Dynamics Through Bottlenecks
Dhruv Devulapalli, Chao Yin, Andrew Y. Guo +4
To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consi…
Quantum Programmable Reflections
Eddie Schoute, Dmitry Grinko, Yigit Subasi +1
Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed qu…
Toward a 2D Local Implementation of Quantum LDPC Codes
Noah Berthusen, Dhruv Devulapalli, Eddie Schoute +4
Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes which affects code performance and ease of physical realizati…
Minimal entanglement for injecting diagonal gates
Vadym Kliuchnikov, Eddie Schoute
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the…
Advantages and limitations of quantum routing
Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov +1
The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely…
Quantum Routing with Teleportation
Dhruv Devulapalli, Eddie Schoute, Aniruddha Bapat +2
We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classica…
Surface code compilation via edge-disjoint paths
Michael Beverland, Vadym Kliuchnikov, Eddie Schoute
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 lo…
Quantum routing with fast reversals
Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov +3
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qu…
Nearly optimal time-independent reversal of a spin chain
Aniruddha Bapat, Eddie Schoute, Alexey V. Gorshkov +1
We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of spins. Our protocol has an easily implementable nearest-neighbor, transverse…
Circuit Transformations for Quantum Architectures
Andrew M. Childs, Eddie Schoute, Cem M. Unsal
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, a…
Shortcuts to quantum network routing
Eddie Schoute, Laura Mancinska, Tanvirul Islam +2
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby b…