Query complexity of unitary operation discrimination

DOI10.1016/j.physa.2022.127863OpenAlexW3111916522MaRDI QIDQ2170587

Lvzhou Li, Xiaowei Huang

Publication date: 6 September 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.02944

zbMATH Keywords

quantum computingquantum query complexityunitary operation discrimination

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Determination of locally perfect discrimination for two-qubit unitary operations
• Quantum Computation and Quantum Information
• Unitary Transformations Can Be Distinguished Locally
• Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations
• Optimal discrimination between quantum operations
• Rapid solution of problems by quantum computation
• Identification of a reversible quantum gate: assessing the resources
• Unambiguous discrimination among oracle operators

This page was built for publication: Query complexity of unitary operation discrimination