A Aralex Aachen research explorer

October 01, 1997 article Open access

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing

DOI: 10.1137/s0097539795293172 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 26 stored of 6,063

Circuit complexity as a novel probe of quantum entanglement: A study with black hole gas in arbitrary dimensions
2021 Physical review. D/Physical review. D. article Physics and Astronomy Black Holes and Theoretical Physics Open access

32

citations
Modelling for Quantum Error Mitigation
2021 IEEE International Conference on Software Architecture Companion (ICSA-C) conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

2

citations
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
2021 Journal of the ACM article Computer Science Cryptography and Data Security Open access

20

citations
Benchmarking the quantum approximate optimization algorithm
2020 Quantum Information Processing article Computer Science Quantum Computing Algorithms and Architecture Open access cited by 4 patents

125

citations
OpenFermion: the electronic structure package for quantum computers
2020 Quantum Science and Technology article Computer Science Quantum Computing Algorithms and Architecture Open access cited by 6 patents

466

citations
Benchmarking the quantum approximate optimization algorithm
2020 RWTH Publications (RWTH Aachen) article Computer Science Quantum Computing Algorithms and Architecture Open access

109

citations

References 0