Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity

DOI10.1007/s11128-018-1870-5zbMath1395.81076OpenAlexW2794250156WikidataQ130120816 ScholiaQ130120816MaRDI QIDQ1654117

Y. Aharonov

Publication date: 7 August 2018

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-018-1870-5

zbMATH Keywords

quantization schemesquantum circuitsCNOT complexitytwo-qubit operator

Mathematics Subject Classification ID

2-person games (91A05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Significance of entangling operators in the purview of modified EWL scheme ⋮ Role of two-qubit entangling operators in the modified Eisert-Wilkens-Lewenstein approach of quantization

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum strategies
• Relativistic quantum Bayesian game under decoherence
• Mini-maximizing two qubit quantum computations
• Exact canonical decomposition of two-qubit operators in terms of CNOT
• Operator-Schmidt decomposition and the geometrical edges of two-qubit gates
• Relation of operator Schmidt decomposition and CNOT complexity
• A quantum approach to static games of complete information
• An invitation to quantum game theory
• Characterization of two-qubit perfect entanglers
• Quantum Games and Quantum Strategies
• Generalized quantization scheme for two-person non-zero sum games
• Entangling power and local invariants of two-qubit gates
• Equilibrium points in n -person games

This page was built for publication: Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity