A Computational Library Using P-adic Arithmetic for Exact Computation With Rational Numbers in Quantum Computing

2005 ◽  
Author(s):  
Chao Lu
Keyword(s):  
Quantum Computing ◽  
Rational Numbers ◽  
Exact Computation

Discrete variable gate-model quantum computing

2019 ◽  
Author(s):  
Mark Fingerhuth ◽  
Tomáš Babej ◽  
Peter Wittek
Keyword(s):  
Quantum Computing ◽  
Discrete Variable

The Joint Universality for L-Functions of Elliptic Curves

2004 ◽  
Vol 9 (4) ◽  
pp. 331-348
Author(s):  
V. Garbaliauskienė
Keyword(s):  
Elliptic Curves ◽  
Rational Numbers ◽  
Joint Universality ◽  
Universality Theorem ◽  
Joint Universality Theorem

A joint universality theorem in the Voronin sense for L-functions of elliptic curves over the field of rational numbers is proved.

Productly linearly independent sequences

2015 ◽  
Vol 52 (3) ◽  
pp. 350-370
Author(s):  
Jaroslav Hančl ◽  
Katarína Korčeková ◽  
Lukáš Novotný
Keyword(s):  
Rational Numbers ◽  
Infinite Products ◽  
Linearly Independent ◽  
New Concepts ◽  
Infinite Sequences

We introduce the two new concepts, productly linearly independent sequences and productly irrational sequences. Then we prove a criterion for which certain infinite sequences of rational numbers are productly linearly independent. As a consequence we obtain a criterion for the irrationality of infinite products and a criterion for a sequence to be productly irrational.

Pembentukan Lapangan Faktor dari Suatu Daerah Integral

2012 ◽  
Vol 8 (2) ◽  
Author(s):  
Tri Widjajanti ◽  
Dahlia Ramlan ◽  
Rium Hilum
Keyword(s):  
Polynomial Ring ◽  
Integral Domain ◽  
Rational Numbers ◽  
Ring Of Integers ◽  
Binary Operations

<em>Ring of integers under the addition and multiplication as integral domain can be imbedded to the field of rational numbers. In this paper we make&nbsp; a construction such that any integral domain can be&nbsp; a field of quotient. The construction contains three steps. First, we define element of field F from elements of integral domain D. Secondly, we show that the binary operations in fare well-defined. Finally, we prove that </em><em>&nbsp;</em><em>f</em><em> </em><em>:</em><em> </em><em>D </em><em>&reg;</em><em> </em><em>F is an isomorphisma. In this case, the polynomial ring F[x] as the integral domain can be imbedded to the field of quotient.</em>

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Sign in / Sign up

Export Citation Format

Share Document