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

Quantum Information Processing

The rational approximations of the unitary groups

Ming-Xing Luo, Yun Deng, Xiu‐Bo Chen, Yixian Yang

Published May 23, 2013• 1 citation
Publisher
DOI
10.1007/s11128-013-0588-7

Related papers

Approximating the Little Grothendieck Problem over the Unitary and Orthogonal Groups

Afonso S. Bandeira, Christopher Kennedy, Amit Singer

•Aug 23, 2013•2 citations

Approximating the little Grothendieck problem over the orthogonal and unitary groups

Afonso S. Bandeira, Christopher Kennedy, Amit Singer

arXiv:1308.5207•Mathematical Programming•Mar 25, 2016•45 citations

On a Problem of Construction of Efficient Universal Sets of Quantum Gates: A preliminary report

Qingzhong Liang, Steven B. Damelin

A 1-qubit gate is defined as an element of the unitary group $U(2)$, the group of complex valued matrices whose conjugate transposes equal their inverses. In quantum computing, it is important to be able to find good approximations of 1-qubit gates by using a dense group generated by a universal subset of the projective special unitary group $G=PSU(2)$. Here, $PSU(2)$ is the group formed by taking all elements of $U(2)$ with determinant 1 and taking the quotient of this subgroup by the group $\{I,-I\}$ where $I$ is the identity matrix. In this http URL [1], Sarnak recently studied this problem motivated by developing a continued fraction type algorithm for this problem. The continued fraction algorithm is the fastest known algorithm to approximate real numbers by the dense subset of rational numbers. In this report, we study the efficiency of the approximation of $G$ by using a dense group generated by a universal subset of $G$. The measure of the efficiency $K(g)$ of an arbitrary universal subset $g$ is defined in [1] and satisfies $K(g)\geqslant 1$. $g$ is more efficient when $K(g)$ is closer to $1$. We address some open problems posed by Sarnak in [1]. This report forms the basis of the shorter preprint [LD].

•Jun 18, 2015•0 citations

On the Unitary Group and Associated Operators

Atri Mukhopadhyay

Lecture notes in chemistry•Jan 1, 1989•0 citations

Effective rationality for local unitary invariants of mixed states of two qubits

Luca Candelori, Vladimir Chernyak, John R. Klein +1 more

Abstract We calculate the field of rational local unitary invariants for mixed states of two qubits, by employing methods from algebraic geometry. We prove that this field is rational (i.e. purely transcendental), and that it is generated by nine algebraically independent polynomial invariants. We do so by constructing a relative section, in the sense of invariant theory, whose Weyl group is a finite abelian group. From this construction, we are able to give explicit expressions for the generating invariants in terms of the Bloch matrix representation of mixed states of two qubits. We also prove similar rationality results for the local unitary invariants of symmetrically mixed states of two qubits. We also provide a sketch of how to generalize our results to the case of an arbitrary number of qubits. Our results apply to both complex-valued and real-valued invariants.

arXiv:2305.16178•Journal of Physics A Mathematical and Theoretical•Mar 7, 2024•4 citations

Representations of orthogonal and unitary groups and nuclear models

V.V. Vanagas

Journal of Mathematical Sciences•Mar 1, 1987•0 citations
A 1-qubit gate is defined as an element of the unitary group U(2)U(2)U(2), the group of complex valued matrices whose conjugate transposes equal their inverses. In quantum computing, it is important to be able to find good approximations of 1-qubit gates by using a dense group generated by a universal subset of the projective special unitary group G=PSU(2)G=PSU(2)G=PSU(2). Here, PSU(2)PSU(2)PSU(2) is the group formed by taking all elements of U(2)U(2)U(2) with determinant 1 and taking the quotient of this subgroup by the group {I,−I}\{I,-I\}{I,−I} where III is the identity matrix. In this http URL [1], Sarnak recently studied this problem motivated by developing a continued fraction type algorithm for this problem. The continued fraction algorithm is the fastest known algorithm to approximate real numbers by the dense subset of rational numbers. In this report, we study the efficiency of the approximation of GGG by using a dense group generated by a universal subset of GGG. The measure of the efficiency K(g)K(g)K(g) of an arbitrary universal subset ggg is defined in [1] and satisfies K(g)⩾1K(g)\geqslant 1K(g)⩾1. ggg is more efficient when K(g)K(g)K(g) is closer to 111. We address some open problems posed by Sarnak in [1]. This report forms the basis of the shorter preprint [LD].
Abstract We calculate the field of rational local unitary invariants for mixed states of two qubits, by employing methods from algebraic geometry. We prove that this field is rational (i.e. purely transcendental), and that it is generated by nine algebraically independent polynomial invariants. We do so by constructing a relative section, in the sense of invariant theory, whose Weyl group is a finite abelian group. From this construction, we are able to give explicit expressions for the generating invariants in terms of the Bloch matrix representation of mixed states of two qubits. We also prove similar rationality results for the local unitary invariants of symmetrically mixed states of two qubits. We also provide a sketch of how to generalize our results to the case of an arbitrary number of qubits. Our results apply to both complex-valued and real-valued invariants.