Quantum Computing with Global One-and Two-Qubit Gates
classification
🪐 quant-ph
keywords
globalquantumtwo-qubitcertaincomposedcomputerscomputingconstructions
read the original abstract
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.