Programmable Quantum Gate Arrays

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

Isaac Chuang, Michael A. Nielsen

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

Quantum computation (81P68)

Related Items

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

Cites Work