Programmable Quantum Gate Arrays

From MaRDI portal
Publication:4492450

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




Related Items

A facile two-step method to implement \(N\sqrt {i\text{SWAP}}\) and \(N\sqrt {\text{SWAP}}\) gates in a circuit QEDNo purification ontology, no quantum paradoxesMilestone developments in quantum information and no-go theoremsControlled remote implementation of operators via hyperentanglementQuantum computation with programmable connections between gatesHolographic software for quantum networksProgrammable quantum processorsREALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORSGeometry of Banach spaces: a new route towards position based cryptographyEfficient Universal Quantum CircuitsScalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channelsLimitations on post-processing assisted quantum programmingErratum to: Quantum tasks in holographyProgramming of channels in generalized probabilistic theoriesConditional channel simulationUnits of rotational informationAmortized channel divergence for asymptotic quantum channel discriminationProbabilistic implementation of Hadamard and unitary gatesA prototype of quantum von Neumann architecturePlaying distributed two-party quantum games on quantum networksCellular quantum computer architectureTHE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITYOn the role of \textit{a priori} knowledge in the optimization of quantum information processingGeneral strategies for discrimination of quantum statesAsymptotic performance of port-based teleportationQuantum reference frames and the classification of rotationally invariant mapsConverse bounds for quantum and private communication over Holevo–Werner channelsEntanglement reactivation in separable environmentsQuantum no-stretching: a geometrical interpretation of the no-cloning theoremCan a Quantum Computer Run the von Neumann Architecture?Notes on deterministic programming of quantum observables and channelsCONTROLLED AND REMOTE IMPLEMENTATION OF A SPLIT QUANTUM ROTATION AND SENDER-ENCODED SECRET SHARINGBlind quantum computation with hybrid modelQuantum remote control: Teleportation of unitary operationsNeural networks with quantum architecture and quantum learningNMR Quantum ComputingNondestructive discrimination of a new family of highly entangled states in IBM quantum computerSelf replication and signallingQuantum learning algorithms for quantum measurementsOptimal processing of reversible quantum channelsQuantum strategies of quantum measurementsUniformity of quantum circuit families for error-free algorithmsENCRYPTION-BASED NETWORKING QUANTUM TELEPORTATION WITH TRIPLET GREENBERGER–HORNE–ZEILINGER STATESRemarks on universal quantum computerUnsolvability of the halting problem in quantum dynamicsArchitecture of a deterministic quantum central processing unitQuantum circuits cannot control unknown operationsA SINGLE-ION STOCHASTIC QUANTUM PROCESSORGaussian Transformations and Distillation of Entangled Gaussian StatesOptimality of the pretty good measurement for port-based teleportationThe Landauer resistance and band spectra for the counting quantum Turing machine.Optimal quantum networks and one-shot entropiesQuantum computation by measurement and quantum memorySquare-root measurements and degradation of the resource state in port-based teleportation scheme



Cites Work