Saved in:
Bibliographic Details
Main Authors: Ikeda, Tatsuhiko N., Nakama, Riku, Saeki, Shunsuke, Kuwata, Hiroki, Yoshida, Shuhei M., Shimizu, Akira, Sugiura, Sho
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2512.17779
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909971169411072
author Ikeda, Tatsuhiko N.
Nakama, Riku
Saeki, Shunsuke
Kuwata, Hiroki
Yoshida, Shuhei M.
Shimizu, Akira
Sugiura, Sho
author_facet Ikeda, Tatsuhiko N.
Nakama, Riku
Saeki, Shunsuke
Kuwata, Hiroki
Yoshida, Shuhei M.
Shimizu, Akira
Sugiura, Sho
contents Quantum computers are believed to solve a class of computational problems that are based on modular arithmetic faster than classical computers. Among the arithmetic building blocks, comparison of integer pairs is a primitive. Here we report its demonstration in the Reimei quantum computer at RIKEN, whose trapped-ion architecture provides all-to-all qubit connectivity together with high gate fidelities. We observe high success probabilities for bit widths n = 3, 5, 7, and 9: Under a conventional output-only success criterion we obtain 95% at n=9; under a stricter criterion additionally requiring the ancilla to be correct, the success is 69% at n=9. These results demonstrate reliable quantum comparison at scales far beyond those previously achieved experimentally, not only for comparators but also in the broader context of quantum arithmetic circuits.
format Preprint
id arxiv_https___arxiv_org_abs_2512_17779
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Demonstration of a quantum comparator on an ion-trap quantum device
Ikeda, Tatsuhiko N.
Nakama, Riku
Saeki, Shunsuke
Kuwata, Hiroki
Yoshida, Shuhei M.
Shimizu, Akira
Sugiura, Sho
Quantum Physics
Quantum computers are believed to solve a class of computational problems that are based on modular arithmetic faster than classical computers. Among the arithmetic building blocks, comparison of integer pairs is a primitive. Here we report its demonstration in the Reimei quantum computer at RIKEN, whose trapped-ion architecture provides all-to-all qubit connectivity together with high gate fidelities. We observe high success probabilities for bit widths n = 3, 5, 7, and 9: Under a conventional output-only success criterion we obtain 95% at n=9; under a stricter criterion additionally requiring the ancilla to be correct, the success is 69% at n=9. These results demonstrate reliable quantum comparison at scales far beyond those previously achieved experimentally, not only for comparators but also in the broader context of quantum arithmetic circuits.
title Demonstration of a quantum comparator on an ion-trap quantum device
topic Quantum Physics
url https://arxiv.org/abs/2512.17779