3,641 research outputs found
A Note on Integer Factorization Using Lattices
We revisit Schnorr's lattice-based integer factorization algorithm, now with
an effective point of view. We present effective versions of Theorem 2 of
Schnorr's "Factoring integers and computing discrete logarithms via diophantine
approximation" paper, as well as new elementary properties of the Prime Number
Lattice bases of Schnorr and Adleman
New practical algorithms for the approximate shortest lattice vector
We present a practical algorithm that given an LLL-reduced lattice basis of dimension n, runs in time O(n3(k=6)k=4+n4) and approximates the length of the shortest, non-zero lattice vector to within a factor (k=6)n=(2k). This result is based on reasonable heuristics. Compared to previous practical algorithms the new method reduces the proven approximation factor achievable in a given time to less than its fourthth root. We also present a sieve algorithm inspired by Ajtai, Kumar, Sivakumar [AKS01]
Modular Las Vegas Algorithms for Polynomial Absolute Factorization
Let f(X,Y) \in \ZZ[X,Y] be an irreducible polynomial over \QQ. We give a
Las Vegas absolute irreducibility test based on a property of the Newton
polytope of , or more precisely, of modulo some prime integer . The
same idea of choosing a satisfying some prescribed properties together with
is used to provide a new strategy for absolute factorization of .
We present our approach in the bivariate case but the techniques extend to the
multivariate case. Maple computations show that it is efficient and promising
as we are able to factorize some polynomials of degree up to 400
Layered architecture for quantum computing
We develop a layered quantum computer architecture, which is a systematic
framework for tackling the individual challenges of developing a quantum
computer while constructing a cohesive device design. We discuss many of the
prominent techniques for implementing circuit-model quantum computing and
introduce several new methods, with an emphasis on employing surface code
quantum error correction. In doing so, we propose a new quantum computer
architecture based on optical control of quantum dots. The timescales of
physical hardware operations and logical, error-corrected quantum gates differ
by several orders of magnitude. By dividing functionality into layers, we can
design and analyze subsystems independently, demonstrating the value of our
layered architectural approach. Using this concrete hardware platform, we
provide resource analysis for executing fault-tolerant quantum algorithms for
integer factoring and quantum simulation, finding that the quantum dot
architecture we study could solve such problems on the timescale of days.Comment: 27 pages, 20 figure
Silicon-based spin and charge quantum computation
Silicon-based quantum-computer architectures have attracted attention because
of their promise for scalability and their potential for synergetically
utilizing the available resources associated with the existing Si technology
infrastructure. Electronic and nuclear spins of shallow donors (e.g.
phosphorus) in Si are ideal candidates for qubits in such proposals due to the
relatively long spin coherence times. For these spin qubits, donor electron
charge manipulation by external gates is a key ingredient for control and
read-out of single-qubit operations, while shallow donor exchange gates are
frequently invoked to perform two-qubit operations. More recently, charge
qubits based on tunnel coupling in P substitutional molecular ions in Si
have also been proposed. We discuss the feasibility of the building blocks
involved in shallow donor quantum computation in silicon, taking into account
the peculiarities of silicon electronic structure, in particular the six
degenerate states at the conduction band edge. We show that quantum
interference among these states does not significantly affect operations
involving a single donor, but leads to fast oscillations in electron exchange
coupling and on tunnel-coupling strength when the donor pair relative position
is changed on a lattice-parameter scale. These studies illustrate the
considerable potential as well as the tremendous challenges posed by donor spin
and charge as candidates for qubits in silicon.Comment: Review paper (invited) - to appear in Annals of the Brazilian Academy
of Science
- …