Relation of operator Schmidt decomposition and CNOT complexity

DOI10.1007/S11128-008-0077-6zbMATH Open1144.81438OpenAlexW2000837875MaRDI QIDQ941709FDOQ941709

Mark W. Coffey, Ron Deiotte

Publication date: 2 September 2008

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

Full work available at URL: https://doi.org/10.1007/s11128-008-0077-6

zbMATH Keywords

Schmidt numberCNOTCanonical decompositionCNOT complexityOperator Schmidt decompositionQuantum logic gate

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Feasibility of the controlled-NOT gate from certain model Hamiltonians
• Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries

Cited In (2)

• Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity
• Entropy of operators or why matrix multiplication is hard for depth-two circuits

This page was built for publication: Relation of operator Schmidt decomposition and CNOT complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941709)