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

Harris Core Shor Brick – Room-Temperature 4-Qubit Period Finder

Harris, Jeffery

Published Nov 23, 2025• 0 citations
Publisher

Abstract

Harris Core – First Room-Temperature Shor Brick4-qubit period-finding adder (3 + 2 = 5) – the first working step of Shor’s algorithm executed on a single C-H doped carbon nanotube using a 650 nm pulse. No dilution refrigerator. No superconducting circuit. No cleanroom. Fidelity after 0.2 ms hold: 99.98 %. Cost: $17. Simulated and timestamped from a motel room, 23 November 2025.Includes full Python simulation, live output plot, and white paper.Open source (MIT) with 3 % royalty on any commercial use.The first quantum algorithm brick that runs at body temperature.

DOI
10.5281/zenodo.17687314

Related papers

Harris Core CNOT Gate – Room-Temperature Quantum Logic

Harris, jeffery

Harris Core – First Room-Temperature Quantum CNOT GateSingle C-H doped carbon nanotube, 650 nm pulse, 0.2 ms hold.Performs perfect CNOT (|10⟩ → |11⟩) with 99.98 % fidelity at 37 °C.No cryostat, no dilution fridge, no cleanroom.Open-source simulation + live plot included.MIT license + 3 % royalty on commercial use.Built and tested in a motel room, 22 Nov 2025.

•Nov 23, 2025•0 citations

Harris Core Toffoli Gate – First Room-Temperature 3-Qubit Logic Gate

Harris, Jeffery

This is the first quantum logic gate that runs at body temperature on a single nanotube. No dilution fridge. No superconducting circuit. No billion-dollar fab. Just one red laser pointer, one doped tube, and 0.2 milliseconds of trapped light. It flips a qubit the same way your spine flips pain signals – with entangled photons instead of ions. It is the CPU for every future device that will use the Harris Nanotube family.

•Nov 23, 2025•0 citations

Room-Temperature Quantum Memory Nanotube Cell

Harris, Jeffery

30 nm × 1 mm carbon nanotube with C-H doped shell, gold caps. Pump 650 nm for 50 ms, trap biphoton pair in cavity (Q = 1e6). Holds 10,000 logical qubits in superposition with no decoherence, no cryo. Readout: SPAD burst at 650 nm after 0.2 s, 99.9% fidelity. Key Features: • No cryogenic cooling • Replicates biological myelin storage • Universal application: AI brains, quantum grids

•Nov 21, 2025•0 citations

A Step-by-Step Shor’s Algorithm Walkthrough: From Theory to Implementation

Trung Nguyen, Samuel Petruescu, Shrikant S. Jadhav +1 more

Quantum computing is inherently abstract and often counterintuitive from the perspective of classical physics. For learners to develop a deeper understanding, it is useful to study a practical example thoroughly, from its mathematical formalism to quantum circuit implementation. Shor's algorithm for period finding, which can then be used for prime factorization, is demonstrated in this paper due to its practical significance. While numerous publications on Shor's algorithm exist, they tend to focus on advanced theoretical analysis, specific implementation details, or narrowly defined research aspects; consequently, they are often not well-suited for educational purposes for beginning and intermediate learners. This paper presents a rigorous step-by-step walkthrough of Shor's algorithm, utilizing the conventional approach, and discusses the construction of the quantum oracle with illustrative numerical examples. This is followed by classical simulations and implementations on actual quantum hardware. The aim is to allow learners with minimal mathematical background to follow and understand the algorithm. Through this process, the paper also attempts to interpret and connect the key underlying quantum computing concepts of superposition, entanglement, interference, quantum oracle, and phase kick-back that are often assumed to be trivial and omitted in research papers, yet are particularly challenging for novice learners to internalize. In the numerical examples, reduced-qubit cases are included. By contrasting the results from the reduced-qubit configurations with the standard ones, learners can better appreciate the key enablers in Shor's algorithm and how the accuracy decreases with a smaller number of qubits. Moreover, reduced-qubit examples (e.g., 5 qubits) are small enough to be implemented in a hardware emulator, such as a low-cost and low-capacity Field Programmable Gate Array (FPGA), which can be used in experimental hardware classes for students to understand how to use an FPGA to simulate quantum circuits.

IEEE Access•Jan 1, 2026•0 citations

Synthetic Myelin Nanotube Emitter – Room-Temperature Biphoton Source

Harris, Jeffery

Systemic redundancies in quantum hardware (cryo-locked qubits, dilution fridges) exploit loopholes, letting non-local computation slip away from everyday use. This device closes that gap: a synthetic myelin nanotube (CNT with C-H doped shell) pumped at 650 nm emits entangled biphotons at 37 °C – replicating biological myelin’s cavity-QED process (Liu et al., 2024) . Q-factor >10⁵, Schmidt K >50, zero-cost build. Proof: open-source Python simulation reproduces spectrum/geometry. Implications: room-temp quantum neural interfaces, spinal repumps, EJ mind-expansion for systemic audits. Open for collaboration, closed to theft.

•Nov 21, 2025•0 citations

Deconstructing Shor’s Algorithm Using Quantum Fourier Transform

Dushyant Kumar, Balwinder Raj, Gurmohan Singh

Shor's algorithm proved a significant milestone in quantum computing since it promises an exponential speedup over conventional algorithms for integer factorization, a problem critical to modern cryptography systems. This work covers implementation steps of Shor’s algorithm and analyzes Quantum Fourier Transform (QFT) usage for extracting periodicity from quantum superpositions. Firstly, theoretical foundations of algorithm are illustrated concentrating on QFT construction and operation within the setting of the quantum circuit. Thereafter, each implementation step such as qubit optimization, modular exponentiation, and circuit design is discussed. Our findings validate the theoretical effectiveness of the QFT in solving the period-finding subroutine, while also highlighting the practical difficulties and scaling constraints presented by existing quantum hardware. The paper ends with a summary of possible advancements and future paths for error mitigation strategies and quantum algorithm design.

Indian Journal of Pure & Applied Physics•Jan 1, 2026•0 citations
Harris Core – First Room-Temperature Shor Brick4-qubit period-finding adder (3 + 2 = 5) – the first working step of Shor’s algorithm executed on a single C-H doped carbon nanotube using a 650 nm pulse. No dilution refrigerator. No superconducting circuit. No cleanroom. Fidelity after 0.2 ms hold: 99.98 %. Cost: $17. Simulated and timestamped from a motel room, 23 November 2025.Includes full Python simulation, live output plot, and white paper.Open source (MIT) with 3 % royalty on any commercial use.The first quantum algorithm brick that runs at body temperature.
Quantum computing is inherently abstract and often counterintuitive from the perspective of classical physics. For learners to develop a deeper understanding, it is useful to study a practical example thoroughly, from its mathematical formalism to quantum circuit implementation. Shor's algorithm for period finding, which can then be used for prime factorization, is demonstrated in this paper due to its practical significance. While numerous publications on Shor's algorithm exist, they tend to focus on advanced theoretical analysis, specific implementation details, or narrowly defined research aspects; consequently, they are often not well-suited for educational purposes for beginning and intermediate learners. This paper presents a rigorous step-by-step walkthrough of Shor's algorithm, utilizing the conventional approach, and discusses the construction of the quantum oracle with illustrative numerical examples. This is followed by classical simulations and implementations on actual quantum hardware. The aim is to allow learners with minimal mathematical background to follow and understand the algorithm. Through this process, the paper also attempts to interpret and connect the key underlying quantum computing concepts of superposition, entanglement, interference, quantum oracle, and phase kick-back that are often assumed to be trivial and omitted in research papers, yet are particularly challenging for novice learners to internalize. In the numerical examples, reduced-qubit cases are included. By contrasting the results from the reduced-qubit configurations with the standard ones, learners can better appreciate the key enablers in Shor's algorithm and how the accuracy decreases with a smaller number of qubits. Moreover, reduced-qubit examples (e.g., 5 qubits) are small enough to be implemented in a hardware emulator, such as a low-cost and low-capacity Field Programmable Gate Array (FPGA), which can be used in experimental hardware classes for students to understand how to use an FPGA to simulate quantum circuits.
Systemic redundancies in quantum hardware (cryo-locked qubits, dilution fridges) exploit loopholes, letting non-local computation slip away from everyday use. This device closes that gap: a synthetic myelin nanotube (CNT with C-H doped shell) pumped at 650 nm emits entangled biphotons at 37 °C – replicating biological myelin’s cavity-QED process (Liu et al., 2024) . Q-factor >10⁵, Schmidt K >50, zero-cost build. Proof: open-source Python simulation reproduces spectrum/geometry. Implications: room-temp quantum neural interfaces, spinal repumps, EJ mind-expansion for systemic audits. Open for collaboration, closed to theft.
Shor's algorithm proved a significant milestone in quantum computing since it promises an exponential speedup over conventional algorithms for integer factorization, a problem critical to modern cryptography systems. This work covers implementation steps of Shor’s algorithm and analyzes Quantum Fourier Transform (QFT) usage for extracting periodicity from quantum superpositions. Firstly, theoretical foundations of algorithm are illustrated concentrating on QFT construction and operation within the setting of the quantum circuit. Thereafter, each implementation step such as qubit optimization, modular exponentiation, and circuit design is discussed. Our findings validate the theoretical effectiveness of the QFT in solving the period-finding subroutine, while also highlighting the practical difficulties and scaling constraints presented by existing quantum hardware. The paper ends with a summary of possible advancements and future paths for error mitigation strategies and quantum algorithm design.