ON THE SIMULTANEOUS DIOPHANTINE APPROXIMATION OF NEW PRODUCTS

Analysis ◽  
2000 ◽  
Vol 20 (4) ◽  
pp. 387-394 ◽  
Author(s):  
Peter Bundschuh ◽  
Keijo Väänänen
Keyword(s):  
Diophantine Approximation ◽  
New Products ◽  
Simultaneous Diophantine Approximation

scholarly journals KHINTCHINE'S THEOREM AND TRANSFERENCE PRINCIPLE FOR STAR BODIES

2006 ◽  
Vol 02 (03) ◽  
pp. 431-453
Author(s):  
M. M. DODSON ◽  
S. KRISTENSEN
Keyword(s):  
Distance Function ◽  
Diophantine Approximation ◽  
Direct Proof ◽  
Distance Functions ◽  
Transference Principle ◽  
Simultaneous Diophantine Approximation ◽  
Star Bodies

Analogues of Khintchine's Theorem in simultaneous Diophantine approximation in the plane are proved with the classical height replaced by fairly general planar distance functions or equivalently star bodies. Khintchine's transference principle is discussed for distance functions and a direct proof for the multiplicative version is given. A transference principle is also established for a different distance function.

scholarly journals Vertical Shift and Simultaneous Diophantine Approximation on Polynomial Curves

2014 ◽  
Vol 58 (1) ◽  
pp. 1-26
Author(s):  
Faustin Adiceam
Keyword(s):  
Hausdorff Dimension ◽  
Diophantine Approximation ◽  
Rational Approximations ◽  
Vertical Shift ◽  
Polynomial Curves ◽  
Integer Coefficients ◽  
Simultaneous Diophantine Approximation ◽  
First Results

AbstractThe Hausdorff dimension of the set of simultaneously τ-well-approximable points lying on a curve defined by a polynomial P(X) + α, where P(X) ∈ ℤ[X] and α ∈ ℝ, is studied when τ is larger than the degree of P(X). This provides the first results related to the computation of the Hausdorff dimension of the set of well-approximable points lying on a curve that is not defined by a polynomial with integer coefficients. The proofs of the results also include the study of problems in Diophantine approximation in the case where the numerators and the denominators of the rational approximations are related by some congruential constraint.

scholarly journals QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS

2013 ◽  
Vol 11 (01) ◽  
pp. 1350008
Author(s):  
CHEN-FU CHIANG
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Diophantine Approximation ◽  
Great Difficulty ◽  
Quantum Computers ◽  
Phase Estimation ◽  
Quantum Fourier Transform ◽  
Factorization Algorithm ◽  
Simultaneous Diophantine Approximation ◽  
Parallel Circuits

Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose we have additional k qubits available. Given such a constraint k, we propose an approach for the phase estimation for an eigenphase of exactly n-bit precision. This approach adopts the standard recursive circuit for quantum Fourier transform (QFT) in [R. Cleve and J. Watrous, Fast parallel circuits for quantum fourier transform, Proc. 41st Annual Symp. on Foundations of Computer Science (2000), pp. 526–536.] and adopts classical bits to implement such a task. Our algorithm has the complexity of O(n log k), instead of O(n2) in the conventional QFT, in terms of the total invocation of rotation gates. We also design a scheme to implement the factorization algorithm by using k available qubits via either the continued fractions approach or the simultaneous Diophantine approximation.

Sign in / Sign up

Export Citation Format

Share Document