Programmable Quantum Gate Arrays
From MaRDI portal
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.
Recommendations
Cites work
- A universal two-bit gate for quantum computation
- Quantum computation
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Cited in
(65)- General quantum computation on acoustic wave resonators assisted by a nitrogen-vacancy-center ensemble
- Quantum circuits cannot control unknown operations
- Quantum strategies of quantum measurements
- General strategies for discrimination of quantum states
- REALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORS
- Optimal processing of reversible quantum channels
- No purification ontology, no quantum paradoxes
- Milestone developments in quantum information and no-go theorems
- Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
- Quantum learning algorithms for quantum measurements
- Universal quantum circuit for n-qubit quantum gate: a programmable quantum gate
- NMR quantum computing
- A facile two-step method to implement \(N\sqrt {i\text{SWAP}}\) and \(N\sqrt {\text{SWAP}}\) gates in a circuit QED
- Holographic software for quantum networks
- Programmable quantum processors
- scientific article; zbMATH DE number 5498842 (Why is no real title available?)
- Programming of channels in generalized probabilistic theories
- A prototype of quantum von Neumann architecture
- Programmable quantum gate arrays
- Remarks on universal quantum computer
- Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
- Probabilistic programmable quantum processors
- On the role of \textit{a priori} knowledge in the optimization of quantum information processing
- Neural networks with quantum architecture and quantum learning
- Can a quantum computer run the von Neumann architecture?
- Constraints on physical computers in holographic spacetimes
- Quantum computation by measurement and quantum memory
- Quantum remote control: teleportation of unitary operations
- Quantum reference frames and the classification of rotationally invariant maps
- Unsolvability of the halting problem in quantum dynamics
- Amortized channel divergence for asymptotic quantum channel discrimination
- Converse bounds for quantum and private communication over Holevo-Werner channels
- Multiparty-controlled remote control without multipartite entanglement
- Gaussian transformations and distillation of entangled Gaussian states
- Quantum computation with programmable connections between gates
- Units of rotational information
- A SINGLE-ION STOCHASTIC QUANTUM PROCESSOR
- Uniformity of quantum circuit families for error-free algorithms
- Efficient Universal Quantum Circuits
- Cellular quantum computer architecture
- Geometry of Banach spaces: a new route towards position based cryptography
- Linear programming with unitary-equivariant constraints
- Blind quantum computation with hybrid model
- Programmable Hamiltonian for one-way patterns
- Square-root measurements and degradation of the resource state in port-based teleportation scheme
- Controlled and remote implementation of a split quantum rotation and sender-encoded secret sharing
- Entanglement reactivation in separable environments
- Architecture of a deterministic quantum central processing unit
- Notes on deterministic programming of quantum observables and channels
- Self replication and signalling
- Realization of arbitrary unitary operations using discrete-time quantum walks
- On the distinguishability of geometrically uniform quantum states
- \(n\)-qubit operations on sphere and queueing scaling limits for programmable quantum computer
- Playing distributed two-party quantum games on quantum networks
- Quantum no-stretching: a geometrical interpretation of the no-cloning theorem
- The Landauer resistance and band spectra for the counting quantum Turing machine.
- Optimality of the pretty good measurement for port-based teleportation
- Conditional channel simulation
- THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
- Limitations on post-processing assisted quantum programming
- Asymptotic performance of port-based teleportation
- Controlled remote implementation of operators via hyperentanglement
- Probabilistic implementation of Hadamard and unitary gates
- Encryption-based networking quantum teleportation with triplet Greenberger-Horne-Zeilinger states
- Optimal quantum networks and one-shot entropies
This page was built for publication: Programmable Quantum Gate Arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4492450)
