{
  "id": "oai:papers.qnfo.org:computational-simulation-approach-to-non-archimedean-quantum-architectures",
  "slug": "computational-simulation-approach-to-non-archimedean-quantum-architectures",
  "title": "Computational Simulation Approach to Non-Archimedean Quantum Architectures",
  "authors": [
    "Rowan Brad Quni-Gudzinas"
  ],
  "abstract": "The prevailing quantum computing paradigm is fundamentally constrained by the continuous analog fragility inherent to Archimedean spaces, resulting in uncontrolled linear error accumulation that demands massive active correction overheads. To address this structural bottleneck, we propose a transition to a non-Archimedean state space modeled on the p-adic numbers and their graph-theoretic realization, the Bruhat-Tits tree. To validate this non-Archimedean architecture without physical p-adic hardware substrates, we developed a comprehensive software emulation utilizing Bounded Algorithmic Number (BAN) arithmetic logic units to process exact ultrametric valuations. We simulated the compilation of continuous logic gates into discrete tree automorphisms, mapping standard unitary operators to vertex shifts and branch permutations on a p=2 Cayley graph. Furthermore, stochastic Ohmic and burst noise injections were modeled to test the error-filtering properties of the strong triangle inequality dynamically, while van der Put Neural Networks (v-PuNNs) were deployed as read-out trackers to prevent topological distortion. [...]",
  "abstract_markdown": "The prevailing quantum computing paradigm is fundamentally constrained by the continuous analog fragility inherent to Archimedean spaces, resulting in uncontrolled linear error accumulation that demands massive active correction overheads. To address this structural bottleneck, we propose a transition to a non-Archimedean state space modeled on the p-adic numbers and their graph-theoretic realization, the Bruhat-Tits tree. To validate this non-Archimedean architecture without physical p-adic hardware substrates, we developed a comprehensive software emulation utilizing Bounded Algorithmic Number (BAN) arithmetic logic units to process exact ultrametric valuations. We simulated the compilation of continuous logic gates into discrete tree automorphisms, mapping standard unitary operators to vertex shifts and branch permutations on a p=2 Cayley graph. Furthermore, stochastic Ohmic and burst noise injections were modeled to test the error-filtering properties of the strong triangle inequality dynamically, while van der Put Neural Networks (v-PuNNs) were deployed as read-out trackers to prevent topological distortion. [...]",
  "date": "2026-04-01",
  "first_published": "2026-04-01",
  "last_revised": "2026-04-01T00:00:00Z",
  "modified": "2026-04-01T00:00:00Z",
  "version": "1.0.0",
  "version_count": 1,
  "language": "en",
  "keywords": [],
  "quality_tags": [
    "High-quality scholarly research",
    "open-access scholarly work",
    "versioned research publication"
  ],
  "quality_label": "High-quality scholarly research",
  "quality_basis": "QNFO publisher classification for open-access, versioned research with a public revision history and reader correction channel; this is not a claim of independent peer review.",
  "quality_evidence_url": "https://qnfo.org/about",
  "peer_review_status": "Not independently peer-reviewed",
  "resource_type": "ScholarlyArticle",
  "doi": null,
  "doi_url": null,
  "url": "https://papers.qnfo.org/papers/computational-simulation-approach-to-non-archimedean-quantum-architectures",
  "license_url": "https://legal.qnfo.org/",
  "license_spdx": null,
  "sha256": "751924e70bae11b11969e502f8eb1566773c52d23dd0e3420fddd2e85e77e1f7",
  "version_url": "https://papers.qnfo.org/papers/computational-simulation-approach-to-non-archimedean-quantum-architectures/v/1.0.0",
  "datacite": {
    "schemaVersion": "http://datacite.org/schema/kernel-4",
    "identifiers": [
      {
        "identifier": "https://papers.qnfo.org/papers/computational-simulation-approach-to-non-archimedean-quantum-architectures",
        "identifierType": "URL"
      }
    ],
    "creators": [
      {
        "name": "Rowan Brad Quni-Gudzinas",
        "nameType": "Personal",
        "nameIdentifiers": [
          {
            "nameIdentifier": "https://orcid.org/0009-0002-4317-5604",
            "nameIdentifierScheme": "ORCID",
            "schemeUri": "https://orcid.org"
          }
        ]
      }
    ],
    "titles": [
      {
        "title": "Computational Simulation Approach to Non-Archimedean Quantum Architectures"
      }
    ],
    "publisher": "QNFO",
    "publicationYear": "2026",
    "resourceType": {
      "resourceTypeGeneral": "Text",
      "resourceType": "ScholarlyArticle"
    },
    "subjects": [
      {
        "subject": "High-quality scholarly research",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      },
      {
        "subject": "open-access scholarly work",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      },
      {
        "subject": "versioned research publication",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      }
    ],
    "dates": [
      {
        "date": "2026-04-01",
        "dateType": "Issued"
      },
      {
        "date": "2026-04-01",
        "dateType": "Updated"
      }
    ],
    "language": "en",
    "version": "1.0.0",
    "rightsList": [
      {
        "rightsUri": "https://legal.qnfo.org/"
      }
    ],
    "descriptions": [
      {
        "description": "The prevailing quantum computing paradigm is fundamentally constrained by the continuous analog fragility inherent to Archimedean spaces, resulting in uncontrolled linear error accumulation that demands massive active correction overheads. To address this structural bottleneck, we propose a transition to a non-Archimedean state space modeled on the p-adic numbers and their graph-theoretic realization, the Bruhat-Tits tree. To validate this non-Archimedean architecture without physical p-adic hardware substrates, we developed a comprehensive software emulation utilizing Bounded Algorithmic Number (BAN) arithmetic logic units to process exact ultrametric valuations. We simulated the compilation of continuous logic gates into discrete tree automorphisms, mapping standard unitary operators to vertex shifts and branch permutations on a p=2 Cayley graph. Furthermore, stochastic Ohmic and burst noise injections were modeled to test the error-filtering properties of the strong triangle inequality dynamically, while van der Put Neural Networks (v-PuNNs) were deployed as read-out trackers to prevent topological distortion. [...]",
        "descriptionType": "Abstract"
      },
      {
        "description": "Publisher quality classification: High-quality scholarly research. QNFO publisher classification for open-access, versioned research with a public revision history and reader correction channel; this is not a claim of independent peer review.",
        "descriptionType": "Other"
      },
      {
        "description": "Peer review status: Not independently peer-reviewed",
        "descriptionType": "Other"
      }
    ],
    "formats": [
      "text/html"
    ]
  }
}