Geometric theory of nonlocal two-qubit operations
Open accessAbstract
We study nonlocal two-qubit operations from a geometric perspective. By applying a Cartan decomposition to su(4), we find that the geometric structure of nonlocal gates is a 3-torus. We derive the invariants for local transformations, and connect these local invariants to the coordinates of the 3-torus. Since different points on the 3-torus may correspond to the same local equivalence class, we use the Weyl group theory to reduce the symmetry. We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base. We then study the properties of perfect entanglers, that is, the two-qubit operations that can generate maximally entangled states from some initially separable states. We provide criteria to determine whether a given two-qubit gate is a perfect entangler and establish a geometric description of perfect entanglers by making use of the tetrahedral representation of nonlocal gates. We find that exactly half the nonlocal gates are perfect entanglers. We also investigate the nonlocal operations generated by a given Hamiltonian. We first study the gates that can be directly generated by a Hamiltonian. Then we explicitly construct a quantum circuit that contains at most three nonlocal gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single-qubit terms. We prove that such a quantum circuit can simulate any arbitrary two-qubit gate exactly, and hence it provides an efficient implementation of universal quantum computation and simulation.
AI snapshot
Written from the paper’s full text.
TL;DR
The paper applies Cartan decomposition of su(4) and Weyl group theory to give a geometric representation of nonlocal two-qubit gates as a 3-Torus reduced to a tetrahedral Weyl chamber. It proves that exactly half of nonlocal gates are perfect entanglers and that any two-qubit gate can be simulated exactly with at most three uses of a two-body Hamiltonian plus four local gates.
Key findings
- Nonlocal two-qubit gates have a 3-Torus geometric structure; local equivalence classes correspond one-to-one with points in a tetrahedral Weyl chamber \(a^+\), except for an identification on the base, with each Weyl chamber having volume \(\pi^3/24\).
- A two-qubit gate \(U\) is a perfect entangler iff the convex hull of the eigenvalues of \(m(U)\) contains zero; the perfect entanglers form a seven-faced polyhedron \(LMNPQA_2\) of volume \(\pi^3/48\), exactly half the tetrahedron, so exactly half of all nonlocal two-qubit gates are perfect entanglers.
- Examples: CNOT and Controlled-Z share local invariants \(G_1=0\), \(G_2=1\) and correspond to \([\pi/2,0,0]\); \(\sqrt{\mathrm{SWAP}}\) has \(G_1=i/4\), \(G_2=0\) and corresponds to \([\pi/4,\pi/4,\pi/4]\); SWAP corresponds to \([\pi/2,\pi/2,\pi/2]\).
- Any arbitrary two-qubit gate \(U\in SU(4)\) can be simulated exactly by a circuit with at most three nonlocal gates generated by a two-body interaction Hamiltonian and at most four local gates; CNOT can be built from two \(\sqrt{\mathrm{SWAP}}\) gates and a local gate.
Methods
- Theoretical Lie-group/algebra approach: Cartan decomposition of \(su(4)\), Killing form, roots, Weyl group reflections, Bell-basis transformation, local invariants \(G_1\) and \(G_2\), and tetrahedral Weyl-chamber representation.
- Analytical proofs and constructions, with worked Hamiltonian examples including isotropic Heisenberg exchange, XY exchange, Ising exchange, generalized anisotropic exchange with cross-terms, and Josephson charge-coupled qubits.
- No experimental data or numerical sample; the paper derives criteria, proves theorems, and explicitly constructs quantum circuits for exact simulation.
Limitations
- The paper states no limitations section; no explicit limitations are given in the text.
- Evident from the text: the treatment is restricted to two-qubit operations and assumes ideal local gates that can be turned on individually; the universal-circuit theorem is stated for Hamiltonians with \(iH\in p\), i.e. purely nonlocal Hamiltonian part.
- Evident from the text: no experimental implementation, error analysis, or noise considerations are provided.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 4 cited sources checked · 0 supported · 0 flagged
- Findingreasoning§ A geometric theory of non-local two-qubit operations · p. 1
The geometric structure of non-local two-qubit gates is a 3-Torus.
“By applying a Cartan decomposition to su (4), we find that the geometric structure of non-local gates is a 3-Torus.”
- Also stated in: § A geometric theory of non-local two-qubit operations · p. 1 · plain
“We find that the geometric structure of non-local gates is a 3-Torus.”
- Also stated in: § III. NON-LOCAL OPERATIONS · p. 6 · plain
“It also reveals that the geometric structure of the local equivalence classes is none other than a 3-Torus.”
Quote in the paperSubstantial claim - Also stated in: § A geometric theory of non-local two-qubit operations · p. 1 · plain
- Findingreasoning§ B. Application to su (4) · p. 6
The Abelian subalgebra a is a Cartan subalgebra of the pair (g,k).
“Hence it is a Cartan subalgebra of the pair ( g , k ).”
Quote in the paperSubstantial claim - Findingnone given§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The local invariants of U(t) for H2 are G1(t)=cos^4(t/2) and G2(t)=1+2 cos t.
“The local invariants of U ( t ) are G 1 ( t ) = cos 4 t 2 and G 2 ( t ) = 1 + 2 cos t .”
Quote in the paperNot a substantial claim - Findingreasoning§ (1) Isotropic (Heisenberg) exchange: H 1 = 1 4 ( σ 1 x σ 2 x + σ 1 y σ 2 y + σ 1 z σ 2 z ) · p. 15
The isotropic Heisenberg exchange Hamiltonian H1 generates the flow [t/2,t/2,t/2] on the 3-Torus.
“Hence the Hamiltonian H 1 generates the flow [ t 2 , t 2 , t 2 ] on the 3-Torus.”
Quote in the paperSubstantial claim - Findingreasoning§ (4) ControlledU · p. 10
The corresponding point for ControlledU in a+ is [γ,0,0].
“we find that [ γ, 0 , 0] is the corresponding point in a + .”
Quote in the paperSubstantial claim
- Findingreasoning§ (1) CNOT · p. 10
The corresponding point for CNOT in the Weyl chamber a+ is [π/2,0,0].
“we find that [ π 2 , 0 , 0] is the corresponding point for CNOT in the Weyl chamber a + .”
Quote in the paperSubstantial claim - Findingnone given§ (4) ControlledU · p. 10
For the ControlledU gate, the local invariants are G1=cos^2 γ and G2=2 cos^2 γ +1, where γ = sqrt(γ1^2+γ2^2+γ3^2).
“For the ControlledU gate, the local invariants are G 1 = cos 2 γ and G 2 = 2 cos 2 γ +1, where γ = √ γ 2 1 + γ 2 2 + γ 2 3 .”
Quote in the paperSubstantial claim - Findingnone given§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The XY Hamiltonian H2 generates the flow [t/2,t/2,0] for t ∈ [2kπ, 2kπ+π], and [t/2, π - t/2, 0] for t ∈ [2kπ+π, 2(k+1)π].
“The Hamiltonian H 2 generates the flow [ t 2 , t 2 , 0] for t ∈ [2 kπ, 2 kπ + π ], and [ t 2 , π -t 2 , 0] for t ∈ [2 kπ + π, 2( k +1) π ].”
Quote in the paperSubstantial claim - Findingreasoning§ (1) CNOT · p. 10
The corresponding point for √SWAP in a+ is [π/4,π/4,π/4].
“we derive that [ π 4 , π 4 , π 4 ] is the corresponding point in a + .”
Quote in the paperSubstantial claim - Findingreasoning§ B. Geometric representation of two-qubit gates · p. 8
The local invariants G1 and G2 are related to the coordinates [c1,c2,c3] of the 3-Torus structure of non-local two-qubit gates.
“Eq. (30) reveals the relation between the local invariants G 1 and G 2 and the coordinates [ c 1 , c 2 , c 3 ] of the 3-Torus structure of non-local two-qubit gates.”
Quote in the paperSubstantial claim - Findingreasoning§ A geometric theory of non-local two-qubit operations · p. 1
A quantum circuit containing at most three non-local gates generated by a two-body interaction Hamiltonian and at most four local gates generated by single-qubit terms can simulate any arbitrary two-qubit gate exactly.
“We explicitly construct a quantum circuit that contains at most three non-local gates generated by a two-body interaction Hamiltonian, together with at most four local gates generated by single qubit terms.”
- Also stated in: § I. INTRODUCTION · p. 2 · boosted
“We explicitly construct a quantum circuit that contains three non-local gates generated by a given two-body interaction Hamiltonian for corresponding finite time durations, together with at most four local gates. We prove that such a quantum circuit can simulate any arbitrary two-qubit operation exactly and is therefore universal.”
Quote in the paperSubstantial claim - Also stated in: § I. INTRODUCTION · p. 2 · boosted
- Findingown data§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The local invariants of U(t) for H3 are G1(t)=cos^2(t/2) and G2(t)=2+cos t.
“The local invariants of U ( t ) are G 1 ( t ) = cos 2 t 2 and G 2 ( t ) = 2 + cos t .”
Quote in the paperNot a substantial claim - Findingnone given§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The trajectory generated by H3 in a+ is [t/2,0,0], which evolves along the line OA1.
“The trajectory generated by the Hamiltonian H 3 in a + is [ t 2 , 0 , 0], which evolves along the line OA 1 .”
Quote in the paperSubstantial claim - Findingreasoning§ B. Geometric representation of two-qubit gates · p. 8
In general, multiple points on the 3-Torus correspond to a given pair of local invariants G1 and G2.
“In general, we expect to find multiple points on the 3-Torus for a given pair G 1 and G 2 .”
Quote in the paperSubstantial claim - Findingnone given§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
For any arbitrary H = 1/2(c1 σxσx + c2 σyσy + c3 σzσz), the trajectory on the 3-Torus is [c1 t, c2 t, c3 t].
“For any arbitrary H = 1 2 ( c 1 σ 1 x σ 2 x + c 2 σ 1 y σ 2 y + c 3 σ 1 z σ 2 z ), the trajectory on the 3-Torus is [ c 1 t, c 2 t, c 3 t ].”
Quote in the paperSubstantial claim - Findingreasoning§ B. Geometric representation of two-qubit gates · p. 9
The local equivalence classes of two-qubit gates are in one-to-one correspondence with the points of a Weyl chamber.
“Since each orbit of the Weyl group W ( G,K ) on a contains precisely one point in a Weyl chamber, the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points of a Weyl chamber.”
Quote in the paperSubstantial claim - Findingnone given§ I. INTRODUCTION · p. 2
Gates directly generated by a given Hamiltonian form a one-dimensional subset on the 3-Torus.
“Generally, these gates form a one dimensional subset on the 3-Torus.”
Quote in the paperNot a substantial claim - Findingreasoning§ B. Application to su (4) · p. 5
The decomposition g = k ⊕ p is a Cartan decomposition of su(4).
“Therefore the decomposition g = k ⊕ p is a Cartan decomposition of su (4).”
Quote in the paperSubstantial claim - Findingreasoning§ (1) CNOT · p. 10
The corresponding point for SWAP is [π/2,π/2,π/2].
“we obtain that the corresponding point for SWAP is [ π 2 , π 2 , π 2 ]”
Quote in the paperSubstantial claim - Findingreasoning§ A geometric theory of non-local two-qubit operations · p. 1
The local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base.
“We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron except on the base.”
- Also stated in: § III. NON-LOCAL OPERATIONS · p. 6 · plain
“We show that the local equivalence classes of two-qubit gates are in one-to-one correspondence with the points in a tetrahedron, except on the base where there are two equivalent areas.”
- Also stated in: § B. Geometric representation of two-qubit gates · p. 9 · plain
“Note that every point in a + corresponds to a different local equivalence class.”
Quote in the paperSubstantial claim - Also stated in: § III. NON-LOCAL OPERATIONS · p. 6 · plain
- Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 14
The points in Corollary 2 correspond to the triangles LMN, LPQ, and NPA2, which are three faces of the set of perfect entanglers.
“The points in Corollary 2 correspond to the triangles LMN, LPQ, and NPA 2 , which are three faces of the set of perfect entanglers.”
Quote in the paperNot a substantial claim - Interpretationnone given§ A. Non-local operations generated by a given Hamiltonian · p. 14
If the Hamiltonian H contains the non-local part, then H can generate non-local gates.
“If the Hamiltonian H contains the non-local part, that is, iH ∩ p = ∅ , then H can generate non-local gates.”
Quote in the paperNot a substantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13
If c2+c3 ≥ π/2, the gate is not a perfect entangler.
“If c 2 + c 3 ≥ π 2 , that is, all the e i 2( c j + c k ) are on the lower semi-circle, the gate is not a perfect entangler either.”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13
If c1+c2 ≤ π/2, the gate is not a perfect entangler.
“If c 1 + c 2 ≤ π 2 , that is, all the e i 2( c j + c k ) are on the upper semi-circle, the gate is not a perfect entangler.”
Quote in the paperSubstantial claim - Interpretationreasoning§ (1) Isotropic (Heisenberg) exchange: H 1 = 1 4 ( σ 1 x σ 2 x + σ 1 y σ 2 y + σ 1 z σ 2 z ) · p. 15
√SWAP and its inverse are the only two perfect entanglers that can be achieved by H1.
“Moreover, it can easily be seen that √ SWAP and its inverse are the only two perfect entanglers that can be achieved by this Hamiltonian.”
Quote in the paperSubstantial claim - Interpretationreasoning§ (4) ControlledU · p. 10
All ControlledU gates correspond to the line OL in a+, where L is [CNOT].
“Hence, all the ControlledU gates correspond to the line OL in a + , where L is [CNOT].”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 14
Among all non-local two-qubit gates, half of them are perfect entanglers.
“This implies that among all the non-local two-qubit gates, half of them are perfect entanglers.”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 10
A two-qubit gate U is a perfect entangler if and only if the convex hull of the eigenvalues of m(U) contains zero.
“Theorem 1 (Condition for perfect entangler) A two-qubit gate U is a perfect entangler if and only if the convex hull of the eigenvalues of m ( U ) contains zero.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [2] Y. Makhlin (2000), e-print quant-ph/0002045. source
Not checked in the free run.
- Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 12
For a two-qubit gate U, if its corresponding point in a+ is [c1,π/2-c1,c3], [c1,c1-π/2,c3], or [c1,c2,π/2-c2], U is a perfect entangler.
“Corollary 2 For a two-qubit gate U , if its corresponding point in the Weyl chamber a + is [ c 1 , π 2 -c 1 , c 3 ] , [ c 1 , c 1 -π 2 , c 3 ] , or [ c 1 , c 2 , π 2 -c 2 ] , U is a perfect entangler.”
Quote in the paperSubstantial claim - Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
CNOT, located at L, is the only perfect entangler that can be generated by H3.
“As noted above, CNOT, located at L, is the only perfect entangler that can be generated by this Hamiltonian.”
Quote in the paperSubstantial claim - Interpretationnone given§ I. INTRODUCTION · p. 2
The entangling property of a quantum gate is determined only by its geometric representation on the 3-Torus.
“We show that the entangling property of a quantum gate is only determined by its geometric representation on the 3-Torus.”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13
Whether a two-qubit gate is a perfect entangler is only determined by its geometric representation [c1,c2,c3] on the 3-Torus.
“The above analysis shows that whether a two-qubit gate is a perfect entangler or not is only determined by its geometric representation [ c 1 , c 2 , c 3 ] on the 3-Torus.”
Quote in the paperSubstantial claim - Interpretationreasoning§ I. INTRODUCTION · p. 2
Such a quantum circuit can efficiently provide maximal entanglement from any arbitrary Hamiltonian of this form.
“In particular, it can therefore efficiently provide maximal entanglement from any arbitrary Hamiltonian of this form.”
Quote in the paperSubstantial claim - Interpretationreasoning§ 1. SU(4) Operations · p. 8
The global phase factor does not affect the entangling properties of a two-qubit gate.
“It is clear that the global phase factor just rotates the eigenvalues of m ( U ) along the unit circle in the complex plane, while keeping their relative phase invariant. Therefore, it does not affect the entangling properties and we can consequently divide by det( U ).”
Quote in the paperSubstantial claim - Interpretationnone given§ V. PHYSICAL GENERATION OF NON-LOCAL GATES · p. 14
Generally, the gates that can be generated by a Hamiltonian directly form a one dimensional subset on the 3-Torus geometric representation of non-local gates.
“Generally speaking, these gates form a one dimensional subset on the 3-Torus geometric representation of non-local gates.”
Quote in the paperNot a substantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 12
√SWAP is a perfect entangler.
“picking c 1 = π 4 and c 3 = π 4 , we get the perfect entangler [ √ SWAP].”
Quote in the paperSubstantial claim - Interpretationnone given§ B. Geometric representation of two-qubit gates · p. 9
For a gate [c1,c2,c3] in a+, its inverse is [π/2 - c1, c2, c3].
“Note that for a gate [ c 1 , c 2 , c 3 ] in a + , its inverse is just [ π 2 -c 1 , c 2 , c 3 ].”
Quote in the paperNot a substantial claim - Interpretationreasoning§ B. Geometric representation of two-qubit gates · p. 9
The coordinates [c1,c2,c3] in the Weyl chamber a+ provide an alternative set of local invariants that is entirely equivalent to G1 and G2.
“With this representation in the tetrahedron a + we have removed the multiple-valued nature of the coordinates on the 3-Torus and cube and therefore can now take the coordinates [ c 1 , c 2 , c 3 ] as an alternative set of local invariants. They provide a useful geometric representation of local invariants that is easy to visualize and is entirely equivalent to G 1 and G 2 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The trajectory generated by H2 evolves along OA2A1.
“Hence the trajectory evolves along OA 2 A 1 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ A geometric theory of non-local two-qubit operations · p. 1
Exactly half of all non-local two-qubit operations are perfect entanglers.
“We find that exactly half the non-local gates are perfect entanglers.”
- Also stated in: § I. INTRODUCTION · p. 2 · plain
“This implies that amongst all the non-local two-qubit operations, exactly half of them are capable of generating maximal entanglement.”
Quote in the paperSubstantial claim - Also stated in: § I. INTRODUCTION · p. 2 · plain
- Interpretationreasoning§ (1) Isotropic (Heisenberg) exchange: H 1 = 1 4 ( σ 1 x σ 2 x + σ 1 y σ 2 y + σ 1 z σ 2 z ) · p. 15
The flow generated by H1 evolves along OA3A1, which corresponds to all the local equivalence classes that can be generated by H1.
“Therefore, the flow generated by the isotropic Hamiltonian H 1 evolves along OA 3 A 1 , which corresponds to all the local equivalence classes that can be generated by H 1 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
H2 can generate a set of perfect entanglers that corresponds to the line segments QA2 and A2M in a+.
“It is evident that H 2 can generate a set of perfect entanglers that corresponds to the line segments QA 2 and A 2 M in a + .”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13
Gates represented by points in the set {X ∈ a+ | 2(c1+c3) ≥ 2(c2+c3)+π} are not perfect entanglers.
“From Theorem 2, we obtain that the gates represented by points in the set { X ∈ a + | 2( c 1 + c 3 ) ≥ 2( c 2 + c 3 ) + π } are not perfect entanglers.”
Quote in the paperSubstantial claim - Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The gates generated by H3 are all the ControlledU gates.
“Hence the gates generated by the Hamiltonian H 3 are all the ControlledU gates.”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13
The polyhedron LMNPQA2 is the residual set of perfect entanglers.
“it is thereby evident that the polyhedron LMNPQA 2 is the residual set of perfect entanglers.”
Quote in the paperSubstantial claim - Interpretationnone given§ A. Non-local operations generated by a given Hamiltonian · p. 15
For H = 1/2(c1 σxσx + c2 σyσy + c3 σzσz), the local equivalence classes of U(t) form a continuous flow on the 3-Torus as time evolves.
“Assume H = 1 2 ( c 1 σ 1 x σ 2 x + c 2 σ 1 y σ 2 y + c 3 σ 1 z σ 2 z ). The local equivalence classes of U ( t ) form a continuous flow on the 3-Torus as time evolves.”
Quote in the paperNot a substantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 14
CNOT, located at L, is the only ControlledU gate that is a perfect entangler.
“Hence CNOT, located at L, is the only ControlledU gate that is a perfect entangler.”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 12
CNOT is a perfect entangler.
“picking c 1 = π 2 and c 3 = 0, we obtain the perfect entangler [CNOT]”
Quote in the paperSubstantial claim - Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13
The set of perfect entanglers is obtained by removing the three tetrahedra LQPO, NPA2A3, and LMNA1 from OA1A2A3.
“The set of perfect entanglers can thus be obtained by removing these three tetrahedra from OA 1 A 2 A 3 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ Example 4 (Construction of CNOT from isotropic exchange Hamiltonian) · p. 21
From the constructive proof, together with four appropriate local gates, we can simulate any arbitrary two-qubit gate by turning on a two-body interaction Hamiltonian for at most three times.
“From the above constructive proof, it is clear that together with four appropriate local gates, we can simulate any arbitrary two-qubit gate by turning on a two-body interaction Hamiltonian for at most three times.”
Quote in the paperSubstantial claim - Interpretationreasoning§ VI. CONCLUSION · p. 21
Given a two-body interaction Hamiltonian, it is always possible to explicitly construct a quantum circuit for exact simulation of any arbitrary non-local two-qubit gate by turning on the two-body interaction for at most three times, together with four local gates.
“We proved that given a two-body interaction Hamiltonian, it is always possible to explicitly construct a quantum circuit for exact simulation of any arbitrary non-local two-qubit gate by turning on the two-body interaction for at most three times, together with four local gates.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Example 4 (Construction of CNOT from isotropic exchange Hamiltonian) · p. 21
The way to choose the local gates k0, k1, and k2 is not unique.
“Also note that in the proof, the way to choose the local gates k 0 , k 1 , and k 2 is not unique.”
Quote in the paperNot a substantial claim - Interpretationnone given§ B. Design of universal quantum circuits · p. 17
By applying the Hamiltonian at most three times, together with four appropriate local gates, we can exactly simulate any arbitrary two-qubit gate, i.e., implement any SU(4) operation.
“We will show that by applying the Hamiltonian at most three times, together with four appropriate local gates, we can exactly simulate any arbitrary two-qubit gate, i.e. , we can implement any SU (4) operation.”
Quote in the paperSubstantial claim - Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
The trajectory of U(t) in the Weyl chamber a+ is [c1 t, c2 t, c3 t].
“Therefore, the trajectory of U ( t ) in the Weyl chamber a + is [ c 1 t, c 2 t, c 3 t ].”
Quote in the paperSubstantial claim - Interpretationreasoning§ Example 3 (Josephson junction charge-coupled qubits) · p. 16
The Hamiltonian H_J is not able to generate the perfect entangler [√SWAP].
“Therefore, the Hamiltonian H J is not able to generate the perfect entangler [ √ SWAP].”
Quote in the paperSubstantial claim - Interpretationreasoning§ VI. CONCLUSION · p. 21
Each point inside the tetrahedron corresponds to a different equivalent class of non-local gates.
“Each point inside this tetrahedron corresponds to a different equivalent class of non-local gates.”
Quote in the paperSubstantial claim - Interpretationreasoning§ VI. CONCLUSION · p. 21
By further reducing the symmetry, the geometric representation of non-local gates is a tetrahedron.
“By further reducing the symmetry, the geometric representation of non-local gates was seen to be conveniently visualized as a tetrahedron.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Example 3 (Josephson junction charge-coupled qubits) · p. 16
Since c3=0, the Hamiltonian H_J can reach only those local equivalence classes on the base OA1A2.
“Since c 3 = 0, the Hamiltonian H J can reach only those local equivalence classes on the base OA 1 A 2 , as shown in Figure 4.”
Quote in the paperSubstantial claim - Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15
H and H_a have the same set of eigenvalues.
“Eq. (58) also implies that H and H a have the same set of eigenvalues.”
Quote in the paperSubstantial claim - Premisecitation§ B. Design of universal quantum circuits · p. 18
[CNOT] can be achieved by a circuit consisting of two √SWAP and a local gate.
“[CNOT] can however be achieved by a circuit consisting of two √ SWAP and a local gate [32].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [32] G. Burkard, D. Loss, D. P. DiVincenzo, and J. A. Smolin, Phys. Rev. B 60 , 11404 (1999). source
Not checked in the free run.
- Interpretationown data§ Example 3 (Josephson junction charge-coupled qubits) · p. 17
When the Hamiltonian H contains both the local and non-local part, the velocity of the flow on the 3-Torus is usually time dependent.
“However, when the Hamiltonian H contains both the local and non-local part, the velocity of the flow on the 3-Torus is usually time dependent as shown in the above example.”
Quote in the paperNot a substantial claim - Interpretationnone given§ VI. CONCLUSION · p. 21
The geometric structure of non-local gates is a 3-Torus.
“We first showed that the geometric structure of non-local gates is a 3-Torus.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Example 4 (Construction of CNOT from isotropic exchange Hamiltonian) · p. 20
Given a Hamiltonian H with iH ∈ p, any arbitrary two-qubit gate U ∈ SU(4) can be simulated by the quantum circuit (79) where k_j are local gates.
“Theorem 3 (Universal quantum circuit) Given a Hamiltonian H with iH ∈ p , any arbitrary two-qubit gate U ∈ SU (4) can be simulated by the following quantum circuit”
Quote in the paperSubstantial claim - Interpretationreasoning§ VI. CONCLUSION · p. 21
This guarantees that a highly efficient simulation of non-local gates can be made with any Hamiltonian consisting of arbitrary two-qubit interactions and allowing control of single qubit operations.
“This guarantees that a highly efficient simulation of non-local gates can be made with any Hamiltonian consisting of arbitrary two-qubit interactions and allowing control of single qubit operations.”
Quote in the paperSubstantial claim
- May combine two claims. 22
- Classified as probably not a substantial claim. 3
- The quote only partly states this claim. 2
May combine two claims.
Findingreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 14The volume of the polyhedron LMNPQA2 is π^3/48, which is half of the volume of OA1A2A3.
“Therefore, the volume of the polyhedron LMNPQA 2 is π 3 / 48, which is half of the volume of OA 1 A 2 A 3 .”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ B. Application to su (4) · p. 6The Weyl group W(G,K) is generated by the reflections sα given in Eq. (15), which are equivalent to permutations or permutations with sign flips of two elements of [c1,c2,c3].
“From Proposition 2, the Weyl group W ( G,K ) is generated by s α given in Eq. (15). Therefore, the reflections s α are equivalent to either permutations of the elements of [ c 1 , c 2 , c 3 ], or permutations with sign flips of two elements.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [41] S. Helgason, Differential geometry, Lie groups, and symmetric spaces (Academic, New York, 1978).
Not checked in the free run.
May combine two claims.
Findingreasoning§ (1) Isotropic (Heisenberg) exchange: H 1 = 1 4 ( σ 1 x σ 2 x + σ 1 y σ 2 y + σ 1 z σ 2 z ) · p. 15For H1, for t ∈ [2kπ, 2kπ+π], the trajectory is [t/2,t/2,t/2]; and for t ∈ [2kπ+π, 2(k+1)π], the trajectory is [t/2, π - t/2, π - t/2].
“We obtain that for t ∈ [2 kπ, 2 kπ + π ], the trajectory is [ t 2 , t 2 , t 2 ]; and for t ∈ [2 kπ + π, 2( k +1) π ], the trajectory is [ t 2 , π -t 2 , π -t 2 ].”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ B. Geometric representation of two-qubit gates · p. 9There are 24 Weyl chambers in total, each with volume π^3/24.
“There are 24 such Weyl chambers in total, and each of them has the volume π 3 / 24.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingreasoning§ (1) CNOT · p. 10For the two-qubit gate CNOT, G1=0 and G2=1.
“we obtain G 1 = 0 and G 2 = 1 for the two-qubit gate CNOT.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown data§ (1) CNOT · p. 10For the gate √SWAP, G1=i/4 and G2=0.
“The local invariants for the gate √ SWAP are G 1 = i 4 and G 2 = 0.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingreasoning§ B. Geometric representation of two-qubit gates · p. 9The tetrahedron OA1A2A3 is a Weyl chamber a+, with the basal areas LA2A1 and LA2O identified as equivalent.
“Therefore, with the caveat that the basal areas LA 2 A 1 and LA 2 O are identified as equivalent, we finally arrive at the identification of the tetrahedron OA 1 A 2 A 3 as a Weyl chamber, and we denote this a + .”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ 1. SU(4) Operations · p. 8CNOT and Controlled-Z possess identical local invariants G1=0 and G2=1, and therefore belong to the same local equivalence class [CNOT].
“For example, CNOT and Controlled-Z (referred as C(Z)) possess identical values of the local invariants, given by G 1 = 0 and G 2 = 1. Therefore, they belong to the same local equivalence class. We refer to this class as [CNOT].”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ A. Local invariants and local equivalence classes · p. 7The two-qubit gate U is periodic in c_k with minimum positive period π, so the geometric structure of [c1,c2,c3] is a 3-Torus.
“Because the two-qubit gate U is periodic in c k and the minimum positive period is π , the geometric structure of [ c 1 , c 2 , c 3 ] is a 3-Torus, T 3 = S 1 × S 1 × S 1 .”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ B. Geometric representation of two-qubit gates · p. 8From the relation between local invariants and 3-Torus coordinates, one can compute local invariants from coordinates and find the points on the 3-Torus corresponding to given local invariants.
“From this relation, given a set of coordinates [ c 1 , c 2 , c 3 ], we can easily compute the local invariants for a local equivalence class. Vice versa, from a given pair of values of the local invariants G 1 and G 2 , we can also find the points on the 3-Torus that correspond to a given two-qubit operation.”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ I. INTRODUCTION · p. 2The set of all perfect entanglers is a polyhedron with seven faces and volume exactly half that of the tetrahedron.
“We then show that the set of all perfect entanglers is a polyhedron with seven faces and possessing a volume equal to exactly half that of the tetrahedron.”
Quote in the paperSubstantial claimMay combine two claims.
Findingreasoning§ 1. SU(4) Operations · p. 8√SWAP has local invariants G1=i/4 and G2=0, and belongs to a different local equivalence class [√SWAP].
“On the other hand, the local invariants for √ SWAP are G 1 = i/ 4 and G 2 = 0. Hence this gate belongs to a different local equivalence class that we refer to as [ √ SWAP].”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingreasoning§ 1. SU(4) Operations · p. 8The local equivalence class can alternatively be defined via the set of eigenvalues of the matrix m.
“Note that from Eq. (28), since the local invariants are functions of eigenvalues of the matrix m , the local equivalence class can alternatively be defined simply via the set of eigenvalues of the matrix m .”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ (1) CNOT · p. 10For the gate SWAP, G1=-1 and G2=-3.
“For the gate SWAP, we have G 1 = -1 and G 2 = -3.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown data§ Example 3 (Josephson junction charge-coupled qubits) · p. 17When E_L=1, numerical solution shows that the minimum time solution for the Hamiltonian H_J to achieve [CNOT] is obtained for α=1.1991, and the minimum time is 2.7309.
“When E L = 1, numerical solution of these expressions shows that the minimum time solution for the Hamiltonian H J to achieve [CNOT] is obtained for α = 1 . 1991, and the minimum time is 2 . 7309.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ A geometric theory of non-local two-qubit operations · p. 1Such a quantum circuit provides an efficient implementation of universal quantum computation and simulation.
“and hence it provides an efficient implementation of universal quantum computation and simulation.”
Quote in the paperSubstantial claimMay combine two claims.
Premisecitation§ 1. SU(4) Operations · p. 7The complete set of local invariants of a two-qubit gate U in SU(4) is given by the spectrum of the matrix m, and hence by the eigenvalues of F^2.
“The complete set of local invariants of a two-qubit gate U ∈ SU (4) is given by the spectrum of the matrix m [2], and hence by the eigenvalues of F 2 :”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [2] Y. Makhlin (2000), e-print quant-ph/0002045.
Not checked in the free run.
May combine two claims.
Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 12If [c1,c2,c3] is a perfect entangler, then [π-c1,c2,c3] and [π/2-c1,π/2-c2,π/2-c3] are both perfect entanglers.
“Corollary 1 If [ c 1 , c 2 , c 3 ] is a perfect entangler, then [ π -c 1 , c 2 , c 3 ] and [ π 2 -c 1 , π 2 -c 2 , π 2 -c 3 ] are both perfect entanglers.”
Quote in the paperSubstantial claimThe quote only partly states this claim.
Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 13A two-qubit gate U is a perfect entangler if and only if one of two conditions (Eq. 54) is satisfied, where (i,j,k) is a permutation of (1,2,3).
“Theorem 2 (Perfect entangler on 3-Torus) Consider a two-qubit gate U and its corresponding representation [ c 1 , c 2 , c 3 ] on the 3-Torus. U is a perfect entangler if and only if one of the following two conditions is satisfied:”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationreasoning§ IV. CHARACTERIZATION OF PERFECT ENTANGLERS · p. 14The polyhedron LMNPQA2 is symmetric with respect to the plane c1=π/2, which provides a geometric explanation of Corollary 1.
“Note that the polyhedron LMNPQA 2 is symmetric with respect to the plane c 1 = π/ 2, which provides a geometric explanation of Corollary 1.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationreasoning§ 1. SU(4) Operations · p. 8The local invariants G1 and G2 characterize the non-local properties of unitary operations and can be used to check whether a pair of two-qubit gates are locally equivalent.
“Because the local invariants G 1 and G 2 characterize the non-local properties of unitary operations, we can use these two invariants to check whether a pair of two-qubit gates are locally equivalent.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15If both c1/c2 and c1/c3 are rational, the trajectory generated by H forms a loop on the 3-Torus; if either c1/c2 or c1/c3 is irrational, the trajectory forms a proper dense subset of 3-Torus.
“If both c 1 /c 2 and c 1 /c 3 are rational, the trajectory generated by the Hamiltonian H forms a loop on the 3-Torus. If either c 1 /c 2 or c 1 /c 3 is irrational, the trajectory forms a proper dense subset of 3-Torus.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
Premisenone given§ B. Design of universal quantum circuits · p. 17The local gates form the Lie subgroup SU(2)⊗SU(2), which also contains all the single qubit operations.
“The local gates form the Lie subgroup SU (2) ⊗ SU (2), which also contains all the single qubit operations.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone given§ Example 3 (Josephson junction charge-coupled qubits) · p. 17When the Hamiltonian H contains only the non-local part (iH ∈ p), the flow generated by the Hamiltonian on the 3-Torus has constant velocity.
“Note that when the Hamiltonian H contains only the non-local part, that is, iH ∈ p , the flow generated by the Hamiltonian on the 3-Torus has constant velocity.”
Quote in the paperNot a substantial claimThe quote only partly states this claim.
Interpretationreasoning§ (3) One-dimensional exchange, i.e. , Ising Hamiltonian: H 3 = 1 4 σ 1 y σ 2 y · p. 15For any arbitrary iH ∈ p, there exists a local gate k ∈ SU(2)⊗SU(2) such that Ad_k(iH) = iH_a, where H_a = 1/2(c1 σxσx + c2 σyσy + c3 σzσz).
“Recall that we have p = ∪ k ∈ K Ad k ( a ). Hence for any arbitrary iH ∈ p , there exists a local gate k ∈ SU (2) ⊗ SU (2) such that”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationreasoning§ VI. CONCLUSION · p. 21Exactly half of the non-local two-qubit operations result in maximal entanglement, corresponding to a seven-faced polyhedron with volume equal to one half of the tetrahedron.
“It was found that exactly half of the non-local two-qubit operations result in maximal entanglement, corresponding to a seven-faced polyhedron with volume equal to one half of the tetrahedron.”
Quote in the paperSubstantial claim
The authors state this as an assumption.
We can turn on local operations individually.
“We assume only that we can turn on local operations individually.”
The authors state this as an assumption.
Accessibility of any local gate is assumed.
“if accessibility of any local gate is assumed”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The Heisenberg minimum transfer time expression agrees with the one given in Ref. [11].
“This expression is essentially the same as the one given in Ref. [11].”
From Speed limits for quantum gates in multiqubit systems (2012) · cites this paper as [11]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
A second non-entangler condition also excludes CNOT
MinorAt CNOT's coordinates [π/2, 0, 0], both sides of the stated inequality equal π. Thus this condition classifies a gate the paper calls a perfect entangler as not perfect.
“From Theorem 2, we obtain that the gates represented by points in the set { X ∈ a + | 2( c 1 + c 3 ) ≥ 2( c 2 + c 3 ) + π } are not perfect entanglers.”
“Note that for [ c 1 , π 2 -c 1 , c 3 ], picking c 1 = π 2 and c 3 = 0, we obtain the perfect entangler [CNOT];”
Proposed inverse maps a local gate to CNOT
MinorAt O, the stated inverse-coordinate rule produces [π/2, 0, 0], which the paper identifies as CNOT. But O represents a local gate, whose inverse must also be local.
“Note that for a gate [ c 1 , c 2 , c 3 ] in a + , its inverse is just [ π 2 -c 1 , c 2 , c 3 ].”
“It is clear that the local gates K correspond to the points O and A 1 in Figures 2 (A)-(C).”
A stated non-entangler condition excludes CNOT
MinorCNOT has coordinates [π/2, 0, 0], so c1 + c2 = π/2 and it satisfies the stated ≤ condition. The paper nevertheless identifies CNOT as a perfect entangler.
“If c 1 + c 2 ≤ π 2 , that is, all the e i 2( c j + c k ) are on the upper semi-circle, the gate is not a perfect entangler.”
“Note that for [ c 1 , π 2 -c 1 , c 3 ], picking c 1 = π 2 and c 3 = 0, we obtain the perfect entangler [CNOT];”
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · see citing works
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311 · see citing works
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · see citing works
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · see citing works
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069 · see citing works
Conditional Quantum Dynamics and Logic Gates
Barenco, A., Deutsch, D., EKERT, A. K., & Jozsa, R. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4083 · Cited by 966 · see citing works
Universal quantum computation with the exchange interaction
DiVincenzo, D. P., Bacon, D., Kempe, J., Burkard, G., & Whaley, K. B. (2000) · Nature · doi:10.1038/35042541 · Cited by 924 · see citing works
Self-citationTime optimal control in spin systems
Khaneja, N., Brockett, R. W., & Glaser, S. J. (2001) · Physical Review A · doi:10.1103/physreva.63.032308 · Cited by 755 · see citing works
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690 · see citing works
Josephson-junction qubits with controlled couplings
Makhlin, Y., Scöhn, G., & Shnirman, A. (1999) · Nature · doi:10.1038/18613 · Cited by 669 · see citing works
Theory of decoherence-free fault-tolerant universal quantum computation
Kempe, J., Bacon, D., Lidar, D. A., & Whaley, K. B. (2001) · Physical Review A · doi:10.1103/physreva.63.042307 · Cited by 526 · see citing works
Self-citationRealizable Universal Quantum Logic Gates
Sleator, T., & Weinfurter, H. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4087 · Cited by 515 · see citing works
Optimal creation of entanglement using a two-qubit gate
Kraus, B., & Cirac, J. I. (2001) · Physical Review A · doi:10.1103/physreva.63.062309 · Cited by 432 · see citing works
Entangling power of quantum evolutions
Zanardi, P., Zalka, C., & Faoro, L. (2000) · Physical Review A · doi:10.1103/physreva.62.030301 · Cited by 419 · see citing works
Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces
Bacon, D., Kempe, J., Lidar, D. A., & Whaley, K. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.1758 · Cited by 362 · see citing works
Self-citationUniversality in quantum computation
Deutsch, D. E., Barenco, A., & Ekert, A. (1995) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1995.0065 · Cited by 346 · see citing works
Entanglement of quantum evolutions
Paolo Zanardi, A. (2001) · Physical Review A · doi:10.1103/physreva.63.040304 · Cited by 295 · see citing works
Entangling Operations and Their Implementation Using a Small Amount of Entanglement
Cirac, J. I., Dür, W., Kraus, B., & Lewenstein, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.544 · Cited by 244 · see citing works
Quantum-state control in optical lattices
Deutsch, I., & Jessen, P. (1998) · Physical Review A · doi:10.1103/physreva.57.1972 · Cited by 242 · see citing works
A universal two-bit gate for quantum computation
Barenco, A. (1995) · Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences · doi:10.1098/rspa.1995.0066 · Cited by 217 · see citing works
Computing local invariants of quantum-bit systems
Grassl, M., Rötteler, M., & Beth, T. (1998) · Physical Review A · doi:10.1103/physreva.58.1833 · Cited by 176 · see citing works
Entanglement Capabilities of Nonlocal Hamiltonians
Dür, W., Vidal, G., Cirac, J. I., et al. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.137901 · Cited by 173 · see citing works
Optimal simulation of two-qubit Hamiltonians using general local operations
Bennett, C. H., Cirac, J. I., Leifer, M., Leung, D., Linden, N., Popescu, S., & Vidal, G. (2002) · Physical Review A · doi:10.1103/physreva.66.012305 · Cited by 110 · see citing works
Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling
Lidar, D. A., & Wu, L.-A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.88.017905 · Cited by 110 · see citing works
Physical optimization of quantum error correction circuits
Burkard, G., Loss, D., Divincenzo, D. P., & Smolin, J. A. (1999) · Physical review. B, Condensed matter · doi:10.1103/physrevb.60.11404 · Cited by 106 · see citing works
Storing Quantum Dynamics in Quantum States: A Stochastic Programmable Gate
Vidal, G., Masanes, L., & Cirac, J. I. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.047905 · Cited by 91 · see citing works
Dür, W., & Cirac, J. I. (2001) · Physical Review A · doi:10.1103/physreva.64.012317 · Cited by 64 · see citing works
Exact gate sequences for universal quantum computation using the XY interaction alone
Kempe, J., & Whaley, K. B. (2002) · Physical Review A · doi:10.1103/physreva.65.052330 · Cited by 54 · see citing works
Self-citationClifford algebras and universal sets of quantum gates
Vlasov, A. Y. (2001) · Physical Review A · doi:10.1103/physreva.63.054302 · Cited by 42 · see citing works
Catalysis in Nonlocal Quantum Operations
Vidal, G., & Cirac, J. I. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.167903 · Cited by 30 · see citing works
Encoded universality for generalized anisotropic exchange Hamiltonians
Vala, J., & Whaley, K. B. (2002) · Physical Review A · doi:10.1103/physreva.66.022304 · Cited by 21 · see citing works
Self-citationNoncommutative tori and universal sets of nonbinary quantum gates
Vlasov, A. Y. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1476391 · Cited by 17 · see citing works
Flagged first, then by citations
Research works printed but not linked: 2
- J. Kempe, 2001, Quantum Inf. Comput., 1, 241
- A. Imamoglu, 1999, Phys. Rev. Lett., 83, 4204, 10.1103/PhysRevLett.83.4204 · DOI · Paper page
Cited by
Sorted by citations
Gard, B. T., Zhu, L., Barron, G. S., Mayhall, N. J., Economou, S. E., & Barnes, E. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0240-1 · Cited by 266 · see citing works
Monotonically convergent optimization in quantum control using Krotov’s method
Reich, D. M., Ndong, M., & Koch, C. P. (2012) · The Journal of Chemical Physics · doi:10.1063/1.3691827 · Cited by 220 · see citing works
Time-optimal unitary operations
Carlini, A., Hosoya, A., Koike, T., & Okudaira, Y. (2007) · Physical Review A · doi:10.1103/physreva.75.042308 · Cited by 126 · see citing works
Speed limits for quantum gates in multiqubit systems
Ashhab, S., de Groot, P. C., & Nori, F. (2012) · Physical Review A · doi:10.1103/physreva.85.052327 · Cited by 89 · see citing works
Unitary quantum gates, perfect entanglers, and unistochastic maps
Musz, M., Kuś, M., & Życzkowski, K. (2013) · Physical Review A · doi:10.1103/physreva.87.022111 · Cited by 58 · see citing works
Baldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C., & Hayes, D. (2022) · Quantum · doi:10.22331/q-2022-05-09-707 · Cited by 54 · see citing works
Metric Structure of the Space of Two-Qubit Gates, Perfect Entanglers and Quantum Control
Watts, P., O'Connor, M., & Vala, J. (2013) · Entropy · doi:10.3390/e15061963 · Cited by 31 · see citing works
Self-citationPartial randomized benchmarking
Dubovitskii, K., & Makhlin, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-13813-x · Cited by 1 · see citing works
- Authors
- Zhang, J., Vala, J., Sastry, S., & Whaley, K. B.
- Affiliations
- University of California, Berkeley (US)
- Mathematical Sciences Research Institute (US)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2003-04-18
- Volume
- 67
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2066365197
- Cited by
- 415
- References
- 33
- Citations by year
- 2026: 15 · 2025: 42 · 2024: 23 · 2023: 22 · 2022: 25 · 2021: 22 · 2020: 21 · 2019: 9 · 2018: 14 · 2017: 6 · 2016: 5 · 2015: 10 · 2014: 21 · 2013: 18 · 2012: 12
- FWCI
- 20.87
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- Cartan decomposition, 3-torus, local invariants, Weyl group, maximally entangled states, entanglement generation, quantum circuit simulation, universal quantum computation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-06.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-06.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review