Probabilistic implementation of universal quantum processors

Abstract

We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of the dimension N with a certain probability. If the operation is unitary, the probability is in general 1/N^2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.

7 revtex pages, 1 eps figure

References in corpus (2)

• Experimental quantum teleportation
• Probabilistic Quantum Memories

Cited by in corpus (59)

• Gaussian transformations and distillation of entangled Gaussian states
• A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
• Quantum multimeters: A programmable state discriminator
• Contextual, Optimal and Universal Realization of the Quantum Cloning Machine and of the NOT gate
• Universal measurement apparatus controlled by quantum software
• Optimal probabilistic storage and retrieval of unitary channels
• Contextual Realization of the Universal Quantum Cloning Machine and of the Universal-NOT gate by Quantum Injected Optical Parametric Amplification
• Programmable quantum state discriminators with simple programs
• Overcoming efficiency constraints on blind quantum computation
• A quantum gate array can be programmed to evaluate the expectation value of any operator
• Efficient universal programmable quantum measurements
• Implementation of quantum maps by programmable quantum processors
• Optimal universal programming of unitary gates
• Realization of Universal Optimal Quantum Machines by Projective Operators and Stochastic Maps
• Approximate programmable quantum processors
• Remote Implementation of Quantum Operations
• Unambiguous coherent state identification: Searching a quantum database
• Realization of POVMs using measurement-assisted programmable quantum processors
• Probabilistic quantum multimeters
• Programmable unknown quantum-state discriminators with multiple copies of program and data: A Jordan basis approach
• Resource Quantification for the No-Programming Theorem
• The quantum brachistochrone problem for an arbitrary spin in a magnetic field
• Increasing efficiency of a linear-optical quantum gate using an electronic feed forward
• Multi-output programmable quantum processor
• Experimental realization of programmable quantum gate
• Improving performance of probabilistic programmable quantum processors
• Probabilistic programmable quantum processors with multiple copies of program state
• Programmability of covariant quantum channels
• Optimality of programmable quantum measurements
• Direct versus measurement assisted bipartite entanglement in multi-qubit systems and their dynamical generation in spin systems
• Success probabilities for universal unambiguous discriminators between unknown pure states
• Generalized measurements via programmable quantum processor
• Probabilistic instantaneous quantum computation
• Probabilistic storage and retrieval of qubit phase gates
• Programmable quantum channels and measurements
• Experimental demonstration of teleportation-based programmable quantum gate
• Quantum-enhanced learning of rotations about an unknown direction
• Programmable quantum state discriminator by Nuclear Magnetic Resonance
• Upper Bounds for the Number of Quantum Clones under Decoherence
• Guide to Mathematical Concepts of Quantum Theory
• Quantum Machines
• Programmable Quantum Networks with Pure States
• Storage and retrieval of von Neumann measurements
• Fidelity of dynamical maps
• Optimal programmable unambiguous discriminator between two unknown latitudinal states
• Universal covariant quantum cloning circuits for qubit entanglement manipulation
• Realization of the Optimal Universal Quantum Entangler
• Probabilistic implementation of universal Hadamard and Unitary gates
• Geometry of quantum state manifolds generated by the Lie algebra operators
• Quantum Processors and Controllers
• Application of quantum algorithms to the study of permutations and group automorphisms
• Representation matching for delegated quantum computing
• ALEPH-QP: Universal hybrid quantum processors
• An Architecture of Deterministic Quantum Central Processing Unit
• Quantum Advantage in Storage and Retrieval of Isometry Channels
• On the most efficient unitary transformation for programming quantum channels
• Von Neumann Quantum Processors
• Robustness of optimal probabilistic storage and retrieval of unitary channels to noise
• Scheme for a linear-optical controlled-phase gate with programmable phase shift