Programmable quantum gate arrays
read the original abstract
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array which can be programmed to perform any unitary operation - exists only if one allows the gate array to operate in a probabilistic fashion. The universal quantum gate array we construct requires an exponentially smaller number of gates than a classical universal gate array.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an appli...
-
A resource theory of asynchronous quantum information processing
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the st...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.