The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Non-Abelian Berry connections for quantum computation
Open accessAbstract
In the holonomic approach to quantum computation, information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-Abelian Berry connection and are obtained by driving the control parameters along adiabatic loops. We show how it is possible for a specific model to explicitly determine the loops generating any desired logical gate, thus producing a universal set of unitary transformations. In a multipartite system unitary transformations can be implemented efficiently by sequences of local holonomic gates. Moreover, a conceptual scheme for obtaining the required Hamiltonian family, based on frequently repeated pulses, is discussed, together with a possible process whereby the initial state can be prepared and the final one can be measured.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
In the citing paper
“Davies did not consider time-dependent system Hamiltonians in [43], but it is possible to generalize his derivation to allow for slowly varying system Hamiltonians [37, 44, 45]. That is, whenever the time scale of the variation of H C ( t ) is much longer than the inverse of the typical Bohr frequency (of H S ), it is possible to add H C ( t ) to the system Hamiltonian in Eq. (23), necessitating a”
From Internal consistency of fault-tolerant quantum error correction in light of rigorous derivations of the quantum Markovian limit (2006) · cites this paper as [44]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808
Appearance of Gauge Structure in Simple Dynamical Systems
Wilczek, F., & Zee, A. (1984) · Physical Review Letters · doi:10.1103/physrevlett.52.2111 · Cited by 1,775
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Geometry, Topology and Physics
Nakahara, M. (1990) · doi:10.1887/0750306068 · Cited by 1,620
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
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
Introduction to Quantum Computation and Information
Lo, H.-K., Spiller, T. P., & Popescu, S. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812385253 · Cited by 488
Universality 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
Zanardi, P. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00365-5 · Cited by 319
Research works printed but not linked: 2
- T.T. Wu, 1975, Phys. Rev. D, 12, 3845
- R. Jackiw, 1984, Relativity Groups and Topology, Les Houches 1983
Cited by
Sorted by citations
Geometric Manipulation of Trapped Ions for Quantum Computation
Duan, L.-M., Cirac, J. I., & Zoller, P. (2001) · Science · doi:10.1126/science.1058835 · Cited by 793
Topology by dissipation in atomic quantum wires
Diehl, S., Rico, E., Baranov, M. A., & Zoller, P. (2011) · Nature Physics · doi:10.1038/nphys2106 · Cited by 541
Experimental realization of universal geometric quantum gates with solid-state spins
Zu, C., Wang, W.-B., He, L., Zhang, W.-G., Dai, C.-Y., Wang, F., & Duan, L.-M. (2014) · Nature · doi:10.1038/nature13729 · Cited by 352
Engineered Open Systems and Quantum Simulations with Atoms and Ions
Müller, M., Diehl, S., Pupillo, G., & Zoller, P. (2012) · Advances in atomic, molecular, and optical physics · doi:10.1016/b978-0-12-396482-3.00001-6 · Cited by 337
Zanardi, P. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.077901 · Cited by 328
Metadata
- Authors
- Pachos, J., Zanardi, P., & Rasetti, M.
- Affiliations
- Institute for Scientific Interchange (IT)
- ORCID
- Pachos, Jiannis
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1999-12-13
- Volume
- 61
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1965228711
- Cited by
- 316
- References
- 9
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 12 · 2023: 15 · 2022: 21 · 2021: 19 · 2020: 13 · 2019: 12 · 2018: 7 · 2017: 4 · 2016: 10 · 2015: 4 · 2014: 8 · 2013: 6 · 2012: 8
- FWCI
- 12.79
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (acceptedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- PORTO@Iris (submittedVersion)
- PORTO Publications Open Repository TOrino (Politecnico di Torino) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- holonomic quantum computation, universal gate set, multipartite systems, state preparation and measurement
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
