Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Blum-Micali (1)
- Clustering (1)
- Computational complexity (1)
- Finite element method (1)
- Fluid dynamics (1)
-
- Graph (1)
- Greedy algorithm (1)
- Least Squares (1)
- Matlab (1)
- Minimization (1)
- NP complete (1)
- Navier-Stokes (1)
- Network (1)
- Numerical analysis (1)
- Partial differential equations (1)
- Poisson's equation (1)
- Pseudorandom (1)
- Quantum Computation (1)
- Quantum computing (1)
- Set covering problem (1)
- Synchronization (1)
- System of harmonic oscillators (1)
- Turing machine (1)
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Applied Mathematics
Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng
Analysis Of A Quantum Attack On The Blum-Micali Pseudorandom Number Generator, Tingfei Feng
Mathematical Sciences Technical Reports (MSTR)
In 2012, Guedes, Assis, and Lula proposed a quantum attack on a pseudorandom number generator named the Blum-Micali Pseudorandom number generator. They claimed that the quantum attack can outperform classical attacks super-polynomially. However, this paper shows that the quantum attack cannot get the correct seed and provides another corrected algorithm that is in exponential time but still faster than the classical attack. Since the original classical attacks are in exponential time, the Blum-Micali pseudorandom number generator would be still quantum resistant.
Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden
Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden
Rose-Hulman Undergraduate Mathematics Journal
The Navier-Stokes equations are used to model fluid flow. Examples include fluid structure interactions in the heart, climate and weather modeling, and flow simulations in computer gaming and entertainment. The equations date back to the 1800s, but research and development of numerical approximation algorithms continues to be an active area. To numerically solve the Navier-Stokes equations we implement a least squares finite element algorithm based on work by Roland Glowinski and colleagues. We use the deal.II academic library , the C++ language, and the Linux operating system to implement the solver. We investigate convergence rates and apply the least squares …
The Primitive Root Problem: A Problem In Bqp, Shixin Wu
The Primitive Root Problem: A Problem In Bqp, Shixin Wu
Mathematical Sciences Technical Reports (MSTR)
Shor’s algorithm proves that the discrete logarithm problem is in BQP. Based on his algorithm, we prove that the primitive root problem, a problem that verifies if some integer g is a primitive root modulo p where p is the largest prime number smaller than 2n for a given n, which is assumed to be harder than the discrete logarithm problem, is in BQP by using an oracle quantum Turing machine.
Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu
Computer Program Simulation Of A Quantum Turing Machine With Circuit Model, Shixin Wu
Mathematical Sciences Technical Reports (MSTR)
Molina and Watrous present a variation of the method to simulate a quantum Turing machine employed in Yao’s 1995 publication “Quantum Circuit Complexity”. We use a computer program to implement their method with linear algebra and an additional unitary operator defined to complete the details. Their method is verified to be correct on a quantum Turing machine.
Algorithms To Approximate Solutions Of Poisson's Equation In Three Dimensions, Ray Dambrose
Algorithms To Approximate Solutions Of Poisson's Equation In Three Dimensions, Ray Dambrose
Rose-Hulman Undergraduate Mathematics Journal
The focus of this research was to develop numerical algorithms to approximate solutions of Poisson's equation in three dimensional rectangular prism domains. Numerical analysis of partial differential equations is vital to understanding and modeling these complex problems. Poisson's equation can be approximated with a finite difference approximation. A system of equations can be formed that gives solutions at internal points of the domain. A computer program was developed to solve this system with inputs such as boundary conditions and a nonhomogenous source function. Approximate solutions are compared with exact solutions to prove their accuracy. The program is tested with an …
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Variance Of Clusterings On Graphs, Thomas Vlado Mulc
Mathematical Sciences Technical Reports (MSTR)
Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.
Spontaneous Synchrony On Graphs And The Emergence Of Order From Disorder, Dylan Linville, Daniel Trugillo Martins Fontes
Spontaneous Synchrony On Graphs And The Emergence Of Order From Disorder, Dylan Linville, Daniel Trugillo Martins Fontes
Rose-Hulman Undergraduate Research Publications
From pulsars to pedestrians and bacteria to brain cells, objects that exhibit cyclical behavior, called oscillators, are found in a variety of different settings. When oscillators adjust their behavior in response to nearby oscillators, they often achieve a state of synchrony, in which they all have the same phase and frequency. Here, we explore the Kuramoto model, a simple and general model which describes oscillators as dynamical systems on a graph and has been used to study synchronization in systems ranging from firefly swarms to the power grid. We discuss analytical and numerical methods used to investigate the governing system …
Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer
Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer
Mathematical Sciences Technical Reports (MSTR)
This paper is concerned with finding two solutions of a set covering problem that have a minimum number of variables in common. We show that this problem is NP complete, even in the case where we are only interested in completely disjoint solutions. We describe three heuristic methods based on the standard greedy algorithm for set covering problems. Two of these algorithms find the solutions sequentially, while the third finds them simultaneously. A local search method for reducing the overlap of the two given solutions is then described. This method involves the solution of a reduced set covering problem. Finally, …