Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

@article{Hallgren2007PolynomialtimeQA,
  title={Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem},
  author={Sean Hallgren},
  journal={J. ACM},
  year={2007},
  volume={54},
  pages={4:1-4:19}
}
  • Sean Hallgren
  • Published 1 March 2007
  • Mathematics, Computer Science
  • J. ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, Pell's equation is x2 − dy2 = 1 and the goal is to find its integer solutions. Factoring integers reduces to finding integer solutions of Pell's equation, but a reduction in the other direction is not known and appears more difficult. The second problem we solve is the principal ideal problem in real quadratic number fields… 
0 M ay 2 01 2 Quantum Algorithms for One-Dimensional Infrastructures
Infrastructures are group-like objects that make their appearance in arithmetic geometry in the study of computational problems related to number fields and function fields over finite fields. The
Quantum algorithms for one-dimensional infrastructures
TLDR
This work generalizes Hallgren's quantum algorithms for quadratic number fields, while also providing a polynomial speedup over them, and shows that these quantum algorithms can also be applied to infrastructures obtained from complex cubic and totally complex quartic number fields.
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute the unit group of
Quantum binary field inversion: improved circuit depth via choice of basis representation
TLDR
This work shows how the use of Gaussian normal basis representations and of 'ghost-bit basis' representations can be used to implement inverters with a quantum circuit of depth O(mlog(m)), the first construction with sub-quadratic depth reported in the literature.
Quipper: a scalable quantum programming language
TLDR
Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware.
Quipper: a scalable quantum programming language
TLDR
Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware.
Effiziente Quantenalgorithmen (Efficient Quantum Algorithms)
TLDR
The task of designing new quantum algorithms has been proven to be extremely difficult and one large area of problems where a quantum computer appears to be superior to classical computers are the so-called hidden subgroup problems.
Quantum Computation Beyond the
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of
Oracle separations of hybrid quantum-classical circuits
TLDR
This paper shows that, despite the similarities between CQd and QCd, the two models are incomparable, and introduces the notion of an intrinsically stochastic oracle, an oracle whose responses are inherently randomised, which is used for the second result.
Advancements in Applications of Quantum Entanglement
  • Yue Yu
  • Physics
    Journal of Physics: Conference Series
  • 2021
Quantum entanglement, an unknown “spooky action” that confused scientists like Einstein, has become one of the research hotspots in quantum mechanics. Based on the technique, applications distributed
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science, Mathematics
    SIAM Rev.
  • 1999
TLDR
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems.
Quantum Complexity Theory
TLDR
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.
A Key Exchange System Based on Real Quadratic Fields
TLDR
It has been noted subsequently by several authors that any finite abelian group G may be used to replace F x in this scheme as long as the discrete logarithm problem in G is difficult.
Some remarks concerning the complexity of computing class groups of quadratic fields
Abstract Let O be an order of any quadratic number field. In this paper we show that under the assumption of the generalized Riemann hypothesis the following decision problems are in NP ⊃ co-NP: 1.
1989b. A key exchange system based on real quadratic fields (extended abstract)
  • In Advances in Cryptology—CRYPTO ’89,
  • 1989
Normal subgroup reconstruction and quantum computation using group representations
TLDR
It is shown that an immediate generalization of the Abelian case solution to the non-Abelian case does not efficiently solve Graph Isomorphism.
Solving the Pell Equation
Early History of the Pell Equation.- Continued Fractions.- Quadratic Number Fields.- Ideals and Continued Fractions.- Some Special Pell Equations.- The Ideal Class Group.- The Analytic Class Number
ACCEPTED OCTOBER Journal of the ACM
  • ACCEPTED OCTOBER Journal of the ACM
  • 2006
Journal of the ACM
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
TLDR
A quantum algorithm for the dihedral hidden subgroup problem (DHSP) with time and query complexity $2^{O(\sqrt{\log\ N})}$.
...
1
2
3
4
5
...