Graph embedding techniques

Details Graph embedding techniques Graph embedding techniques

2011-07-19

2011-07-19

Gaffin, Jeffrey A (Department: 2129)

Data processing: artificial intelligence

Miscellaneous

Reexamination Certificate

active

07984012

ABSTRACT:
Approaches to embedding source graphs into targets graphs in a computing system are disclosed. Such may be advantageously facilitate computation with computing systems that employ one or more analog processors, for example one or more quantum processors.

REFERENCES:
patent: 6838694 (2005-01-01), Esteve et al.
patent: 7135701 (2006-11-01), Amin et al.
patent: 2005/0082519 (2005-04-01), Amin et al.
patent: 2005/0250651 (2005-11-01), Amin et al.
patent: 2005/0256007 (2005-11-01), Amin et al.
patent: 2006/0147154 (2006-07-01), Thom et al.
‘GraphGrep: A Fast and Universal Method for Querying Graphs’: Giugno, 2002, IEEE, 1051-4651, pp. 112-115.
Coury M. Embedding Graphs into the Extended Grid. School of Computing Science, Simon Fraser University, Feb. 7, 2008 [retrieved on Nov. 22, 2010]. Retrieved from the Internet<http://arxiv.org/PS—cache/cs/pdf/0703/0703001v1.pdf.
“A High-Level Look at Optimization: Past, Present and Future,” e-Optimization.Community, May 2000, pp. 1-5.
Allen et al., “Blue Gene: A vision for protein science using a petaflop supercomputer,”IBM. Systems Journal 40(2): 310-327, 2001.
Blatter et al., “Design aspects of superconducting-phase quantum bits,”Physical Review B 63: 174511-1-174511-9, 2001.
Boyer et al., “On the Cutting Edge: SimplifiedO(n) Planarity by Edge Addition,”Journal of Graph Algorithms and Applications 8(3): 241-273, 2004.
Dolan et al., “Optimization on the NEOS Server,” fromSiam News 35(6): 1-5, Jul./Aug. 2002.
Farhi et al., “Quantum Adiabatic Evolution Algorithms versus Simulated Annealing,” MIT-CTP #3228, arXiv:quant-ph/0201031 vl, pp. 1-16, Jan. 8, 2002.
Feynman, “Simulating Physics with Computers,”International Journal of Theoretical Physics 21(6/7): 467-488, 1982.
Fourer et al., “Optimization as an Internet Resource,”Interfaces 31(2): 130-150, Mar.-Apr. 2001.
Friedman et al., “Quantum superposition of distinct macroscopic states,”Nature 406: 43-46, Jul. 6, 2000.
U.S. Appl. No. 11/932,261, filed Oct. 31, 2007, Macready et al.
U.S. Appl. No. 12/017,995, filed Jan. 22, 2008, Harris.
Gutwenger et al., “Graph Drawing Algorithm Engineering with AGD,” in Diehl (ed.),Lecture Notes in Computer Science 2269. Revised Lectures on Software Visualization, International Seminar, Springer-Verlag, London, 2001, pp. 307-323.
Heckman et al., “Optimal Embedding of Complete Binary Trees into Lines and Grids,” Department of Mathematics and Computer Science, University of Paderborn, West Germany, pp. 1-11, date unknown.
Il'ichev et al., “Continuous Monitoring of Rabi Oscillations in a Josephson Flux Qubit,”Physical Review Letters 91(9): 097906-1-097906-4, week ending Aug. 29, 2003.
Knysh et al., “Adiabatic Quantum Computing in systems with constant inter-qubit couplings,” arXiv:quant-ph/0511131v2, pp. 1-10, Nov. 15, 2005.
Makhlin et al., “Quantum-state engineering with Josephson-junction devices,”Reviews of Modern Physics 73(2): 357-400, Apr. 2001.
Mooij et al., “Josephson Persistent-Current Qubit,”Science 285: 1036-1039, Aug. 13, 1999.
Mutzel, “Optimization in graph drawing,” Technische Universität Wien, pp. 1-20, 2002.
Nielsen et al.,Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000, “7.8 Other implementation schemes,” pp. 343-345.
Orlando et al., “Superconducting persistent-current qubit,”Physical Review B 60(22): 15 398-15 413, Dec. 1, 1999.
Shields, Jr. et al., “Area Efficient Layouts of Binary Trees on One, Two Layers,” Department of Computer Science, University of Texas at Dallas, 13 pages, date unknown.
Shirts et al., “Computing: Screen Savers of the Word Unite!,”Science Online 290(5498): 1903-1904, Dec. 8, 2000.
Shor, “Introduction to Quantum Algorithms,” AT&T Labs—Research, arXiv:quant-ph/0005003 v2, pp. 1-17, Jul. 6, 2001.

Affiliated with

Also associated with

Rating

Graph embedding techniques does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Graph embedding techniques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph embedding techniques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2680104