{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:51:32Z","timestamp":1778215892420,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418986","type":"print"},{"value":"9783540453536","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45353-9_24","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:50:02Z","timestamp":1184601002000},"page":"319-327","source":"Crossref","is-referenced-by-count":20,"title":["Using Fewer Qubits in Shor\u2019s Factorization Algorithm via Simultaneous Diophantine Approximation"],"prefix":"10.1007","author":[{"given":"Jean-Pierre","family":"Seifert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"D. Aharonov, M. Ben-Or, \u201cFault-tolerant quantum computing with constant error\u201d, Proc. of the 29th Ann. ACM Symp. on Theory of Comp., pp. 176\u2013188, 1997.","DOI":"10.1145\/258533.258579"},{"key":"24_CR2","volume-title":"An Introduction to Diophantine Approximations","author":"J. W. S. Cassels","year":"1957","unstructured":"J. W. S. Cassels, An Introduction to Diophantine Approximations, Cambridge University Press, Cambridge, 1957."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"4091","DOI":"10.1103\/PhysRevLett.74.4091","volume":"74","author":"I. J. Cirac","year":"1995","unstructured":"I. J. Cirac, P. Zoller, \u201cQuantum computations with cold trapped ions\u201d, Phys. Rev. Let. 74:4091\u20134094, 1995.","journal-title":"Phys. Rev. Let."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1038\/30181","volume":"393","author":"CH+._I. L. Chuang","year":"1998","unstructured":"CH+._I. L. Chuang, L. M. K. Vandersypen, X. Zhou, D. W. Leung, S. Lloyd, \u201cExperimental realization of a quantum algorithm\u201d, Nature 393:143\u2013146, 1998.","journal-title":"Nature"},{"key":"24_CR5","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"J. Gruska, Quantum Computing, McGraw-Hill, London, 1999."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, A. W. Schrift, A. Shamir, \u201cThe discrete logarithm modulo a composite hides O(n) bits\u201d, J. Comp. Sys. Sci. 47:376\u2013404, 1993.","journal-title":"J. Comp. Sys. Sci."},{"key":"24_CR7","unstructured":"A. Y. Kitaev, \u201cQuantum measurements and the Abelian stabilizer problem\u201d, Technical report, quant-ph\/9511026, 1995."},{"key":"24_CR8","first-page":"453","volume":"54","author":"J. C. Lagarias","year":"1980","unstructured":"J. C. Lagarias, \u201cSome new results in simultaneous diophantine approximation\u201d, Queen\u2019s Pap. Pure Appl. Math. 54:453\u2013474, 1980.","journal-title":"Queen\u2019s Pap. Pure Appl. Math."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.2307\/1998713","volume":"272","author":"J. C. Lagarias","year":"1982","unstructured":"J. C. Lagarias, \u201cBest simultaneous Diophantine approximations. I: Growth rates of best approximation denominators\u201d, Trans. Am. Math. Soc. 272:545\u2013554, 1982.","journal-title":"Trans. Am. Math. Soc."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2140\/pjm.1982.102.61","volume":"102","author":"J. C. Lagarias","year":"1982","unstructured":"J. C. Lagarias, \u201cBest simultaneous Diophantine approximations. II: Behaviour of consecutive best approximations\u201d, Pacific J. Math. 102:61\u201388, 1982.","journal-title":"Pacific J. Math."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0214016","volume":"14","author":"J. C. Lagarias","year":"1985","unstructured":"J. C. Lagarias, \u201cThe computational complexity of simultaneous Diophantine approximation problems\u201d, SIAM J. Computing 14:196\u2013209, 1985.","journal-title":"SIAM J. Computing"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0022-314X(86)90104-6","volume":"24","author":"J. Lagarias","year":"1986","unstructured":"J. Lagarias, J. H\u00e5stad, \u201cSimultaneous diophantine approximation of rationals by rationals\u201d, J. Number Theory 24:200\u2013228, 1986.","journal-title":"J. Number Theory"},{"key":"24_CR13","doi-asserted-by":"crossref","DOI":"10.5962\/bhl.title.18546","volume-title":"Essai sur la th_eorie des nombres","author":"A. M. Legendre","year":"1798","unstructured":"A. M. Legendre, Essai sur la th_eorie des nombres, J. B. M. Duprat, Paris, 1798."},{"key":"24_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Graphs, Numbers and Convexity","author":"L. Lovasz","year":"1986","unstructured":"L. Lovasz, An Algorithmic Theory of Graphs, Numbers and Convexity, SIAM Publications, Philadelphia, 1986."},{"key":"24_CR15","unstructured":"M. Mosca, \u201cQuantum searching, counting and amplititude modification by eigenvector analysis\u201d, Proc. of the MFCS\u201998 Workshop on Randomized Algorithms, pp. 90\u2013100, 1998."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"M. Mosca, A. Ekert, \u201cThe hidden subgroup problem and eigenvalue estimation on a quantum computer\u201d, Proc. of the 1st NASA International Conference on Quantum Computing and Quantum Communication, 1998.","DOI":"10.1007\/3-540-49208-9_15"},{"key":"24_CR17","unstructured":"S. Parker, M. B. Plenio, \u201cEfficient factorization with a single pure qubit\u201d, Technical report, quant-ph\/0001066, 2000."},{"key":"24_CR18","unstructured":"H. Ritter, Zufallsbits basierend auf dem diskreten Logarithmus, Master Thesis, University of Frankfurt, Dept. of Math., 1992."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, Comm. of the ACM 21:120\u2013126, 1978.","journal-title":"Comm. of the ACM"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"C. R\u00f6ssner, J.-P. Seifert, \u201cApproximating good simultaneous diophantine approximations is almost NP-hard\u201d, Proc. 21st Symposium on Mathematical Foundations of Computer Science, pp. 494\u2013504, 1996.","DOI":"10.1007\/3-540-61550-4_173"},{"key":"24_CR21","volume-title":"An Introduction to Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, An Introduction to Linear and Integer Programming, John Wiley & Sons, New York, 1986."},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"B. E. Kane, \u201cSilicon based quantum computation\u201d, Technical report, quant-ph\/0003031, 2000.","DOI":"10.1002\/3527603182.ch17"},{"key":"24_CR23","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol.2: Seminumerical Algorithms, 3rd ed., Addison-Wesley, Reading MA, 1999."},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"IT-30","author":"A. Shamir","year":"1984","unstructured":"A. Shamir, \u201cA polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem\u201d, IEEE Trans. Inf. Theory IT-30:699\u2013704, 1984.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"P. Shor, \u201cPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer\u201d, SIAM J. Computing 26:1484\u20131509, 1997.","journal-title":"SIAM J. Computing"},{"key":"24_CR26","unstructured":"C. Zalka, \u201cFast version of Shor\u2019s quantum factoring algorithm\u201d, Technical report, quant-ph\/9806084, 1998."}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45353-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T18:35:00Z","timestamp":1708108500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45353-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418986","9783540453536"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45353-9_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}