DOW-UAP-D150: Quantum Computing and Utilizing Organic Molecules in Automation Technology - Qubits and DNA Computers for Future Spacecraft

Source file: DOW-UAP-D150_AAWSAP-DIRD-Quantum-Computing-and-Utilizing-Organic-Molecules-in-Automation-Technology-December-10-2010.pdf Originating agency: Defense Intelligence Agency (DIA), Defense Warning Office; produced under the AAWSA Program Document type: Defense Intelligence Reference Document (DIRD), "Defense Futures" series; control number DIA-08-1102-005 Date: 10 December 2010 (information cutoff date, ICOD: 10 December 2010) Classification: UNCLASSIFIED//FOR OFFICIAL USE ONLY (the FOUO caveat is struck through on most pages; released in 2026) Page count: 54 VIRIN: 260918-D-D0360-1139 PURSUE Release: 6

Summary

A 54-page reference document that asks what kind of computer a spacecraft 40 years from now would need to carry, and answers with two unconventional candidates: quantum computers and molecular machines built from DNA. It was prepared by the DIA's Technology Warning Division (DWO-4), within the Defense Warning Office and the Directorate for Analysis, carries the control number DIA-08-1102-005 and is dated 10 December 2010. The author appears only as the redacted pseudonym "AAP Person 73," and comments or questions were to be addressed to "AAP Person 1," the AAWSA Program Manager at the DIA. The administrative page describes it as one of a series of advanced technology reports produced in fiscal year 2010. The same pseudonym, AAP Person 73, is credited as author of DOW-UAP-D151, on the cognitive limits of controlling multiple unmanned spacecraft, which the same division issued five days later and which uses the same 40-year horizon.

The paper is a literature review with an explicit forecasting layer. About half of it is a primer on quantum information (decoherence, fault tolerance, scalability), including a long technical section on electron-spin qubits in graphene quantum dots. The other half surveys DNA nanotechnology, from self-assembling DNA tiles and DNA origami to deoxyribozyme logic gates that play tic-tac-toe and DNA "spiders" that walk along tracks. It ends with forecasts on 10-, 20- and 40-year horizons, and carries 27 figures and 130 references.

The document does not mention UFOs, UAP or any anomalous observation. Its only link to the program is the administrative page.

Research Article

The problem: a supercomputer that survives space

The paper opens with an engineering complaint. Spaceflight has never carried serious computing power; in its words, "the most powerful general purpose computers riding in the shuttle are the laptops the astronauts bring with them" (p. 8). Radiation causes temporary and permanent calculation errors, radiation-hardening is slow and costly, and certification keeps current processors off spacecraft. The paper raises the obvious objection itself: "if 50 years of space travel hasn't required one onboard supercomputer, why start now?" It notes that NASA cancelled, in late 2009, a space test of a parallel approach based on commercial-off-the-shelf (COTS) components that a University of Florida group had pursued (p. 9).

The answer offered is distance. Communication delays reach "Mars ~13 minutes, Jupiter ~45 minutes, and Neptune ~4 hours," and spacecraft "active in the 40-year horizon" will need to process astronomical, ship and crew data on board. The examples are thousands of semi-autonomous sensors on Mars or millions of wirelessly communicating nanomachines, "magic dust" (p. 9). A footnote ties the scenario to a Workshop for Technology Breakthroughs for Human Space Exploration held at NASA Headquarters in Washington on 17 June 2010.

In terms of the AAWSAP Statement of Objectives (DOW-UAP-D110), this is plausibly a paper for the "control" area and the "supporting topics" area, with a side interest in materials through graphene. Nothing in it concerns propulsion or lift.

A primer on quantum information

Pages 9 to 14 are an orderly tutorial. The author frames quantum computing through a laser analogy: the laser did not replace the incandescent bulb, it did different things, and likewise quantum machines "are not necessarily bigger, smaller, or faster than traditional methods; they are just different" (p. 10). The driving application is cryptography: Shor's 1994 algorithm would factor public keys in a polynomial rather than exponential number of steps, and Grover-type quantum search cuts 0.5N lookups to √N (p. 11). Quantum communication, quantum metrology and the simulation of quantum systems complete the four applications.

Then comes the engineering vocabulary. A quantum circuit must sit in a "closed box," because any outside influence changes its state, a process called decoherence. Borrowing from nuclear magnetic resonance (NMR), the paper characterizes each hardware platform by three time constants: T2* (stable repeatability), T1 (resistance to entropy) and T2 (isolation from the rest of the universe) (p. 12). Error correction is explained with a RAID-style disk analogy and a toy electron-spin example that tolerates a 33% error rate. But "realizable systems are more complex and only tolerate error rates in the 3% range," and fault tolerance is possible only if a quantum non-demolition (QND) measurement can be demonstrated (p. 13).

The technical core: spin qubits in graphene

The longest single thread (pp. 14-22) argues for electron-spin qubits confined in graphene quantum dots. Carbon suits the job because carbon-12 has no nuclear spin. In natural carbon, 99% carbon-12 and 1% carbon-13, the qubit's electron "can only interact with 1% of the nuclei," and graphene enriched in carbon-12 could reduce that further (p. 21). The obstacles are graphene's missing band gap, which lets electrons escape by Klein tunneling, and its "valley degeneracy," which complicates two-qubit gates. The paper walks through three electrostatically defined dot designs (armchair-edged graphene nanoribbons, discs in single-layer graphene and discs in bilayer graphene) and judges bilayer graphene to be the next major direction, because an electric field opens a tunable gap in it.

Two quantitative claims stand out. Because the electron g-factor is close to 2 in graphene dots, against less than 0.43 in gallium arsenide (GaAs) dots, spins can be rotated "about five times faster" with the same oscillating magnetic field (p. 19). And Klein tunneling allows distant qubits in a graphene ribbon to be coupled without touching the qubits between them, an arrangement the paper calls a "qubit piano" (Figure 7, p. 20). The section's bottom line is candid: fast (~200 ps) two-qubit operations had been demonstrated, but single-qubit operations on a similar time scale "still remain a challenge," and no two-qubit gates had yet been demonstrated for the singlet-triplet design, which involves four spins (p. 22).

The other platforms, via Ladd

For completeness the paper summarizes a 2010 Nature review by Ladd and colleagues, plus a longer review of ion traps by Haffner (pp. 22-24). Ion traps get the best verdict: gate fidelity above the fault-tolerance threshold and no fundamental barrier to scaling, but heavy cryogenic and shielding systems. Photonics suffers from photon loss and centimetre-scale gates, yet publications on photon computing in 2009 outnumbered those of 2008 and 2007 combined (per a Web of Science search of 30 June 2010). From this the author concludes that "in 10 years all-optical computing should be addressing problems that cannot be accomplished via classical systems" (p. 23). Liquid-state NMR had reached about a dozen qubits but is treated only as a testing ground for algorithms. Superconducting circuits are limited to coherence times of a few microseconds and to operation at tens of millikelvin, and are "currently not seen as a stand-alone technology" (p. 24).

Two caveats are worth adding as outside context. First, that last judgement did not age well: superconducting qubits became, alongside trapped ions, one of the leading quantum-computing platforms of the following decade. Second, the paper contains small factual slips, such as dating ENIAC to "the 1950s" (p. 8; the machine was completed in 1945) and citing copper as an example of a superconducting material (p. 24).

DNA: from tiles to tic-tac-toe to walking spiders

The second half (pp. 24-46) is a separate literature review. It opens with an eight-point outline of DNA chemistry "for the lay reader," then follows Winfree's abstract Tile Assembly Model (aTAM), in which a set of "Wang tiles" acts as a program and two-dimensional DNA self-assembly can in principle perform Turing-universal computation. Figure 12 shows XOR tiles growing Sierpinski-triangle crystals. The central obstacle is assembly error, classified as growth, facet and nucleation errors (Figure 15). The paper describes proofreading tiles (each tile replaced by a 2 x 2 block), the Protected and Layered Tile Mechanisms (PTM and LTM) of Fujibayashi and Murata, and a microfluidic tile assembler built by researchers in Tokyo.

DNA origami receives the most concrete numbers: shapes built on a 7,000-base scaffold strand with more than 200 helper strands, yields above 70%, and 50 billion copies of the pattern made at once. The author declares that "we are now capable of self-assembling structures whose size and complexity rival that of Nature's most complex self assembled machines" (p. 34). Logic follows: deoxyribozyme gates (catalysts made of DNA) of the NOT, AND, ANDNOT and ANDANDNOT types, and the "MAYA" automata that play tic-tac-toe against a human. The paper gives two gate counts without clearly separating them: 23 gates for the simplified first game, and 97 logic gates across 9 wells, driven by 32 human-operated input strands, with a further 32 gates displaying the human's moves. The automata "give the human no chance to win" (p. 40). The paper concedes that serial connections between such gates are too slow for practical devices (p. 37).

The space connection returns only at the end. A DNA walker carrying a cargo of gold atoms "could be used to collect samples from asteroid or planetary surfaces" (p. 44). Deoxyribozyme "spiders" with two to six legs raised the number of consecutive steps from single digits to several thousand, and the paper proposes that the nano walker repair DNA computers damaged by cosmic rays (pp. 44-45). Self-repair is, in effect, the paper's whole case for DNA in space.

The forecasts, and what the paper does not do

The Summary (pp. 6-7) and the Discussion (pp. 46-47) repeat almost word for word the same four forecasts: working ion-trap quantum computers "within 10 years," but impractical for spaceflight; optical computers within 20 years and a supporting role in distributed quantum computing within 40; hybrid quantum-dot and photonic supercomputers operating without cryogenics within 40 years; and simple DNA-tile computing within 20 years, with self-repairing DNA computers within 40. The Conclusion (p. 47) lists four "space-ready" advances on the 40-year horizon, and concedes that in the 10-20 year horizon the space-travel readiness of optical and DNA computers "will be lacking."

These forecasts are asserted rather than derived. The only evidence for timing is research activity, and the paper says so plainly: the ion-trap forecast "is entirely based on the amount of research resources dedicated to the problem." There is no cost analysis, no radiation test data for any of the proposed architectures, and no assessment of foreign programs. It is also worth noting that the official war.gov summary is more cautious than the paper itself: it describes DNA computing as a far-future concept, whereas the paper forecasts fault-tolerant DNA computers "for mission-critical analysis tasks" and an all-optical computer that could "augment or replace" general-purpose computers in space. The document does not mention UFOs or UAP at all.

Significance

This is a well-organized technical survey resting mostly on mainstream scientific literature, and its value to the archive lies in showing how broadly AAWSAP defined "advanced aerospace." A program remembered mainly for its interest in unexplained phenomena commissioned a 54-page review of graphene qubits and DNA origami, framed around the computing needs of spacecraft 40 years out. For today's reader the paper is useful as a 2010 snapshot of quantum and DNA computing, including a forecast (superconductors as a secondary technology) that the following decade overturned. Its contribution to the UAP question itself is indirect at most.

Key People

Locations

Key Concepts

Notable Quotes

"Current commercial computer hardware trajectories in silicon substrate semiconductors are not likely to produce a radiation-hard or small and portable supercomputer without significant mission-specific alteration." -- page 6

"Indeed, the most powerful general purpose computers riding in the shuttle are the laptops the astronauts bring with them." -- page 8

"A good question arises that if 50 years of space travel hasn't required one onboard supercomputer, why start now?" -- page 9

"The first operating quantum computers capable of solving real-world problems will commence within 10 years and be based on ion trap technology." -- page 6

"Hybrid designs utilizing arrays of quantum dots and photon communication channels will be an option for space travel supercomputing on the 40-year timescale. These systems operate at attainable temperatures without cryonics, and require no more shielding than humans." -- page 6

"For the first time, we are now capable of self-assembling structures whose size and complexity rival that of Nature's most complex self assembled machines." -- page 34

"The nano walker could be hybridized to repair DNA based machinery, including DNA computers, when they are being assembled, or when they are damaged from cosmic rays, for example." -- page 45

"These will not be the fastest systems in the astro-arsenal, but self-repair may make them the most robust." -- page 7