An analytical decomposition protocol for optimal implementation of two-qubit entangling gates
Open accessAbstract
This paper addresses the question of how to implement a desired two-qubit gate U using a given tunable two-qubit entangling interaction . We present a general method which is based on the K 1 AK 2 decomposition of unitary matrices ∊ SU (4) to calculate the smallest number of two-qubit gates U int ( t ) (based on ) and single-qubit rotations, and the explicit sequence of these operations that are required to implement U . We illustrate our protocol by calculating the implementation of (1) the transformation from standard basis to Bell basis, (2) the CNOT-gate and (3) the quantum Fourier transform for two kinds of interaction—Heisenberg exchange interaction and quantum inductive coupling—and discuss the relevance of our results for solid-state qubits.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
Any two-qubit gate can be obtained from single-qubit rotational gates and at least one entangling gate by using circuit decompositions.
“Any two-qubit gate can be obtained from this minimal set by using circuit decompositions (Barenco et al. , 1995; Blaauboer and De Visser, 2008; de Guise et al. , 2018; Peterson et al. , 2020; Watts et al. , 2013).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Blaauboer and De Visser, 2008
Cited by
Sorted by citations
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 1,726 · see citing works
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475 · see citing works
- Authors
- Blaauboer, M., & de Visser, R. L.
- Affiliations
- Delft University of Technology (NL)
- Venue
- Journal of Physics A: Mathematical and Theoretical
- Publisher
- IOP Publishing
- Published
- 2008-09-05
- Volume
- 41
- Issue
- 39
- Pages
- 395307
- ISSN
- 1751-8113 (ISSN-L)
- 1751-8121
- OpenAlex
- W2096687544
- Cited by
- 20
- References
- 0
- Citations by year
- 2026: 1 · 2024: 3 · 2023: 1 · 2022: 3 · 2021: 3 · 2020: 4 · 2019: 1 · 2017: 1 · 2014: 2
- FWCI
- 0.53
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Journal of Physics A Mathematical and Theoretical (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- Research Repository (Delft University of Technology) (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
- arXiv (Cornell University)
- Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- 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 and electron transport phenomena
- Keywords
- two-qubit entangling gates, unitary matrix decomposition, SU(4), gate decomposition, single-qubit rotations, CNOT gate, quantum Fourier transform, Heisenberg exchange interaction, solid-state qubits, quantum gate implementation
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.
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
