Ancilla-Assisted Discrimination of Quantum Gates
arXiv:0809.0336
Abstract
The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a new scheme of discrimination of quantum gates, called ancilla-assisted discrimination, in which a set of quantum gates on a dimensional system are perfectly discriminated with assistance from an dimensional ancilla system. The main contribution of the present paper is two-fold: (1) The number of quantum gates that can be discriminated in this scheme is evaluated. We prove that any quantum gates cannot be perfectly discriminated with assistance from the ancilla, and there exist quantum gates which can be perfectly discriminated with assistance from the ancilla. (2) The dimensionality of the minimal ancilla system is estimated. We prove that there exists a constant positive number such that for any quantum gates, if they are -assisted discriminable, then they are also -assisted discriminable, and there are different quantum gates which can be discriminated with a dimensional ancilla, but they cannot be discriminated if the ancilla is reduced to an dimensional system. Thus, the order of the number of quantum gates that can be discriminated with assistance from an dimensional ancilla is optimal. The results reported in this paper represent a preliminary step toward understanding the role ancilla system plays in discrimination of quantum gates as well as the power and limit of superdense coding.
References in corpus (22)
- Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
- Unknown Quantum States and Operations, a Bayesian View
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Unambiguous Discrimination Between Linearly-Independent Quantum States
- Statistical distinguishability between unitary operations
- Unambiguous discrimination of mixed states
- Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
- Unambiguous discrimination among quantum operations
- Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication
- Unambiguous discrimination between quantum mixed states
- On the dimension of subspaces with bounded Schmidt rank
- Reduction Theorems for Optimal Unambiguous State Discrimination of Density Matrices
- Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States
- Unambiguous Discrimination Between Linearly Dependent States with Multiple Copies
- Quantum state discrimination: a geometric approach
- Local Distinguishability of Multipartite Unitary Operations
- Optimal Conclusive Discrimination of Two Non-orthogonal Pure Product Multipartite States Locally
- Unambiguous discrimination among oracle operators
- Optimal Unambiguous Discrimination of Quantum States
- Discriminating multi-partite entangled states
- Local distinguishability of orthogonal 2\otimes3 pure states
- Unitary transformations can be identified locally