Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Perfect Number Arithmetic in Quantum Computing Hardware

Min Woo Park

Published Apr 6, 2026• 0 citations
Publisher

Abstract

Perfect Number Arithmetic in Quantum Computing Hardware. Part of the N6 Architecture project exploring universality of the smallest perfect number n=6 across scientific and engineering domains.
DOI
10.5281/zenodo.19438209

Related papers

A blueprint for building a quantum computer

Rodney Van Meter, Dominic C. Horsman

Quantum computer architecture holds the key to building commercially viable systems.

Communications of the ACM•Sep 26, 2013•115 citations

Pegase Project: Presentation of an Innovative Quantum Hardware and its Hardware on Synthetic DNA

Patrick Guiffra

Hello,The Pégase Project proposes an innovative modular quantum operator designed toprovide highly targeted computational power while overcoming the hardware limitationsof current quantum architectures From Prime Numbers to DNA / The Emergence of a Universal Fundamental Structurehttps://doi.org/10.5281/zenodo.18449559 PégaseNet: From Modular Addition to Structured Languagehttps://doi.org/10.5281/zenodo.18324563 CordialyThis work addresses the following domains: quantum computing, DNA computing, synthetic biology, quantum hardware, molecular computing, NISQ devices, quantum architecture, DNA nanotechnology, programmable matter, biocomputing, prime numbers, modular arithmetic, room-temperature quantum computing, scalable quantum computing.

•Feb 5, 2026•0 citations

What is a Quantum Computer?

Marcus Woo

•Jan 1, 2013•0 citations

Floating-Point Arithmetic with Consistent Rounding on a Quantum Computer

R. Steijl

Implementation of floating-point arithmetic with consistent rounding is a critical component of many quantum algorithms. Quantum circuit implementations for squaring and division serve as examples here. This work was motivated by ongoing work in developing quantum algorithms for scientific and engineering computing applications, where this type of arithmetic often forms part of the algorithm. A key feature of the work is the use of a reduced-precision floating-point representation of real data specifically designed for near-term future quantum computing hardware with a limited number of qubits (e.g., less than 100) and with an increased level of fault tolerance as compared to current quantum computing hardware. The quantum circuit implementations of the squaring of a floating-point number and the division of two floating-point numbers are detailed here, highlighting similarities in the quantum circuit implementation for the logical steps required for rounding-to-nearest in line with the IEEE 754 standard for the two arithmetic operations. This similarity is an important feature regarding future work where an automated generation of this type of quantum circuit from a set of standard modules and circuit templates is employed.

IntechOpen eBooks•Jun 7, 2024•0 citations

Quantum Computing Architecture and Hardware for Engineers

Hiu Yung Wong

Springer eBooks•Jan 1, 2025•6 citations

Technical Feature Breakdown – RunEngine Pro 1 what we built last night

Stieve, Jonathan

We present RunEngine Pro 1, a hybrid classical–quantum computation engine capable of multi-scale quantum simulations on commercial hardware. Integrating recursive SZTM architecture, BorgAI memory, and OmniPoint coordination, the engine enables reproducible, testable, and falsifiable exploration of quantum systems with optional perturbative interactions, including dark matter, dark energy, and sub-Planck effects. RunEngine Pro 1 demonstrates CPU robustness with high-precision eigenvalue computations (<0.3% error) and real-time GPU acceleration for large-scale sweeps, supporting multi-threaded, parallel parameter exploration. The framework provides a scientifically rigorous, extensible platform for both validating known quantum mechanics and exploring emergent phenomena across multiple domains.

•Nov 14, 2025•0 citations
Hello,The Pégase Project proposes an innovative modular quantum operator designed toprovide highly targeted computational power while overcoming the hardware limitationsof current quantum architectures From Prime Numbers to DNA / The Emergence of a Universal Fundamental Structurehttps://doi.org/10.5281/zenodo.18449559 PégaseNet: From Modular Addition to Structured Languagehttps://doi.org/10.5281/zenodo.18324563 CordialyThis work addresses the following domains: quantum computing, DNA computing, synthetic biology, quantum hardware, molecular computing, NISQ devices, quantum architecture, DNA nanotechnology, programmable matter, biocomputing, prime numbers, modular arithmetic, room-temperature quantum computing, scalable quantum computing.
Implementation of floating-point arithmetic with consistent rounding is a critical component of many quantum algorithms. Quantum circuit implementations for squaring and division serve as examples here. This work was motivated by ongoing work in developing quantum algorithms for scientific and engineering computing applications, where this type of arithmetic often forms part of the algorithm. A key feature of the work is the use of a reduced-precision floating-point representation of real data specifically designed for near-term future quantum computing hardware with a limited number of qubits (e.g., less than 100) and with an increased level of fault tolerance as compared to current quantum computing hardware. The quantum circuit implementations of the squaring of a floating-point number and the division of two floating-point numbers are detailed here, highlighting similarities in the quantum circuit implementation for the logical steps required for rounding-to-nearest in line with the IEEE 754 standard for the two arithmetic operations. This similarity is an important feature regarding future work where an automated generation of this type of quantum circuit from a set of standard modules and circuit templates is employed.
We present RunEngine Pro 1, a hybrid classical–quantum computation engine capable of multi-scale quantum simulations on commercial hardware. Integrating recursive SZTM architecture, BorgAI memory, and OmniPoint coordination, the engine enables reproducible, testable, and falsifiable exploration of quantum systems with optional perturbative interactions, including dark matter, dark energy, and sub-Planck effects. RunEngine Pro 1 demonstrates CPU robustness with high-precision eigenvalue computations (<0.3% error) and real-time GPU acceleration for large-scale sweeps, supporting multi-threaded, parallel parameter exploration. The framework provides a scientifically rigorous, extensible platform for both validating known quantum mechanics and exploring emergent phenomena across multiple domains.