dorsal/arxiv
View SchemaCarmichael Numbers on a Quantum Computer
| Authors | A. Carlini, A. Hosoya |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9908022 |
| URL | https://arxiv.org/abs/quant-ph/9908022 |
Abstract
We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by Pomerance, Selfridge and Wagstaff concerning the asymptotic distribution of Carmichael numbers smaller than a given integer.
{
"annotation_id": "636e2209-90cc-4896-9911-ff64a743ea35",
"date_created": "2026-03-02T18:02:48.470000Z",
"date_modified": "2026-03-02T18:02:48.470000Z",
"file_hash": "d324c8399840fc57c57de7394c4b26fcbdfa0e5698005f38d8d3ee06abf63f0c",
"private": false,
"record": {
"abstract": "We present a quantum probabilistic algorithm which tests with a polynomial\ncomputational complexity whether a given composite number is of the Carmichael\ntype. We also suggest a quantum algorithm which could verify a conjecture by\nPomerance, Selfridge and Wagstaff concerning the asymptotic distribution of\nCarmichael numbers smaller than a given integer.",
"arxiv_id": "quant-ph/9908022",
"authors": [
"A. Carlini",
"A. Hosoya"
],
"categories": [
"quant-ph"
],
"title": "Carmichael Numbers on a Quantum Computer",
"url": "https://arxiv.org/abs/quant-ph/9908022"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "74d2f54a-b300-41bd-8403-a7d71f939eef",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}