Revisiting integer factorization using closed timelike curves

From MaRDI portal
Publication:669871

DOI10.1007/S11128-018-2130-4zbMATH Open1417.81085arXiv1708.03508OpenAlexW2749625489WikidataQ128813172 ScholiaQ128813172MaRDI QIDQ669871FDOQ669871


Authors: Soumik Ghosh, Arnab Adhikary, Goutam Paul Edit this on Wikidata


Publication date: 15 March 2019

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: Closed Timelike Curves are relativistically valid objects allowing time travel to the past. Treating them as computational objects opens the door to a wide range of results which cannot be achieved using non relativistic quantum mechanics. Recently, research in classical and quantum computation has focused on effectively harnessing the power of these curves. In particular, Brun (Found. Phys. Lett., 2003) has shown that CTCs can be utilized to efficiently solve problems like factoring and QSAT (Quantified Satisfiability Problem). In this paper, we find a flaw in Brun's algorithm and propose a modified algorithm to circumvent the flaw.


Full work available at URL: https://arxiv.org/abs/1708.03508




Recommendations




Cites Work






This page was built for publication: Revisiting integer factorization using closed timelike curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669871)