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 条
  • [41] NEW ANALYTICAL RESULTS IN SUBSET-SUM PROBLEM (VOL 114, PG 205, 1993)
    FREIMAN, GA
    DISCRETE MATHEMATICS, 1994, 126 (1-3) : 447 - 447
  • [42] WORST-CASE ANALYSIS OF GREEDY ALGORITHMS FOR THE UNBOUNDED KNAPSACK, SUBSET-SUM AND PARTITION PROBLEMS
    LAI, TC
    OPERATIONS RESEARCH LETTERS, 1993, 14 (04) : 215 - 220
  • [43] Software snippet provides improved subset-sum algorithm
    Basov, I
    EDN, 2003, 48 (21) : 68 - +
  • [44] A subset-sum type formulation of a two-agent single-machine scheduling problem
    Avolio, Matteo
    Fuduli, Antonio
    INFORMATION PROCESSING LETTERS, 2020, 155
  • [45] A NEW LINEAR-STORAGE, POLYNOMIAL-TIME APPROXIMATION SCHEME FOR THE SUBSET-SUM PROBLEM
    FISCHETTI, M
    DISCRETE APPLIED MATHEMATICS, 1990, 26 (01) : 61 - 77
  • [46] Security of Knapsack Cryptosystem Using Subset-Sum Decision Problem against Alternative-Solution Attack
    Murakami, Yasuyuki
    Sakai, Ryuichi
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 614 - 617
  • [47] Quantum algorithm and experimental demonstration for the subset sum problem
    Qilin Zheng
    Pingyu Zhu
    Shichuan Xue
    Yang Wang
    Chao Wu
    Xinyao Yu
    Miaomiao Yu
    Yingwen Liu
    Mingtang Deng
    Junjie Wu
    Ping Xu
    Science China Information Sciences, 2022, 65
  • [48] Quantum algorithm and experimental demonstration for the subset sum problem
    Zheng, Qilin
    Zhu, Pingyu
    Xue, Shichuan
    Wang, Yang
    Wu, Chao
    Yu, Xinyao
    Yu, Miaomiao
    Liu, Yingwen
    Deng, Mingtang
    Wu, Junjie
    Xu, Ping
    SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (08)
  • [49] Quantum algorithm and experimental demonstration for the subset sum problem
    Qilin ZHENG
    Pingyu ZHU
    Shichuan XUE
    Yang WANG
    Chao WU
    Xinyao YU
    Miaomiao YU
    Yingwen LIU
    Mingtang DENG
    Junjie WU
    Ping XU
    ScienceChina(InformationSciences), 2022, 65 (08) : 261 - 274
  • [50] Efficient Parallelization of a Two-List Algorithm for the Subset-Sum Problem on a Hybrid CPU/GPU Cluster
    Kang, Letian
    Wan, Lanjun
    Li, Kenli
    2014 SIXTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2014, : 93 - 98
12345