Approximate programmable quantum processors
arXiv:quant-ph/0510161 · doi:10.1103/PhysRevA.73.022345
Abstract
A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor to approximate a set of unitary operators to a specified level of precision. We measure how well an operation is performed by the process fidelity between the desired operation and the operation produced by the processor. We show how to find the program for a given processor that produces the best approximation of a particular unitary operation. We also place bounds on the dimension of the program space that is necessary to approximate a set of unitary operators to a specified level of precision.
8 pages
References in corpus (16)
- Distance measures to compare real and ideal quantum processes
- Universal Quantum Estimator
- Direct estimations of linear and non-linear functionals of a quantum state
- Programmable quantum gate arrays
- Quantum multimeters: A programmable state discriminator
- A fidelity measure for quantum channels
- Probabilistic implementation of universal quantum processors
- Conservative Quantum Computing
- Universal measurement apparatus controlled by quantum software
- 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
- Continuous measurement with traveling wave probes
- Comment on "Some implications of the quantum nature of laser fields for quantum computations"
- Improving performance of probabilistic programmable quantum processors
- Reply to "Comment on "Some implications of the quantum nature of laser fields for quantum computations''''
Cited by in corpus (24)
- Transforming quantum operations: quantum supermaps
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Quantum teleportation scheme by selecting one of multiple output ports
- Limitations to sharing entanglement
- Programmable quantum state discriminators with simple programs
- General polygamy inequality of multi-party quantum entanglement
- Asymptotic performance of port-based teleportation
- Gate fidelity of arbitrary single-qubit gates constrained by conservation laws
- Increasing efficiency of a linear-optical quantum gate using an electronic feed forward
- Conservation-Law-Induced Quantum Limits for Physical Realizations of the Quantum NOT Gate
- Experimental realization of programmable quantum gate
- Programmability of covariant quantum channels
- Convex approximations of quantum channels
- Communication Cost of Quantum Processes
- Experimental demonstration of teleportation-based programmable quantum gate
- Quantum Machines
- Quantum Limits of Measurements Induced by Multiplicative Conservation Laws: Extension of the Wigner-Araki-Yanase Theorem
- Entropy in Quantum Information Theory -- Communication and Cryptography
- Notes on Deterministic Programming of Quantum Observables and Channels
- Fidelity of dynamical maps
- Application of quantum algorithms to the study of permutations and group automorphisms
- Topological obstructions to quantum computation with unitary oracles
- Port-Based State Preparation and Applications
- Quantum Advantage in Storage and Retrieval of Isometry Channels