Documents / Report

Defense Intelligence Reference Document Quantum Computing And Utilizing Organic Molecules In Automation Technology

Defense Intelligence Agency · 54 pages · text from the file's own layer

This Defense Intelligence Reference Document from the Defense Intelligence Agency, dated 10 December 2010, is one of a series of advanced technology reports produced in FY 2010 under the Advanced Aerospace Weapon System Applications (AAWSA) Program. It reviews quantum computing technologies and DNA-based molecular computing for onboard supercomputing on future spacecraft. It forecasts ion-trap quantum computers within 10 years, simple DNA tile computing within 20 years, and self-repairing DNA computers on a 40-year horizon.

  • p. 6 …On the 40-year time horizon, useful DNA-based devices will be essential space exploration tools…
  • p. 9 …The current approach is to make the solid state components radiation-hard, a time-consuming and…
  • p. 10 …Smaller circuit elements decreased the settling time of transistors and thus gates on CPUs, allowing increasing…
  • p. 11 …The strength of this technique is that traditional computer algorithms will take a long time to…
  • p. 12 …These three time constants that describe the internal signal decays are very similar to the same…
  • p. 13 …computation time, decoherence time, physical space, or required power). The exact nature of the required engineering…
  • p. 19 …five times faster than in GaAs quantum dots using the same field strength of the external…
  • p. 21 …and the spin-flip relaxation time is inversely proportional to the elastic scattering time. The spin…
  • p. 22 …time scale still remain a challenge. A proposed new configuration of two-spin encoding of the…
  • p. 23 …time in other quantum hardware.n The size of quantum gates is currently on the order…
  • p. 24 …The components of superconducting circuits can be fabricated with current technology; however, decoherence times are limited…
  • p. 30 …been proposed based on the idea of increasing the amount of time required to lock in…
  • p. 34 …For the first time, we are now capable of self-assembling structures whose size and complexity…
  • p. 47 …On the 40-year time horizon, useful DNA-based devices will be essential space exploration tools…
UNCLASSIFIED/ ,'P'l!I"- l!IP'P'll!lllit l!l!i! 811LI.I
REFERENCES
1. Turing A. On Computable Numbers, with an Application to the
Entscheidungsproblem. Proceedings of the London Mathematical Society
1937;42: 230-65.
2. Cho K, George AD, Subramaniyan R. Fault-tolerant parallel algorithms for adaptive
matched-field processing on distributed array systems. Journal of Computational
Acoustics. 2005;13(4):667-87.
3. Cho K, George AD, Subramaniyan R, Kim K. Fault-tolerant matched-field processing
in the presence of element failures. Journal of Computational Acoustics.
2006; 14(3): 299-319.
4. Einstein A. Zur Quantentheorie der Strahlung (On the Quantum Theory of Radiation).
Physikalische Zeitschrift. 1917; 18: 121-8.
5. Ladd TD, Jelezko F, Laflamme R, Nakamura Y, Monroe C, O'Brien JL. Quantum
computers. Nature. 2010 Mar 4;464(7285):45-53.
6. Shor PW, editor. Algorithms for Quantum Computation: Discrete Logarithms and
Factoring. 35th Annual Symposium on the Foundations of Computer Science; 1994:
IEEE Computer Society Press, Los Alamitos, CA.
7. Grover LK. Quantum mechanics helps in searching for a needle in a haystack.
Physical Review Letters. 1997 JuI;79(2):325-8.
8. Grover LK. Fixed-point quantum search. Physical Review Letters. 2005 Oct;95(15).
9. Bennett CH, Brassard G, Popescu S, Schumacher B, Smolin JA, Wootters WK.
Purification of noisy entanglement and faithful teleportation via noisy channels.
Physical Review Letters. 1996 Jan;76(5):722-5.
10.Gottesman D, Chuang IL. Demonstrating the viability of universal quantum
computation using teleportation and single-qubit operations. Nature. 1999
Nov;402(6760) :390-3.
11. Feynman RP. Simulating Physics with Computers. International Journal of
Theoretical Physics. 1982;21(6-7):467-88.
12. Ortiz G, Gubernatis JE, Knill E, Laflamme R. Simulating fermions on a quantum
computer. Computer Physics Communications. 2002;146(3):302-16.
13.Knill E, Laflamme R. Theory of quantum error-correcting codes. Phys Rev A. [Article].
1997 Feb;55(2):900-ll.
14. Li YF, Du mer I, Pryadko LP. Clustered Error Correction of Codeword-Stabilized
Quantum Codes. Physical Review Letters. [Article]. 2010 May;l04(19):4.
15. Mizel A, Lidar DA, Mitchell M. Simple proof of equivalence between adiabatic
quantum computation and the circuit model. Physical Review Letters. 2007
Aug;99(7).
16. Raussendorf R, Briegel HJ. A one-way quantum computer. Physical Review Letters.
2001 May;86(22):5188-91.
17.Raussendorf R, Harrington J, Goyal K. A fault-tolerant one-way quantum computer.
Annals of Physics. 2006 Sep;321(9):2242-70.
18. B. Trauzettel, D.V. Bulaev, D. Loss, G. Burkard. Spin qubits in graphene quantum
dots, Nat Phys 3, 192-196 (2007).
19. WeinsteinY S, Hellberg CS and Levy J 2005 Quantum-dot cluster-state computing
with encoded qubits Phys. Rev. A 72 020304.
20.A.N. Jordan, B. Trauzettel, G. Burkard. Weak-measurement theory of quantum-dot
spin qubits, Phys. Rev. B 76, 155324 (2007).
48 UNCLASSIFIED/ ,<EiOAt OEiEil&I.«1k 1!181! 8HLY

Not linked to a story yet.

About this file

Report, from the dia collection. The PDF is mirrored here; the original link is under it. 54 pages are in the text index: search them above, or from the library's search.