Relation of operator Schmidt decomposition and CNOT complexity

DOI10.1007/S11128-008-0077-6MaRDI QIDQ941709zbMATH OpenOpenAlexFDO

Authors 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

Canonical decompositionCNOTCNOT complexityOperator Schmidt decompositionQuantum logic gateSchmidt number

Mathematics Subject Classification ID

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

Recommendations

• Exact canonical decomposition of two-qubit operators in terms of CNOT
• Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries
• Operator-Schmidt decomposition and the geometrical edges of two-qubit gates
• Operator-Schmidt decomposition of the quantum Fourier transform on  ^{N₁    N₂}
• scientific article

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

(5)

• Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity
• Operator-Schmidt decomposition of the quantum Fourier transform on  ^{N₁    N₂}
• Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries
• Exact canonical decomposition of two-qubit operators in terms of CNOT
• 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)