Identification of a reversible quantum gate: assessing the resources
From MaRDI portal
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.
Recommendations
- Reversibility in extended measurement-based quantum computation
- Reversible measurement on quantum states of trapped-ion qubits
- Quantum gate identification: error analysis, numerical results and optical experiment
- Synthesis of quantum circuits vs. synthesis of classical reversible circuits
- Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
- Reversibility conditions for quantum channels and their applications
- Ancilla-assisted discrimination of quantum gates
- Complexity of reversible circuits and their quantum implementations
- Reversible and Quantum Circuit Optimization: A Functional Approach
Cites work
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- A semidefinite programming approach to optimal unambiguous discrimination of quantum states
- A ‘Pretty Good’ Measurement for Distinguishing Quantum States
- Algorithm theory -- SWAT 2006. 10th Scandinavian workshop on algorithm theory, Riga, Latvia, July 6--8, 2006. Proceedings.
- Ancilla-assisted discrimination of quantum gates
- Beyond stabilizer codes .I. Nice error bases
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Entanglement is not necessary for perfect discrimination between unitary operations
- Evenly distributed unitaries: On the structure of unitary designs
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- MAXIMUM LIKELIHOOD ESTIMATION FOR A GROUP OF PHYSICAL TRANSFORMATIONS
- Nonbinary quantum codes
- Nonbinary quantum stabilizer codes
- Optimizing quantum process tomography with unitary2-designs
- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm
- Quantum error correction via codes over GF(4)
- Quantum lower bounds by quantum arguments
- Symmetric informationally complete quantum measurements
- Theoretical framework for quantum networks
- Unambiguous discrimination among oracle operators
- Unitary designs and codes
- Unknown quantum states: The quantum de Finetti representation
Cited in
(5)- Quantum gate identification: error analysis, numerical results and optical experiment
- Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
- Ancilla-assisted discrimination of quantum gates
- Query complexity of unitary operation discrimination
- On the query complexity of perfect gate discrimination
This page was built for publication: Identification of a reversible quantum gate: assessing the resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141581)
