Programmable Quantum Gate Arrays

DOI10.1103/PhysRevLett.79.321zbMath0944.81009arXivquant-ph/9703032WikidataQ56502687 ScholiaQ56502687MaRDI QIDQ4492450

Publication date: 16 July 2000

Published in: Physical Review Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/9703032

zbMATH Keywords

quantum gate arrays

Mathematics Subject Classification ID

81P68: Quantum computation

Related Items

Converse bounds for quantum and private communication over Holevo–Werner channels, REALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORS, Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels, Quantum remote control: Teleportation of unitary operations, Controlled remote implementation of operators via hyperentanglement, Entanglement reactivation in separable environments, Blind quantum computation with hybrid model, Efficient Universal Quantum Circuits, A SINGLE-ION STOCHASTIC QUANTUM PROCESSOR, Quantum strategies of quantum measurements, Remarks on universal quantum computer, Optimal quantum networks and one-shot entropies, Square-root measurements and degradation of the resource state in port-based teleportation scheme, Programming of channels in generalized probabilistic theories, A prototype of quantum von Neumann architecture, On the role of \textit{a priori} knowledge in the optimization of quantum information processing, Notes on deterministic programming of quantum observables and channels, Optimal processing of reversible quantum channels, Quantum no-stretching: a geometrical interpretation of the no-cloning theorem, Quantum learning algorithms for quantum measurements, No purification ontology, no quantum paradoxes, Milestone developments in quantum information and no-go theorems, Programmable quantum processors, Unsolvability of the halting problem in quantum dynamics, Cellular quantum computer architecture, The Landauer resistance and band spectra for the counting quantum Turing machine., 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, Playing distributed two-party quantum games on quantum networks, Uniformity of quantum circuit families for error-free algorithms, Architecture of a deterministic quantum central processing unit, Quantum computation by measurement and quantum memory, General strategies for discrimination of quantum states, Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer, Optimality of the pretty good measurement for port-based teleportation, Geometry of Banach spaces: a new route towards position based cryptography, Erratum to: Quantum tasks in holography, Amortized channel divergence for asymptotic quantum channel discrimination, Asymptotic performance of port-based teleportation, Quantum computation with programmable connections between gates, Limitations on post-processing assisted quantum programming, Conditional channel simulation, Probabilistic implementation of Hadamard and unitary gates, Self replication and signalling, Gaussian Transformations and Distillation of Entangled Gaussian States, Can a Quantum Computer Run the von Neumann Architecture?, Neural networks with quantum architecture and quantum learning, ENCRYPTION-BASED NETWORKING QUANTUM TELEPORTATION WITH TRIPLET GREENBERGER–HORNE–ZEILINGER STATES, Quantum circuits cannot control unknown operations, THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY, Quantum reference frames and the classification of rotationally invariant maps, CONTROLLED AND REMOTE IMPLEMENTATION OF A SPLIT QUANTUM ROTATION AND SENDER-ENCODED SECRET SHARING, NMR Quantum Computing

Cites Work