We consider two-qubit operators and provide a correspondence between their Schmidt number and controlled-NOT (CNOT) complexity, where the CNOT complexity is up to local unitary operations. The results are obtained by complementary means, and a number of examples are given.
The operator-Schmidt decomposition is useful in quantum information theory for quantifying the nonlocality of bipartite unitary operations. We construct a family of unitary operators on n ⊗ n whose operator-Schmidt decompositions are computed using the discrete Fourier transform. As a corollary, we produce unitaries on 3 ⊗ 3 with operator-Schmidt number S for every S ∊ {1, ..., 9}. This corollary was unexpected, since it contradicted reasonable conjectures of Nielsen et al (2003 Phys. Rev. A 67 052301) based on intuition from a striking result in the two-qubit case. By the results of Dür et al (2002 Phys. Rev. Lett. 89 057901), who also considered the two-qubit case, our result implies that there are nine equivalence classes of unitaries on 3 ⊗ 3 which are probabilistically interconvertible by (stochastic) local operations and classical communication. As another corollary, a prescription is produced for constructing maximally-entangled unitaries from biunimodular functions. Reversing tact, we state a generalized operator-Schmidt decomposition of the quantum Fourier transform considered as an operator M 1 ⊗ M 2 → N 1 ⊗ N 2 , with M 1 M 2 = N 1 N 2 . This decomposition shows (by Nielsen's bound) that the communication cost of the QFT remains maximal when a net transfer of qudits is permitted. In an appendix, a canonical procedure is given for removing basis-dependence for results and proofs depending on the 'magic basis' introduced in S Hill and W Wootters (1997 Entanglement of a pair of quantum bits Phys Rev. Lett. 78 5022–5).
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2n to 24232n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.