Identification of a reversible quantum gate: assessing the resources

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.

24 + 8 pages, published version

References in corpus (14)

• Theoretical framework for quantum networks
• Quantum Circuits Architecture
• Evenly distributed unitaries: on the structure of unitary designs
• Continuous Variable Quantum Cryptography using Two-Way Quantum Communication
• Classical and quantum communication without a shared reference frame
• The Perfect Distinguishability of Quantum Operations
• Optimizing quantum process tomography with unitary 2-designs
• Unitary designs and codes
• Quantum communication using a bounded-size quantum reference frame
• Optimal cloning of unitary transformations
• Unambiguous discrimination among oracle operators
• Programmable discriminator of coherent states - experimental realization
• Teleportation transfers only speakable quantum information
• Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm

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