Minimally complex ion traps as modules for quantum communication and computing
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Optically linked ion traps are promising as components of network-based quantum technologies, including communication systems and modular computers. Experimental results achieved to date indicate that the fidelity of operations within each ion trap module will be far higher than the fidelity of operations involving the links; fortunately internal storage and processing can effectively upgrade the links through the process of purification. Here we perform the most detailed analysis to date on this purification task, using a protocol which is balanced to maximise fidelity while minimising the device complexity and the time cost of the process. Moreover we ‘compile down’ the quantum circuit to device-level operations including cooling and shuttling events. We find that a linear trap with only five ions (two of one species, three of another) can support our protocol while incorporating desirable features such as global control , i.e. laser control pulses need only target an entire zone rather than differentiating one ion from its neighbour. To evaluate the capabilities of such a module we consider its use both as a universal communications node for quantum key distribution, and as the basic repeating unit of a quantum computer. For the latter case we evaluate the threshold for fault tolerant quantum computing using the surface code, finding acceptable fidelities for the ‘raw’ entangling link as low as 83% (or under 75% if an additional ion is available).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“The thresholds are calculated using Monte-Carlo simulations [26].”
MethodUniversal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Britton, J. W., Sawyer, B. C., Keith, A. C., Wang, C.-C. J., Freericks, J. K., Uys, H., Biercuk, M. J., & Bollinger, J. J. (2012) · Nature · doi:10.1038/nature10981 · Cited by 941
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777
Self-citationLarge-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
(2016) · doi:10.1103/physrevlett.117.060505 · Cited by 540
Realization of a scalable Shor algorithm
Monz, T., Nigg, D., Martinez, E. A., Brandl, M. F., Schindler, P., Rines, R., Wang, S. X., Chuang, I. L., & Blatt, R. (2016) · Science · doi:10.1126/science.aad9480 · Cited by 486
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Cited by
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
High-Rate, High-Fidelity Entanglement of Qubits Across an Elementary Quantum Network
Stephenson, L. J., Nadlinger, D. P., Nichol, B. C., An, S., Drmota, P., Ballance, T. G., Thirumalai, K., Goodwin, J. F., Lucas, D. M., & Ballance, C. J. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.110501 · Cited by 291
“At these higher rates and fidelities, distillation procedures based on photonic entanglement [24] start to become a viable method for creating high quality entanglement across a scalable trapped-ion quantum computer.”
MethodSelf-citationShuttling-based trapped-ion quantum information processing
Kaushal, V., Lekitsch, B., Stahl, A., Hilder, J., Pijn, D., Schmiegelow, C., Bermudez, A., Müller, M., Schmidt-Kaler, F., & Poschinger, U. (2020) · AVS Quantum Science · doi:10.1116/1.5126186 · Cited by 141
A high-fidelity quantum matter-link between ion-trap microchip modules
Akhtar, M., Bonus, F., Lebrun-Gallagher, F. R., Johnson, N. I., Siegele-Brown, M., Hong, S., Hile, S. J., Kulmiya, S. A., Weidt, S., & Hensinger, W. K. (2023) · Nature Communications · doi:10.1038/s41467-022-35285-3 · Cited by 59
How to Wire a 1000 -Qubit Trapped-Ion Quantum Computer
Malinowski, M., Allcock, D. T. C., & Ballance, C. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040313 · Cited by 54
Self-citation
Metadata
- Authors
- Nigmatullin, R., Ballance, C. J., Beaudrap, N. D., & Benjamin, S. C.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2016-10-19
- Volume
- 18
- Issue
- 10
- Pages
- 103028
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2441481023
- Cited by
- 52
- References
- 14
- FWCI
- 3.60
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Minimally complex ion traps as modules for quantum communication and computing. https://app.cochat.ai/papers/10.1088/1367-2630/18/10/103028
- The paper
- Nigmatullin, R., Ballance, C. J., Beaudrap, N. D., & Benjamin, S. C. (2016). Minimally complex ion traps as modules for quantum communication and computing. New Journal of Physics. https://doi.org/10.1088/1367-2630/18/10/103028
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.