Pith. sign in

REVIEW 4 major objections 4 minor 44 references

Research on quantum compilation of neutral atom quantum computing platform

T0 review · 4 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A quaternion rewrite lets any matrix-decomposed unitary circuit run natively on neutral-atom hardware.

desk verdict The compilation survey is readable, but the quaternion formulas in Eq. 11 do not cover z-rotations, so the central 'any unitary' claim is unsupported as written. read the letter →

arxiv 2501.05266 v1 pith:PJDROJ3L submitted 2025-01-09 quant-ph

Chongyuan Xu This is my paper · ORCID
classification quant-ph PACS 03.67.Lx
keywords quantumcompilationneutralatomcomputingmatrixdecompositionquaternionsynthesisC(θφ)gateShannonGivensrotationexactunitary
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes a quantum compilation method intended to close the gap between generic matrix-decomposition compilers and neutral-atom quantum computers. By rewriting every single-qubit gate as two native C(θ,φ) gates using quaternion multiplication, and by mapping CNOT to CZ and Toffoli to CCZ, the author obtains circuits that run directly on the platform. The claim is that this works for any unitary operation and that the resulting circuits use fewer single-qubit gates than the raw matrix-decomposed output. A sympathetic reader cares because neutral-atom hardware is a leading scalable candidate, but its compilation toolchain has been less mature than those of other leading platforms.

What carries the argument

The load-bearing object is the quaternion representation of rotations: a rotation by angle θ about axis (u,v,w) is written q=[cos(θ/2), sin(θ/2)(u,v,w)], and multiplying quaternions composes rotations. The paper uses this to rewrite the single-qubit gate layer: a unitary is first decomposed into three coordinate-axis rotations (ZY decomposition), the quaternion product gives the equivalent axis-angle rotation, and Eq. (11) then determines the two C(θ,φ) pulses, with θ1=θ2=θ and phases split by Δ. The C(θ,φ) gate is the native neutral-atom single-qubit operation whose angle is set by laser time and whose phase is set by laser phase; the rewrite converts universal-gate-set circuits into directly executable ones.

What would settle it

Take a pure z-rotation such as Rz(α) for α=π/2 and attempt to solve Eq. (11) for real θ and Δ. If no real solution exists, then the claimed synthesis cannot represent that single-qubit unitary, and the 'any unitary' guarantee of the compilation algorithm is false.

Watch

Extended reading notes

Core claim

The paper's central claim is that an arbitrary n-qubit unitary can be exactly compiled into the native gate set of a neutral-atom computer—the single-qubit pulse C(θ,φ), the two-qubit CZ gate, and the three-qubit CCZ gate—by chaining standard matrix-decomposition algorithms with a quaternion-based single-qubit synthesizer. The synthesizer takes the sequence of Z and Y rotations produced by QR or quantum Shannon decomposition, combines consecutive single-qubit operations, and expresses the combined rotation as two C(θ,φ) pulses, computing the laser time and phase parameters from Eq. (11). Since the entanglement gates already map onto CZ and CCZ, the resulting circuit is claimed to be directly executable on neutral-atom hardware while containing fewer single-qubit gates than the pre-adaptation circuit.

Load-bearing premise

The paper assumes every single-qubit unitary can be split into two native C(θ,φ) pulses with equal rotation angles (θ1=θ2=θ) and real solutions to Eq. (11), but it does not prove this covers all rotations, and pure z-rotations appear to have no real solution under this restriction.

Editorial extensions

If this is right

  • Any unitary operation accepted by the matrix-decomposition compiler can be turned into a circuit that runs on neutral-atom hardware without a separate, potentially failing optimization search.
  • Fusing consecutive single-qubit operations before applying the quaternion rewrite reduces the number of single-qubit gates relative to the original compiled circuit.
  • Because the entanglement gates are replaced locally (CNOT to CZ, Toffoli to CCZ), the entanglement-gate count of the matrix-decomposition output is preserved.
  • The method applies to all qubit counts where the underlying QR or QSD decomposition runs, so it gives neutral-atom devices a general exact-compilation path.
  • If the adaptation is integrated into the decomposition software, its added runtime shrinks to nearly that of the decomposition itself.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the equal-angle two-pulse splitting fails to cover rotations such as pure z-rotations, a direct extension—allowing θ1≠θ2 or inserting a third C(θ,φ)—would likely restore universality with only a small gate-count penalty.
  • The same quaternion rewrite is portable: any platform whose native single-qubit gate is a rotation about an axis in the equatorial plane of the Bloch sphere could be adapted by the same formulas.
  • A natural benchmark to test the paper's claim is to publish average single-qubit gate counts before and after adaptation for random unitaries at several qubit numbers; a clear reduction would make the shortening claim reproducible.
  • Exact decomposition is exponential, so the practical reach of this method is limited to modest qubit counts; combining the rewrite with approximate compilation methods would be the natural next step.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes a quantum compilation pipeline for neutral-atom platforms. It reviews matrix-decomposition-based methods (QRD and QSD), then introduces an 'adaptation' step intended to convert the single-qubit gates appearing in standard decomposed circuits into native C(θ,φ) gates using quaternion-based formulas (Eq. 11), and to replace CNOT/Toffoli gates with CZ/CCZ gates. The authors claim that this algorithm can decompose any unitary operation into a circuit directly executable on a neutral-atom platform, and they report circuit-size and time-complexity data from an implementation built on pyQPanda, with code posted on GitHub.

Significance. If the proposed adaptation were correct, it would give a practically useful bridge between generic circuit decompositions and neutral-atom native gates, and the paper is honest about the exponential overhead inherent in exact unitary decomposition. The accompanying software artifact is a positive feature. However, the central mathematical claim—that every single-qubit gate can be synthesized in the particular two-gate form with the formulas provided—is not established, and the equations as written fail for an essential class of rotations. Since the abstract and Section V.A explicitly promise decomposition of 'any unitary operation,' this is a load-bearing defect. The paper also lacks numerical verification that the adapted circuits actually implement the target unitaries.

major comments (4)
  1. [Section III.D, Eq. (11)] The synthesis formulas in Eq. (11) do not cover pure z-axis rotations. For a target rotation Rz(α), the polar angle is β=0, so the first line becomes 1 = (1/2)(cos(α/2)+1) sin²θ. Since sin²θ ≤ 1 and cos(α/2) < 1 for any nonzero α, the right-hand side is strictly less than 1, so no real θ solves the equation. The second line also has a zero denominator when β=0. Thus the formulas cannot produce z-rotations, which are required for a universal single-qubit gate set. No derivation of Eq. (11) is given, and no singular-case treatment or surjectivity proof is supplied. This directly contradicts the paper's central claim in the abstract and Section V.A that the method decomposes any unitary operation.
  2. [Section III.D, Eq. (8)] The paper states 'We can decompose any single quantum bit operation into the following form: U = C(θ2,φ2)C(θ1,φ1)' and then imposes the equal-angle restriction θ1=θ2=θ. The cited reference [33] does not obviously justify this restricted form, and no proof is given that the three-parameter family {C(θ,φ2)C(θ,φ1)} covers all of SU(2). The parameter count matches the dimension of SU(2), but surjectivity is not automatic; the failure of Eq. (11) for z-rotations shows that the restricted map requires careful analysis. The authors need to either prove surjectivity or provide corrected formulas that handle all cases, including the θ=π branch that can represent z-rotations.
  3. [Section III.D, controlled-gate conversion] The sentence 'Now we only need to replace CNOT in Barenco configuration with CZ, and Toffoli gate with CCZ' is not correct as a direct substitution: CNOT = (I⊗H) CZ (I⊗H), so replacing CNOT by CZ without adding Hadamard gates changes the unitary. The subsequent paragraph mentions Hadamard gates 'generated by replacement,' but the exact conversion rule is never stated precisely. Since the correctness of the whole pipeline depends on these circuit equivalences, this point must be made rigorous.
  4. [Section IV.B, adaptation effect] The paper reports the time complexity of the adaptation algorithm and shows examples of circuit transformations, but it never quantitatively verifies that the adapted circuit implements the same unitary as the original circuit. No fidelity check, unitary-distance comparison, or even a count of the resulting native gates is given. Without such validation, the claim that the generated circuits 'can run directly on the platform' to execute the intended operation is unsupported.
minor comments (4)
  1. [Section IV.B] There are several typos: 'randomly genrated' should be 'randomly generated', 'wto parameters' should be 'two parameters', and 'withCCZ' should be 'with CCZ'.
  2. [Section III.D, Eq. (11)] The variables α, β, and Δ in Eq. (11) are not defined in the text before the equation appears. The reader is forced to infer that α is the rotation angle of the target gate and (cos φ sin β, sin φ sin β, cos β) is the unit axis, but these definitions should be stated explicitly.
  3. [Section IV.A] The sentence 'the lower bound of the number of CNOT gates contained in the quantum circuit implemented by any quantum compilation algorithm is 1/4(4^n − 3^n − 1)' is imprecise: that lower bound refers to the minimum number of CNOT gates needed to realize an arbitrary n-qubit unitary, not to the output of any particular algorithm. The wording should be corrected.
  4. [Figure 9(a)] The figure legend mentions 'the number of single quantum bit gates generated by QPanda' but the main plot appears to show CNOT counts; the axes and legend need to be clarified.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the neutral-atom adaptation step solves gate parameters from the target unitary rather than fitting or renaming its inputs, and all load-bearing citations are external prior work.

full rationale

The paper's central adaptation (Section III.D) is a constructive synthesis: given a single-qubit unitary U from the QSD/QRD output, it sets U = C(θ2, φ2)C(θ1, φ1) (Eq. 8, citing ref. 33) and solves for (θ, φ1, φ2) via quaternion multiplication, with the listed equations in Eq. 11 providing the parameters. This is not circular because the target U is the input and the two C(θ, φ) gates are the output; no quantity used later as a prediction is fitted from the outputs, and the paper's claims are not defined in terms of its conclusions. The load-bearing references (Barenco et al. for the CNOT universal construction, Shende/Markov for lower bounds and optimal two-qubit circuits, Martinez et al. for the two-C-gate decomposition, and pyQPanda for the base decomposition) are external prior results rather than self-citations; there is no uniqueness theorem imported from the present author, and no ansatz is disguised as a citation. The apparent inability of the printed Eq. 11 to synthesize pure z-rotations (β=0) is a correctness/surjectivity gap in the derivation, not a circular reduction of the output to the input. The paper therefore exhibits no self-definitional, fitted-input, self-citation, or renaming circularity.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central claim rests on the universality of the two-gate single-qubit decomposition and on the Barenco/QSD/QRD framework. The paper adds no new physical entities or fitted parameters; the only ad hoc choice is the equal-angle restriction in the quaternion synthesis, which is not justified.

free parameters (1)
  • Equal-angle constraint θ1=θ2=θ = θ (and derived Δ, φ)
    The synthesis assumes both C(θ,φ) gates use the same parameter θ. This is a choice not forced by the target, and it restricts the set of representable single-qubit rotations. No proof is given that this restriction still covers all unitaries, and it appears to fail for rotations about the z-axis.
assumptions (4)
  • domain assumption Any single-qubit unitary can be written as U = C(θ2, φ2) C(θ1, φ1) (ref 33).
    Used as the starting point for the quaternion synthesis in Section III.D. The paper does not derive this, but cites ref 33.
  • standard math The Barenco et al. construction (ref 34) provides exact decompositions of general multi-qubit unitaries into single-qubit gates and CNOT gates.
    This underpins the QRD/QSD algorithms the adaptation builds on, as stated in Sections III.B and III.C.
  • domain assumption CNOT can be replaced by CZ with Hadamard conjugations, and Toffoli by CCZ, in the neutral atom gate set.
    Used in Section III.D to adapt entangling gates. The paper states this is 'relatively simple' but does not specify the full transformation including the Hadamard gates.
  • standard math The quaternion representation of rotations gives a faithful and unambiguous mapping from rotation gates to quaternion products.
    Used in the synthesis derivation; standard mathematical background.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Research on quantum compilation of neutral atom quantum computing platform." pith.science (2026). https://pith.science/paper/PJDROJ3L

@misc{pith2026250105266,
  author       = {Pith},
  title        = {Pith review of: Research on quantum compilation of neutral atom quantum computing platform},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PJDROJ3L}},
  note         = {Machine review of arXiv:2501.05266}
}
read the original abstract

Quantum compilation is the process of decomposing high-level quantum algorithms or arbitrary unitary operations into quantum circuits composed of a specific set of quantum gates. Neutral atom quantum computing platform is a quantum computing implementation method with high controllability and scalability, but its quantum compilation method is not mature. We systematically review the quantum compilation methods based on matrix decomposition, and propose a compilation algorithm suitable for neutral atom quantum computing, which can effectively decompose any unitary operation into a series of quantum gates suitable for the neutral atom platform, and ensure that the generated quantum circuits can run directly on the platform.

Figures

Figures reproduced from arXiv: 2501.05266 by the authors.

Figure 1
Figure 1. FIG. 1. The implementation process of neutral atom quantum com [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. Some concepts related to quantum computation. Figure (a): [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Barenco configuration. Figure (a): The implementation of [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: FIG. 4. The process of implementing a unitary operation decom [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5. The implementation process of QRD algorithm. Figure (a): [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]
Figure 6
Figure 6. Figure 6: FIG. 6. The process of implementing a unitary operation decom [PITH_FULL_IMAGE:figures/full_fig_p006_6.png]
Figure 7
Figure 7. Figure 7: FIG. 7. The implementation process of QSD algorithm. Figure (a): [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]
Figure 8
Figure 8. Figure 8: FIG. 8. The adaptation of quantum computation in neutral atom [PITH_FULL_IMAGE:figures/full_fig_p007_8.png]
Figure 9
Figure 9. Figure 9: FIG. 9. Quantum compilation based on matrix decomposition. Figure (a): The number of [PITH_FULL_IMAGE:figures/full_fig_p009_9.png]
Figure 10
Figure 10. Figure 10: FIG. 10. The effect of quantum compilation algorithm for neutral atom quantum computing platform based on quaternion method. Figure (a): [PITH_FULL_IMAGE:figures/full_fig_p009_10.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

44 extracted references · 34 canonical work pages

  1. [33]

    author author A. Y. \ Kitaev , author A. Shen , \ and\ author M. N. \ Vyalyi ,\ @noop title Classical and quantum computation ,\ number 47 \ ( publisher American Mathematical Soc. ,\ year 2002 ) NoStop

    work page 2002

  2. [1]

    merlin.mbs aapmrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs aapmrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translat...

    2010

  3. [2]

    merlin.mbs aipauth4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs aipauth4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translat...

    2010

  4. [3]

    merlin.mbs aipnum4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs aipnum4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translati...

    2010

  5. [4]

    Aspuru-Guzik \ and\ author P

    author author A. Aspuru-Guzik \ and\ author P. Walther ,\ title title Photonic quantum simulators , \ @noop journal journal Nature physics \ volume 8 ,\ pages 285--291 ( year 2012 ) NoStop

    work page 2012

  6. [5]

    author author I. M. \ Georgescu , author S. Ashhab , \ and\ author F. Nori ,\ title title Quantum simulation , \ @noop journal journal Reviews of Modern Physics \ volume 86 ,\ pages 153 ( year 2014 ) NoStop

    work page 2014

  7. [6]

    author author P. W. \ Shor ,\ title title Algorithms for quantum computation: discrete logarithms and factoring , \ in\ @noop booktitle Proceedings 35th annual symposium on foundations of computer science \ ( organization Ieee ,\ year 1994 )\ pp.\ pages 124--134 NoStop

    work page 1994

  8. [7]

    author author L. K. \ Grover ,\ title title A fast quantum mechanical algorithm for database search , \ in\ @noop booktitle Proceedings of the twenty-eighth annual ACM symposium on Theory of computing \ ( year 1996 )\ pp.\ pages 212--219 NoStop

    work page 1996

Show all 44 references
  1. [8]

    Clarke \ and\ author F

    author author J. Clarke \ and\ author F. K. \ Wilhelm ,\ title title Superconducting quantum bits , \ @noop journal journal Nature \ volume 453 ,\ pages 1031--1042 ( year 2008 ) NoStop

    2008

  2. [9]

    author author M. H. \ Devoret \ and\ author R. J. \ Schoelkopf ,\ title title Superconducting circuits for quantum information: an outlook , \ @noop journal journal Science \ volume 339 ,\ pages 1169--1174 ( year 2013 ) NoStop

    2013

  3. [10]

    Leibfried , author R

    author author D. Leibfried , author R. Blatt , author C. Monroe , \ and\ author D. Wineland ,\ title title Quantum dynamics of single trapped ions , \ @noop journal journal Reviews of Modern Physics \ volume 75 ,\ pages 281 ( year 2003 ) NoStop

    2003

  4. [11]

    Monroe \ and\ author J

    author author C. Monroe \ and\ author J. Kim ,\ title title Scaling the ion trap quantum processor , \ @noop journal journal Science \ volume 339 ,\ pages 1164--1169 ( year 2013 ) NoStop

    2013

  5. [12]

    Brubaker ,\ title title Versatile neutral atoms emerge as an intriguing quantum computing platform , \ @noop journal journal empty \ ( year 2022 ) NoStop

    author author B. Brubaker ,\ title title Versatile neutral atoms emerge as an intriguing quantum computing platform , \ @noop journal journal empty \ ( year 2022 ) NoStop

    2022

  6. [13]

    Moses , author C

    author author S. Moses , author C. Baldwin , author M. Allman , author R. Ancona , author L. Ascarrunz , author C. Barnes , author J. Bartolotta , author B. Bjork , author P. Blanchard , author M. Bohn , et al. ,\ title title A race track trapped-ion quantum processor , \ @noo...

    2023 arXiv

  7. [14]

    Graham , author Y

    author author T. Graham , author Y. Song , author J. Scott , author C. Poole , author L. Phuttitarn , author K. Jooya , author P. Eichler , author X. Jiang , author A. Marra , author B. Grinkemeyer , et al. ,\ title title Multi-qubit entanglement and algorithms on a neutral-at...

    2022

  8. [15]

    author author H. J. \ Metcalf \ and\ author P. Van der Straten ,\ @noop title Laser cooling and trapping \ ( publisher Springer Science & Business Media ,\ year 1999 ) NoStop

    1999

  9. [16]

    Chu ,\ title title Nobel lecture: The manipulation of neutral particles , \ @noop journal journal Reviews of Modern Physics \ volume 70 ,\ pages 685 ( year 1998 ) NoStop

    author author S. Chu ,\ title title Nobel lecture: The manipulation of neutral particles , \ @noop journal journal Reviews of Modern Physics \ volume 70 ,\ pages 685 ( year 1998 ) NoStop

    1998

  10. [17]

    Endres , author H

    author author M. Endres , author H. Bernien , author A. Keesling , author H. Levine , author E. R. \ Anschuetz , author A. Krajenbrink , author C. Senko , author V. Vuletic , author M. Greiner , \ and\ author M. D. \ Lukin ,\ title title Atom-by-atom assembly of defect-free on...

    2016

  11. [18]

    \ Wang , author C

    author author Z.-B. \ Wang , author C. Gu , author X.-X. \ Hu , author Y.-T. \ Zhang , author J.-Z. \ Zhang , author G. Li , author X.-D. \ He , author X.-B. \ Zou , author C.-H. \ Dong , author G.-C. \ Guo , et al. ,\ title title Controllable atomic collision in a tight optic...

    2023

  12. [19]

    author author C. N. \ Cohen-Tannoudji ,\ title title Nobel lecture: Manipulating atoms with photons , \ @noop journal journal Reviews of Modern Physics \ volume 70 ,\ pages 707 ( year 1998 ) NoStop

    1998

  13. [20]

    Kuhr , author W

    author author S. Kuhr , author W. Alt , author D. Schrader , author I. Dotsenko , author Y. Miroshnychenko , author A. Rauschenbeutel , \ and\ author D. Meschede ,\ title title Analysis of dephasing mechanisms in a standing-wave dipole trap , \ @noop journal journal Physical R...

    2005

  14. [21]

    Yavuz , author P

    author author D. Yavuz , author P. Kulatunga , author E. Urban , author T. A. \ Johnson , author N. Proite , author T. Henage , author T. Walker , \ and\ author M. Saffman ,\ title title Fast ground state manipulation of neutral atoms in microscopic optical traps , \ @noop jou...

    2006

  15. [22]

    Jaksch , author H.-J

    author author D. Jaksch , author H.-J. \ Briegel , author J. Cirac , author C. Gardiner , \ and\ author P. Zoller ,\ title title Entanglement of atoms via cold controlled collisions , \ @noop journal journal Physical Review Letters \ volume 82 ,\ pages 1975 ( year 1999 ) NoStop

    1975

  16. [23]

    author author T. G. \ Walker \ and\ author M. Saffman ,\ title title Entanglement of two atoms using rydberg blockade , \ in\ @noop booktitle Advances in Atomic, Molecular, and Optical Physics ,\ Vol. volume 61 \ ( publisher Elsevier ,\ year 2012 )\ pp.\ pages 81--115 NoStop

    2012

  17. [24]

    Jaksch , author J

    author author D. Jaksch , author J. I. \ Cirac , author P. Zoller , author S. L. \ Rolston , author R. C \^o t \'e , \ and\ author M. D. \ Lukin ,\ title title Fast quantum gates for neutral atoms , \ @noop journal journal Physical Review Letters \ volume 85 ,\ pages 2208 ( ye...

    2000

  18. [25]

    Petrosyan , author F

    author author D. Petrosyan , author F. Motzoi , author M. Saffman , \ and\ author K. M lmer ,\ title title High-fidelity rydberg quantum gate via a two-atom dark state , \ @noop journal journal Physical Review A \ volume 96 ,\ pages 042306 ( year 2017 ) NoStop

    2017

  19. [26]

    Wang , author A

    author author Y. Wang , author A. Kumar , author T.-Y. \ Wu , \ and\ author D. S. \ Weiss ,\ title title Single-qubit gates based on targeted phase shifts in a 3d neutral atom array , \ @noop journal journal Science \ volume 352 ,\ pages 1562--1565 ( year 2016 ) NoStop

    2016

  20. [27]

    author author S. J. \ Evered , author D. Bluvstein , author M. Kalinowski , author S. Ebadi , author T. Manovitz , author H. Zhou , author S. H. \ Li , author A. A. \ Geim , author T. T. \ Wang , author N. Maskara , et al. ,\ title title High-fidelity parallel entangling gates...

    2023 arXiv

  21. [28]

    author author W. S. \ Bakr , author J. I. \ Gillen , author A. Peng , author S. F \"o lling , \ and\ author M. Greiner ,\ title title A quantum gas microscope for detecting single atoms in a hubbard-regime optical lattice , \ @noop journal journal Nature \ volume 462 ,\ pages ...

    2009

  22. [29]

    Kwon , author M

    author author M. Kwon , author M. F. \ Ebert , author T. G. \ Walker , \ and\ author M. Saffman ,\ title title Parallel low-loss measurement of multiple atomic qubits , \ @noop journal journal Physical review letters \ volume 119 ,\ pages 180504 ( year 2017 ) NoStop

    2017

  23. [30]

    Matthews ,\ title title How to get started in quantum computing , \ @noop journal journal Nature \ volume 591 ,\ pages 166--167 ( year 2021 ) NoStop

    author author D. Matthews ,\ title title How to get started in quantum computing , \ @noop journal journal Nature \ volume 591 ,\ pages 166--167 ( year 2021 ) NoStop

    2021

  24. [31]

    Bravyi \ and\ author D

    author author S. Bravyi \ and\ author D. Gosset ,\ title title Improved classical simulation of quantum circuits dominated by clifford gates , \ @noop journal journal Physical review letters \ volume 116 ,\ pages 250501 ( year 2016 ) NoStop

    2016

  25. [32]

    author author A. M. \ Krol , author A. Sarkar , author I. Ashraf , author Z. Al-Ars , \ and\ author K. Bertels ,\ title title Efficient decomposition of unitary matrices in quantum circuit compilers , \ @noop journal journal Applied Sciences \ volume 12 ,\ pages 759 ( year 202...

    2022

  26. [34]

    Hattori \ and\ author S

    author author W. Hattori \ and\ author S. Yamashita ,\ title title Quantum circuit optimization by changing the gate order for 2d nearest neighbor architectures , \ in\ @noop booktitle Reversible Computation: 10th International Conference, RC 2018, Leicester, UK, September 12-...

    2018

  27. [35]

    Moro , author M

    author author L. Moro , author M. G. \ Paris , author M. Restelli , \ and\ author E. Prati ,\ title title Quantum compiling by deep reinforcement learning , \ @noop journal journal Communications Physics \ volume 4 ,\ pages 178 ( year 2021 ) NoStop

    2021

  28. [36]

    author author E. A. \ Martinez , author T. Monz , author D. Nigg , author P. Schindler , \ and\ author R. Blatt ,\ title title Compiling quantum algorithms for architectures with multi-qubit gates , \ @noop journal journal New Journal of Physics \ volume 18 ,\ pages 063029 ( y...

    2016

  29. [37]

    Barenco , author C

    author author A. Barenco , author C. H. \ Bennett , author R. Cleve , author D. P. \ DiVincenzo , author N. Margolus , author P. Shor , author T. Sleator , author J. A. \ Smolin , \ and\ author H. Weinfurter ,\ title title Elementary gates for quantum computation , \ @noop jou...

    1995

  30. [38]

    author author V. V. \ Shende , author I. L. \ Markov , \ and\ author S. S. \ Bullock ,\ title title Minimal universal two-qubit cnot-based circuits , \ @noop journal journal arXiv preprint quant-ph/0308033 \ ( year 2003 ) NoStop

    2003 arXiv

  31. [39]

    author author J. J. \ Vartiainen , author M. M \"o tt \"o nen , \ and\ author M. M. \ Salomaa ,\ title title Efficient decomposition of quantum gates , \ @noop journal journal Physical review letters \ volume 92 ,\ pages 177902 ( year 2004 ) NoStop

    2004

  32. [40]

    author author V. V. \ Shende , author S. S. \ Bullock , \ and\ author I. L. \ Markov ,\ title title Synthesis of quantum logic circuits , \ in\ @noop booktitle Proceedings of the 2005 Asia and South Pacific Design Automation Conference \ ( year 2005 )\ pp.\ pages 272--275 NoStop

    2005

  33. [41]

    Xue \ and\ author Y.-F

    author author P. Xue \ and\ author Y.-F. \ Xiao ,\ title title Universal quantum computation in decoherence-free subspace with neutral atoms , \ @noop journal journal Physical review letters \ volume 97 ,\ pages 140501 ( year 2006 ) NoStop

    2006

  34. [42]

    Dou , author T

    author author M. Dou , author T. Zou , author Y. Fang , author J. Wang , author D. Zhao , author L. Yu , author B. Chen , author W. Guo , author Y. Li , author Z. Chen , et al. ,\ title title Qpanda: high-performance quantum computing framework for multiple application scenari...

    2022 arXiv

  35. [43]

    merlin.mbs apsrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs apsrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number orga...

    2010

  36. [44]

    merlin.mbs apsrmp4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs apsrmp4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number orga...

    2010

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.