Identification of a reversible quantum gate: assessing the resources
arXiv:1306.0719 · doi:10.1088/1367-2630/15/10/103019
Abstract
We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. In addition, we introduce the notion of generalized t-designs, which includes unitary t-designs and group representations as special cases. For gates forming a generalized t-design we give an explicit expression for the maximum probability of correct gate identification and we prove that there is no gap between the performances of deterministic strategies an those of probabilistic strategies. Hence, evaluating of the query complexity of perfect deterministic discrimination is reduced to the easier problem of evaluating the query complexity of unambiguous discrimination. Finally, we consider discrimination strategies where the use of ancillas is forbidden, providing upper bounds on the number of additional queries needed to make up for the lack of entanglement with the ancillas.
arXiv comment24 + 8 pages, published version
References in corpus (47)
- Quantum Mechanics helps in searching for a needle in a haystack
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Secure Direct Communication with a Quantum One-Time-Pad
- Secure direct communication using entanglement
- Deterministic Secure Direct Communication Using Entanglement
- Symmetric Informationally Complete Quantum Measurements
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Grover's quantum searching algorithm is optimal
- Theoretical framework for quantum networks
- Unknown Quantum States: The Quantum de Finetti Representation
- Secure Deterministic Communication Without Entanglement
- Quantum Circuits Architecture
- Evenly distributed unitaries: on the structure of unitary designs
- Statistical distinguishability between unitary operations
- Using entanglement improves precision of quantum measurements
- Continuous Variable Quantum Cryptography using Two-Way Quantum Communication
- Classical and quantum communication without a shared reference frame
- Memory effects in quantum channel discrimination
- Optimal quantum learning of a unitary transformation
- Experimental Demonstration of Optimal Unambiguous State Discrimination
- Efficient use of quantum resources for the transmission of a reference frame
- The Perfect Distinguishability of Quantum Operations
- Optimizing quantum process tomography with unitary 2-designs
- Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
- A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States
- Optical realization of optimal unambiguous discrimination for pure and mixed quantum states
- Unambiguous discrimination among quantum operations
- Unitary designs and codes
- Optimal estimation of group transformations using entanglement
- Quantum communication using a bounded-size quantum reference frame
- Quantum state filtering and discrimination between sets of Boolean functions
- Optimal cloning of unitary transformations
- Quantum reverse-engineering and reference frame alignment without non-local correlations
- Covariant quantum measurements which maximize the likelihood
- Unambiguous discrimination among oracle operators
- Quantum Operations, State Transformations and Probabilities
- Quantum Oracle Interrogation: Getting all information for almost half the price
- Experimental Quantum Process Discrimination
- Programmable discriminator of coherent states - experimental realization
- How many functions can be distinguished with k quantum queries?
- Retrodiction of Generalised Measurement Outcomes
- Teleportation transfers only speakable quantum information
- Maximum likelihood estimation for a group of physical transformations
- Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm
- Quantum Gloves
- Extended Quantum Color Coding
- Quantum-state filtering applied to the discrimination of Boolean functions
Cited by in corpus (10)
- Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
- Optimal single shot strategies for discrimination of quantum measurements
- Multiple-shot and unambiguous discrimination of von Neumann measurements
- Capability of local operations and classical communication for distinguishing bipartite unitary operations
- Optimal entanglement-assisted discrimination of quantum measurements
- Optimal measurement strategies for fast entanglement detection
- Quantum observation scheme universally identifying causalities from correlations
- Query complexity of unitary operation discrimination
- Generalized group designs: constructing novel unitary 2-, 3- and 4-designs
- Unambiguous discrimination of the change point for quantum channels