Quantum computational geometry

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5436, Issue , 2004, Pages 332-339

  Lanzagorta, Marco ^a   Uhlmann, Jeffrey K ^b  

^a NAVAL RESEARCH LABORATORY   (United States)

^b University of Missouri   (United States)

Author keywords

Collision Detection; Computational Geometry; Computer Graphics; Convex Hull; Grover's Algorithm; Multidimensional Data Structures; Quantum Algorithms; Quantum Computing; Range Searching; Scented Sampling Method; Simulation; Virtual Reality

Indexed keywords

COLLISION DETECTION; CONVEX HULL; GROVER'S ALGORITHMS; MULTIDIMENSIONAL DATA STRUCTURES; QUANTUM ALGORITHMS; QUANTUM COMPUTING; RANGE SEARCHING; SCENTED SAMPLING METHOD;

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; COMPUTER SIMULATION; COMPUTER VISION; INFORMATION ANALYSIS; PROBLEM SOLVING; VIRTUAL REALITY;

QUANTUM THEORY;

EID: 10444281670     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.541624     Document Type: Conference Paper

References (15)

1. Arne Andersson and K. Swanson. On the difficulty of range searching. Computational Geometry with Applications, 8(3):115-122. 1997.
2. V. Buzek and M. Hillery. Universal quantum cloning of qubits and quantum registers. In Proceedings of the QCQC'98 conference. Springer Verlag, 1999.
3. C.S. Calude, M.J. Dinneen, and K. Svozil. Reflections on quantum computing. Complexity, 6(1):35-37, 2000.
4. H. Edelsbrunner and M.H. Overmars. Batched dynamic solutions to decomposable searching problems. J. of Algorithms. 6:515-542. 1985.
5. Glassner. Andrew glassner's notebook: Quantum computing, part 1. IEEE Computer Graphics with Applications. 21(4), Jul/Aug 2001.
6. Glassner. Andrew glassner's notebook: Quantum computing, part 2. IEEE Computer Graphics with Applications, 21(5), Sep/Oct 2001.
7. Glassner. Andrew glassner's notebook: Quantum computing, part 3. IEEE Computer Graphics with Applications. 21(6), Nov/Dec 2001.
8. H. Lee J. P. Dowling, J. D.Franson and G. J. Milburn. Towards linear optical quantum computers. Quantum Physics e-prints quant-ph/0402090, 2004.
9. Donald E. Knuth. The Art of Computer Programming Vol. 3: Sorting and Searching. Addison Wesley Longman, 1998.
10. M. Lanzagorta and J. Uhlmann. A quantum algorithm for efficient search and retrieval of k marked solutions. To be submitted to Physics Letters, 2004.
11. P. Hover M. Boyer, G. Brassard and A. Tapp. Tight bounds on quantum searching. Fortsch.Phys., 46, 1998.
12. J.Uhlmann M. Lanzagorta and R.Gomez. Quantum rendering. In Proceedings of the Quantum Information and Quantum Computation Conference. SPIE Defense and Security Symposium, 2003.
13. H. Olivier P. Milman and J.M. Raimond. Universal quantum cloning in cavity QED. Physical Review A. 67(012314), 2003.
14. F.P. Preparata and M.I. Shamos. Computational Geometry. Springer-Verlag, 1985.
15. C.F. Li Y.S. Zhang Y.K. Jiang Y.F. Huang, W. Li and G.C. Guo. Optical realization of universal quantum cloning. Physical Review A, 64(012315), 2001.