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

Overlooked restrictions on Euler angles in quantum computation

Mitsuru Hamada

Published Mar 19, 2013• 2 citations
OpenAlex

Related papers

Some mathematical results in quantum computation

Qiujie Sun

Journal of Southwest University•Jan 1, 2005•0 citations

A Lemma on Euler Angles

Mitsuru Hamada

A recently obtained fundamental lemma on Euler angles and its application to some issue on universal gates for quantum computation [M. Hamada, “Overlooked restrictions on Euler angles in quantum computation,” APS 2013 March Meeting, Baltimore, USA, 2012, http://meetings.aps.org/link/BAPS.2013.MAR.H1.318 (abstract)] are described in detail. The fundamental lemma in the unpublished work is as follows. Let X,Y , and Z denote the Pauli matrices. For any three-dimensional real unit vector n = (nx, ny , nz) and θ ∈ R, put Rn(θ) = cos(θ/2)I − i sin(θ/2)(nxX + nyY + nzZ). Put Ry(θ) = R(0,1,0)T (θ) and Rz(θ) = R(0,0,1)T (θ). Lemma: Assume α, γ, θ ∈ R and n = (nx, ny , nz) is a real unit vector; then, there exists some β, δ ∈ R satisfying Rn(θ) = e Rz(β)Ry(γ)Rz(δ) if and only if e ∈ {1,−1} and √ 1− n2z| sin(θ/2)| = | sin(γ/2)|. By means of this lemma, a widespread fallacy on universal gates has been pointed out. Mathematical details of the lemma and its application, together with self-contained expositions of underlying notions, are given so as to help us dispel the fallacy.

•Jan 1, 2013•1 citation

Some Quantum Computation Preliminaries

WORLD SCIENTIFIC eBooks•May 1, 2021•0 citations

Improving quantum gate fidelities using optimized Euler angles

K. Ch. Chatzisavvas, Goce Chadzitaskos, C. Daskaloyannis +1 more

An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitrary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.

arXiv:0805.2894•Physical Review A•Nov 23, 2009•4 citations

On Quantum Computation with Some Restricted Amplitudes

Harumichi Nishimura

Lecture notes in computer science•Jan 1, 2002•0 citations

Explicit algorithm for generalized Euler decomposition of SU(2)

K. Ch. Chatzisavvas, Goce Chadzitaskos, C. Daskaloyannis +1 more

An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.

•May 19, 2008•0 citations
A recently obtained fundamental lemma on Euler angles and its application to some issue on universal gates for quantum computation [M. Hamada, “Overlooked restrictions on Euler angles in quantum computation,” APS 2013 March Meeting, Baltimore, USA, 2012, http://meetings.aps.org/link/BAPS.2013.MAR.H1.318 (abstract)] are described in detail. The fundamental lemma in the unpublished work is as follows. Let X,Y , and Z denote the Pauli matrices. For any three-dimensional real unit vector n = (nx, ny , nz) and θ ∈ R, put Rn(θ) = cos(θ/2)I − i sin(θ/2)(nxX + nyY + nzZ). Put Ry(θ) = R(0,1,0)T (θ) and Rz(θ) = R(0,0,1)T (θ). Lemma: Assume α, γ, θ ∈ R and n = (nx, ny , nz) is a real unit vector; then, there exists some β, δ ∈ R satisfying Rn(θ) = e Rz(β)Ry(γ)Rz(δ) if and only if e ∈ {1,−1} and √ 1− n2z| sin(θ/2)| = | sin(γ/2)|. By means of this lemma, a widespread fallacy on universal gates has been pointed out. Mathematical details of the lemma and its application, together with self-contained expositions of underlying notions, are given so as to help us dispel the fallacy.
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitrary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single qubit gates even if the control is severely restricted and the experimentally accessible Hamiltonians are far from orthogonal. It is further shown that using the optimized Euler angles can significantly improve the fidelity of quantum operations even for systems where the experimentally accessible Hamiltonians are nearly orthogonal. Unlike schemes such as composite pulses, the proposed scheme does not significantly increase the number of local operations or gate operation times.