Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Relation of operator Schmidt decomposition and CNOT complexity

Mark W. Coffey, Ron Deiotte

Published Mar 19, 2009• 0 citations
OpenAlex

Abstract

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.

Related papers

Classification of nonlocal two-qubit gates using Schmidt number

S. Balakrishnan, Leona J. Felicia, R. Sankaranarayanan

It is known from Schmidt decomposition that Schmidt number of nonlocal two-qubit quantum gates is 2 or 4. We identify conditions on geometrical points of a gate to have Schmidt number 2. A simple analysis reveals that Schmidt number 2 corresponds to controlled unitary gates with CNOT being the only perfect entangler. Further, it is shown that Schmidt strength and entangling power are maximum only for CNOT in the controlled unitary family.

arXiv:0907.5519•Jul 31, 2009•0 citations

Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries

Jon E Tyson

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).

arXiv:quant-ph/0306144•Journal of Physics A Mathematical and General•Sep 15, 2003•50 citations

Decomposing the SWAP quantum gate

Yorick Hardy, W.‐H. Steeb

Quantum gates are represented by unitary operators on a Hilbert space. We consider the unitary operators on and describe the component operators on each Hilbert space in the product space. From these criteria we derive a decomposition for a specific class of unitary operators such that each operator in the product has Schmidt rank bounded by 2. This decomposition directly yields the XOR (controlled NOT) implementation of the SWAP operation.

Journal of Physics A Mathematical and General•Jan 24, 2006•10 citations

Relation of operator Schmidt decomposition and CNOT complexity

Mark W. Coffey, Ron Deiotte

Quantum Information Processing•Jun 1, 2008•3 citations

Comment on “Universal quantum circuit for two-qubit transformations with three controlled-NOT gates” and “Recognizing small-circuit structure in two-qubit operators”

Mark W. Coffey, Ron Deiotte, Torey Semi

Recent papers in Physical Review A have considered small quantum circuit decompositions in terms of a minimal number of controlled-NOT (CNOT) gates. Specifically, we point out errors in the papers by Vidal and Dawson [Phys. Rev. A 69, 010301(R) (2004)] and by Shende et al. [Phys. Rev. A 70, 012310 (2004)].

Physical Review A•Jun 26, 2008•19 citations

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

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 ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ 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.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations
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 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.