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

Journal of Mathematical Physics

Householder factorizations of unitary matrices

Jesús Urías

Published Jul 1, 2010• 15 citations
Publisher

Abstract

A method to construct all representations of finite dimensional unitary matrices as the product of Householder reflections is given. By arbitrarily severing the state space into orthogonal subspaces, the method may, e.g., identify the entangling and single-component quantum operations that are required in the engineering of quantum states of composite (multipartite) systems. Earlier constructions are shown to be extreme cases of the unifying scheme that is presented here.

DOI
10.1063/1.3451111

Related papers

Wreath products and multipartite quantum systems

Vladimir V. Kornyak

Abstract A natural symmetry group of a multicomponent quantum system is a special combination of a symmetry group acting within a single component (“local group”) and a group that permutes the components (“spatial symmetry group”). This combination is called the wreath product. Unitary representations of wreath products describe quantum evolutions of multipartite systems. It is known that any unitary representation of a finite group is contained in some permutation representation. We describe an algorithm for decomposing permutation representations of wreath products into irreducible components. This decomposition makes it possible to study the quantum behavior (entanglement, non-local correlations, etc.) of multipartite systems in invariant subspaces of the permutation Hilbert space.

Journal of Physics Conference Series•Dec 1, 2019•0 citations

Synthesis of Arbitrary Unitary Transformations in Quantum Systems by Householder Reflections

Peter A. Ivanov, Nikolay V. Vitanov, Theodore E. Simos +1 more

We demonstrate that Householder reflections emerge naturally in the propagator of a coherently driven degenerate two‐level system. Such reflections are a very powerful tool for constructing arbitrary unitary transformations of an N‐state quantum system. We present examples for construction of discrete Fourier transforms, superposition‐to‐superposition navigation between pure states, engineering of arbitrary mixed states, and entanglement of trapped ions.

AIP conference proceedings•Jan 1, 2007•0 citations

Engineering of arbitrary U(N) transformations by quantum Householder reflections

Peter A. Ivanov, Elica S. Kyoseva, Nikolay V. Vitanov

We propose a simple physical implementation of the quantum Householder reflection (QHR) $\mathbf{M}(v)=\mathbf{I}\ensuremath{-}2\ensuremath{\mid}v⟩⟨v\ensuremath{\mid}$ in a quantum system of $N$ degenerate states (forming a qunit) coupled simultaneously to an ancillary (excited) state by $N$ resonant or nearly resonant pulsed external fields. We also introduce the generalized QHR $\mathbf{M}(v;\ensuremath{\varphi})=\mathbf{I}+({e}^{i\ensuremath{\varphi}}\ensuremath{-}1)\ensuremath{\mid}v⟩⟨v\ensuremath{\mid}$, which can be produced in the same $N$-pod system when the fields are appropriately detuned from resonance with the excited state. We use these two operators as building blocks in constructing arbitrary preselected unitary transformations. We show that the most general $\mathrm{U}(N)$ transformation can be factorized (and thereby produced) by either $N\ensuremath{-}1$ standard QHRs and an $N$-dimensional phase gate, or $N\ensuremath{-}1$ generalized QHRs and a one-dimensional phase gate. Viewed mathematically, these QHR factorizations provide parametrizations of the $\mathrm{U}(N)$ group. As an example, we propose a recipe for constructing the quantum Fourier transform (QFT) by at most $N$ interaction steps. For example, the QFT requires a single QHR for $N=2$, and only two QHRs for $N=3$ and 4.

arXiv:0708.2811•Physical Review A•Aug 25, 2006•84 citations

Householder methods for quantum circuit design

Jesús Urías, Diego Quiñones

Algorithms to resolve multiple-qubit unitary transformations into a sequence of simple operations on one-qubit subsystems are central to the methods of quantum-circuit simulators. We adapt Householder’s theorem to the tensor-product character of multi-qubit state vectors and translate it to a combinatorial procedure to assemble cascades of quantum gates that recreate any unitary operation U acting on n-qubit systems. U may be recreated by any cascade from a set of combinatorial options that, in number, are not lesser than super-factorial of 2n, [Formula: see text]. Cascades are assembled with one-qubit controlled-gates of a single type. We complement the assembly procedure with a new algorithm to generate Gray codes that reduce the combinatorial options to cascades with the least number of CNOT gates. The combined procedure —factorization, gate assembling, and Gray ordering — is illustrated on an array of three qubits.

Canadian Journal of Physics•Oct 28, 2015•6 citations

UNITARY OPERATORS, ENTANGLEMENT, AND GRAM–SCHMIDT ORTHOGONALIZATION

Yorick Hardy, Willi-Hans Steeb

We consider finite-dimensional Hilbert spaces [Formula: see text] with [Formula: see text] with n ≥ 2 and unitary operators. In particular, we consider the case n = 2m, where m ≥ 2 in order to study entanglement of states in these Hilbert spaces. Two normalized states ψ and ϕ in these Hilbert spaces [Formula: see text] are connected by a unitary transformation (n×n unitary matrices), i.e. ψ = Uϕ, where U is a unitary operator UU* = I. Given the normalized states ψ and ϕ, we provide an algorithm to find this unitary operator U for finite-dimensional Hilbert spaces. The construction is based on a modified Gram–Schmidt orthonormalization technique. A number of applications important in quantum computing are given. Symbolic C++ is used to give a computer algebra implementation in C++.

International Journal of Modern Physics C•Jun 1, 2009•1 citation

Complete hierarchy of linear systems for certifying quantum entanglement of subspaces

Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan

We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in the sense that every entangled subspace is shown to be so at some finite level of the hierarchy. It straightforwardly generalizes to the case of higher Schmidt rank, as well as the multipartite cases of completely and genuinely entangled subspaces. These hierarchies work extremely well in practice even in very large quantum systems, as they can be implemented via elementary linear algebra techniques rather than the semidefinite programming techniques that are required by previously known hierarchies.

arXiv:2210.16389•Physical Review A•Dec 29, 2022•9 citations
A method to construct all representations of finite dimensional unitary matrices as the product of Householder reflections is given. By arbitrarily severing the state space into orthogonal subspaces, the method may, e.g., identify the entangling and single-component quantum operations that are required in the engineering of quantum states of composite (multipartite) systems. Earlier constructions are shown to be extreme cases of the unifying scheme that is presented here.
Abstract A natural symmetry group of a multicomponent quantum system is a special combination of a symmetry group acting within a single component (“local group”) and a group that permutes the components (“spatial symmetry group”). This combination is called the wreath product. Unitary representations of wreath products describe quantum evolutions of multipartite systems. It is known that any unitary representation of a finite group is contained in some permutation representation. We describe an algorithm for decomposing permutation representations of wreath products into irreducible components. This decomposition makes it possible to study the quantum behavior (entanglement, non-local correlations, etc.) of multipartite systems in invariant subspaces of the permutation Hilbert space.
We propose a simple physical implementation of the quantum Householder reflection (QHR) $\mathbf{M}(v)=\mathbf{I}\ensuremath{-}2\ensuremath{\mid}v⟩⟨v\ensuremath{\mid}$ in a quantum system of NNN degenerate states (forming a qunit) coupled simultaneously to an ancillary (excited) state by NNN resonant or nearly resonant pulsed external fields. We also introduce the generalized QHR $\mathbf{M}(v;\ensuremath{\varphi})=\mathbf{I}+({e}^{i\ensuremath{\varphi}}\ensuremath{-}1)\ensuremath{\mid}v⟩⟨v\ensuremath{\mid}$, which can be produced in the same NNN-pod system when the fields are appropriately detuned from resonance with the excited state. We use these two operators as building blocks in constructing arbitrary preselected unitary transformations. We show that the most general U(N)\mathrm{U}(N)U(N) transformation can be factorized (and thereby produced) by either $N\ensuremath{-}1$ standard QHRs and an NNN-dimensional phase gate, or $N\ensuremath{-}1$ generalized QHRs and a one-dimensional phase gate. Viewed mathematically, these QHR factorizations provide parametrizations of the U(N)\mathrm{U}(N)U(N) group. As an example, we propose a recipe for constructing the quantum Fourier transform (QFT) by at most NNN interaction steps. For example, the QFT requires a single QHR for N=2N=2N=2, and only two QHRs for N=3N=3N=3 and 4.
Algorithms to resolve multiple-qubit unitary transformations into a sequence of simple operations on one-qubit subsystems are central to the methods of quantum-circuit simulators. We adapt Householder’s theorem to the tensor-product character of multi-qubit state vectors and translate it to a combinatorial procedure to assemble cascades of quantum gates that recreate any unitary operation U acting on n-qubit systems. U may be recreated by any cascade from a set of combinatorial options that, in number, are not lesser than super-factorial of 2n, [Formula: see text]. Cascades are assembled with one-qubit controlled-gates of a single type. We complement the assembly procedure with a new algorithm to generate Gray codes that reduce the combinatorial options to cascades with the least number of CNOT gates. The combined procedure —factorization, gate assembling, and Gray ordering — is illustrated on an array of three qubits.
We consider finite-dimensional Hilbert spaces [Formula: see text] with [Formula: see text] with n ≥ 2 and unitary operators. In particular, we consider the case n = 2m, where m ≥ 2 in order to study entanglement of states in these Hilbert spaces. Two normalized states ψ and ϕ in these Hilbert spaces [Formula: see text] are connected by a unitary transformation (n×n unitary matrices), i.e. ψ = Uϕ, where U is a unitary operator UU* = I. Given the normalized states ψ and ϕ, we provide an algorithm to find this unitary operator U for finite-dimensional Hilbert spaces. The construction is based on a modified Gram–Schmidt orthonormalization technique. A number of applications important in quantum computing are given. Symbolic C++ is used to give a computer algebra implementation in C++.
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in the sense that every entangled subspace is shown to be so at some finite level of the hierarchy. It straightforwardly generalizes to the case of higher Schmidt rank, as well as the multipartite cases of completely and genuinely entangled subspaces. These hierarchies work extremely well in practice even in very large quantum systems, as they can be implemented via elementary linear algebra techniques rather than the semidefinite programming techniques that are required by previously known hierarchies.