Birkhoff's theorem tells how any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. Similar theorems on unitary matrices reveal a connection between quantum circuits and linear classical reversible circuits. It triggers the question whether a quantum computer can be regarded as a superposition of classical reversible computers
We prove that for any n-qubit unitary transformation U and for any r = 2^{o(n / log n)}, there exist...
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and ...
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for...
Birkhoff's theorem tells how any doubly stochastic matrix can be decomposed as a weighted sum of per...
Thanks to the cosine-sine decomposition of unitary matrices, an arbitrary quantum circuit, acting on...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
Classical reversible logic and quantum computing share the common feature that all computations are ...
Thanks to the cosine-sine decomposition of unitary matrices, an arbitrary quantum circuit, acting on...
By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single ...
Given an arbitrary 2(w) x 2(w) unitary matrix U, a powerful matrix decomposition can be applied, lea...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative en...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
The unitary Birkhoff theorem states that any unitary matrbc with all row sums and all column sums eq...
We prove that for any n-qubit unitary transformation U and for any r = 2^{o(n / log n)}, there exist...
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and ...
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for...
Birkhoff's theorem tells how any doubly stochastic matrix can be decomposed as a weighted sum of per...
Thanks to the cosine-sine decomposition of unitary matrices, an arbitrary quantum circuit, acting on...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
Classical reversible logic and quantum computing share the common feature that all computations are ...
Thanks to the cosine-sine decomposition of unitary matrices, an arbitrary quantum circuit, acting on...
By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single ...
Given an arbitrary 2(w) x 2(w) unitary matrix U, a powerful matrix decomposition can be applied, lea...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative en...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
The unitary Birkhoff theorem states that any unitary matrbc with all row sums and all column sums eq...
We prove that for any n-qubit unitary transformation U and for any r = 2^{o(n / log n)}, there exist...
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and ...
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for...
DOI
Add to ORKG