Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Factorization

R. Mack, Wolfgang P. Schleich, Daniel Haase, Helmut Maier

Published Mar 18, 2009• 2 citations
Publisher

Abstract

This chapter contains sections titled: Introduction How to Factor Numbers How to Find the Period of a Function: The Magic Role of Entanglement Analogy with Atom Optics Exponential Growth of Hilbert Space as a Resource of Exponential Speedup Conclusions Modular Arithmetic Chinese Remainder Theorem Euler's Function Euclidean Algorithm Primitive Root Probability for Lucky Choice Elements of AtomOptics Factorization with a Gauss Sum due to its Periodicity References

DOI
10.1002/9783527628025.ch15

Related papers

Factorization of Numbers with Physical Systems

Wolfgang Merkel, Ilya Sh. Averbukh, B. Girard +3 more

This chapter contains sections titled: Introduction Chirping a Two-photon Transition Chirped Laser Pulses Excitation Probability Amplitude Example for Factorization Driving a One-photon Transition Model Floquet Ladder Pulse Train Factorization Factorization with Floquet Ladder Factorization with a Pulse Train NMR-experiment Conclusions References

Wiley eBooks•Jan 26, 2007•1 citation

Quantum Algorithms for Number Fields

Daniel Haase, Helmut Maier

This chapter contains sections titled: Introduction Outline of the Survey Why Number Fields? Some History of the Subject Geometry of Numbers Number Fields Lattices Integral Elements The Class Number The Regulator Complexity Results Reduction Reduced Ideals Infrastructure Geometric Interpretation of G Results from Analytic Number Theory Distribution of Prime Numbers Class Number Formulas Examples of Minima Distributions Computing the Regulator Real Quadratic Case Hallgren's Algorithm Generalization of the Weak Periodicity Condition Computation of Other Invariants The Principal Ideal Problem Computing the Class Number References

Wiley eBooks•Jan 26, 2007•1 citation

Isomorphism and Factorization – Classical and Quantum Algorithms

Sebastian Dörn, Daniel Haase, Jacobo Torán +1 more

This chapter contains sections titled: Introduction Factorization of Integers: Classical Algorithms Graph Isomorphism: Classical Algorithms Quantum Algorithms for Integer Factorization Quantum Approach to Graph Isomorphism Reductions of Integer Factorization and Graph Isomorphism to Ring Isomorphism References

Wiley eBooks•Mar 18, 2009•2 citations

Factorization of numbers with Gauss sums: I. Mathematical background

Sabine Wölk, W. Merkel, Wolfgang P. Schleich +2 more

We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and scales exponentially.

arXiv:1210.6474•New Journal of Physics•Oct 7, 2011•22 citations

Factorization of numbers with Gauss sums: III. Algorithms with entanglement

S Wölk, W P Schleich

We propose two algorithms to factor numbers using Gauss sums and entanglement: (i) in a Shor-like algorithm we encode the standard Gauss sum in one of two entangled states and (ii) in an interference algorithm we create a superposition of Gauss sums in the probability amplitudes of two entangled states. These schemes are rather efficient provided that there exists a fast algorithm that can detect a period of a function hidden in its zeros.

arXiv:1210.6491•New Journal of Physics•Jan 24, 2012•4 citations

Quantum Algorithms

Julia Kempe

This chapter contains sections titled: Introduction Precursors Shor's Factoring Algorithm Grover's Algorithm Other Algorithms Recent Developments

Wiley eBooks•Nov 6, 2006•1 citation
This chapter contains sections titled: Introduction How to Factor Numbers How to Find the Period of a Function: The Magic Role of Entanglement Analogy with Atom Optics Exponential Growth of Hilbert Space as a Resource of Exponential Speedup Conclusions Modular Arithmetic Chinese Remainder Theorem Euler's Function Euclidean Algorithm Primitive Root Probability for Lucky Choice Elements of AtomOptics Factorization with a Gauss Sum due to its Periodicity References
This chapter contains sections titled: Introduction Outline of the Survey Why Number Fields? Some History of the Subject Geometry of Numbers Number Fields Lattices Integral Elements The Class Number The Regulator Complexity Results Reduction Reduced Ideals Infrastructure Geometric Interpretation of G Results from Analytic Number Theory Distribution of Prime Numbers Class Number Formulas Examples of Minima Distributions Computing the Regulator Real Quadratic Case Hallgren's Algorithm Generalization of the Weak Periodicity Condition Computation of Other Invariants The Principal Ideal Problem Computing the Class Number References