Quantum Algorithms for the Subset-Sum Problem

被引：0
|
作者：
Bernstein, Daniel J. [1 ,2 ]
Jeffery, Stacey [3 ]
Lange, Tanja [2 ]
Meurer, Alexander [4 ]
机构：
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[2] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
[4] Ruhr Univ Bochum, Horst Gortz Inst IT Secur, Bochum, Germany
来源：
POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2013 | 2013年 / 7932卷
关键词：
subset sum; quantum search; quantum walks; radix trees; decoding; SVP; CVP; DISCRETE LOGARITHMS;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham-Joux subset-sum algorithm with a new stream-lined data structure for quantum walks on Johnson graphs.
引用
收藏
页码：16 / 33
页数：18
相关论文
共 50 条
  • [1] Quantum Algorithms of the Subset-sum Problem on a Quantum Computer
    Chang, Weng-Long
    Ren, Ting-Ting
    Feng, Mang
    Lu, Lai Chin
    Lin, Kawuu Weicheng
    Guo, Minyi
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 54 - +
  • [2] Priority algorithms for the Subset-Sum problem
    Ye, Yuli
    Borodin, Allan
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 504 - +
  • [3] Priority algorithms for the subset-sum problem
    Yuli Ye
    Allan Borodin
    Journal of Combinatorial Optimization, 2008, 16 : 198 - 228
  • [4] Priority algorithms for the subset-sum problem
    Ye, Yuli
    Borodin, Allan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2008, 16 (03) : 198 - 228
  • [5] Two linear approximation algorithms for the subset-sum problem
    Kellerer, H
    Mansini, R
    Speranza, MG
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 289 - 296
  • [6] Integer factorization as subset-sum problem
    Hittmeir, Markus
    JOURNAL OF NUMBER THEORY, 2023, 249 : 93 - 118
  • [7] WORST-CASE ANALYSIS OF GREEDY ALGORITHMS FOR THE SUBSET-SUM PROBLEM
    MARTELLO, S
    TOTH, P
    MATHEMATICAL PROGRAMMING, 1984, 28 (02) : 198 - 205
  • [8] Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem
    Güntzer, MM
    Jungnickel, D
    OPERATIONS RESEARCH LETTERS, 2000, 26 (02) : 55 - 66
  • [9] A FAST APPROXIMATION ALGORITHM FOR THE SUBSET-SUM PROBLEM
    GENS, G
    LEVNER, E
    INFOR, 1994, 32 (03) : 143 - 148
  • [10] An improved balanced algorithm for the subset-sum problem
    Curtis, V. V.
    Sanches, C. A. A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (02) : 460 - 466
12345