Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.
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
Genetic Algorithms and Machine Learning
Goldberg, D. E., & Holland, J. H. (1988) · Machine Learning · doi:10.1023/a:1022602019183 · Cited by 3,193 · cited 5×
“ting the maximum number of gates to 20, we have found a gatelimited quantum adder consisting of only two CNOTs having an average theoretical fidelity of 90% and a minimum of 79:2%. (see circuit in Eq. (13) and Fig.2b). Although its theoretical fidelity is lower than the one of the basis adder (94:9%), its implementation…”
BackgroundMethodInfluentialOptimal quantum circuits for general two-qubit gates
Vatan, F., & Williams, C. (2004) · Physical Review A · doi:10.1103/physreva.69.032315 · Cited by 443 · cited 3×
“asis quantum adder U in the following manner, Uj000i=j000i; Uj010i=j01+i; Uj100i=j10+i; Uj110i=j001i; (4) Uj001i=j110i; Uj011i=j01 i; Uj101i=j10 i; Uj111i=j111i; such that it can be decomposed as U =P(2;7) U(1;2) CNOT U (2;3) CHad U (1;2) CNOT ; (5) with P(2;7) =U( 1¯ ;2) CNOT U (1 ¯;3) CNOT U 23 1 Toff U (1¯;3) CNOT…”
Background(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49208-9 · Cited by 185
Experimental test of Mermin inequalities on a five-qubit quantum computer
Alsina, D., & Latorre, J. I. (2016) · Physical Review A · doi:10.1103/physreva.94.012314 · Cited by 129
Quantum gate learning in qubit networks: Toffoli gate without time-dependent control
Banchi, L., Pancotti, N., & Bose, S. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.19 · Cited by 74
Learning an unknown transformation via a genetic approach
Spagnolo, N., Maiorino, E., Vitelli, C., Bentivegna, M., Crespi, A., Ramponi, R., Mataloni, P., Osellame, R., & Sciarrino, F. (2017) · Scientific Reports · doi:10.1038/s41598-017-14680-7 · Cited by 40
Cited by
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 2,231
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
A generative modeling approach for benchmarking and training shallow quantum circuits
Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0157-8 · Cited by 379
Structure optimization for parameterized quantum circuits
Ostaszewski, M., Grant, E., & Benedetti, M. (2019) · arXiv · doi:10.48550/arxiv.1905.09692 · Cited by 214
Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits
Pokharel, B., Anand, N., Fortman, B., & Lidar, D. A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.220502 · Cited by 209
Metadata
- Authors
- Li, R., Alvarez-Rodriguez, U., Lamata, L., & Solano, E.
- Venue
- Quantum Measurements and Quantum Metrology
- Publisher
- Portico
- Published
- 2017-07-26
- Volume
- 4
- Issue
- 1
- Pages
- 1-7
- ISSN
- 2299-114X (ISSN-L)
- OpenAlex
- W2556956358
- Cited by
- 52
- References
- 6
- FWCI
- 4.10
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience. https://app.cochat.ai/papers/10.1515/qmetro-2017-0001
- The paper
- Li, R., Alvarez-Rodriguez, U., Lamata, L., & Solano, E. (2017). Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience. Quantum Measurements and Quantum Metrology. https://doi.org/10.1515/qmetro-2017-0001
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.