Semiclassical quantum computation solutions to the count to infinity problem: a brief discussion

Simple item page
dc.citation.epage164en_US
dc.citation.issueNumber1en_US
dc.citation.spage159en_US
dc.citation.volumeNumber3en_US
dc.contributor.authorGökden, Burçen_US
dc.coverage.spatialCamerino, Italyen_US
dc.date.accessioned2016-02-08T11:51:56Zen_US
dc.date.available2016-02-08T11:51:56Zen_US
dc.date.issued2005en_US
dc.departmentDepartment of Physicsen_US
dc.descriptionDate of Conference: 16-19 April 2004en_US
dc.descriptionConference Name: International Meeting on Quantum Information Science – Foundations of Quantum Information, 2004en_US
dc.description.abstractIn this paper we briefly define distance vector routingalgorithms, their advantages and possible drawbacks. On thesepossible drawbacks, currently widely used methods split horizonand poisoned reverse are defined and compared. The count toinfinity problem is specified and classified to be a haltingproblem, and a proposition stating that entangled states used inquantum computation can be used to handle this problem isexamined. Several solutions to this problem by using entangledstates are proposed and a very brief introduction to entangledstates is presented.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:51:56Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2005en
dc.identifier.doi10.1142/S0219749905000645en_US
dc.identifier.issn0219-7499en_US
dc.identifier.urihttp://hdl.handle.net/11693/27386en_US
dc.language.isoEnglishen_US
dc.publisherWorld Scientific Publishingen_US
dc.relation.isversionofhttp://dx.doi.org/10.1142/S0219749905000645en_US
dc.source.titleInternational Journal of Quantum Informationen_US
dc.subjectComputer networksen_US
dc.subjectCounting to infinity problemen_US
dc.subjectDistance vector routingen_US
dc.subjectEntanglementen_US
dc.subjectHalting problemen_US
dc.subjectQuantum computersen_US
dc.subjectRouting information protocolen_US
dc.titleSemiclassical quantum computation solutions to the count to infinity problem: a brief discussionen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Semiclassical_quantum_computation_solutions_to_the_count_to_infinity_problem__a_brief_discussion.pdf
Size:
107.66 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Physics