|
|
|
|
|
Marin Vidakovic and Kruno Milicevic
The continuous development of quantum computing necessitates the development of quantum-resistant cryptographic algorithms. In response to this demand, the National Institute of Standards and Technology selected standardized algorithms including Crystals...
ver más
|
|
|
|
|
|
|
|
|
Beimbet Daribayev, Aksultan Mukhanbet and Timur Imankulov
The Poisson equation is a fundamental equation of mathematical physics that describes the potential distribution in static fields. Solving the Poisson equation on a grid is computationally intensive and can be challenging for large grids. In recent years...
ver más
|
|
|
|
|
|
|
|
|
Hristo Tonchev and Petar Danev
In this work, the quantum random walk search algorithm with a walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with an arbitrary dimension. Monte Carlo simulations, in combi...
ver más
|
|
|
|
|
|
|
|
|
Youssef Moawad, Wim Vanderbauwhede and René Steijl
As quantum computing technology continues to develop, the need for research into novel quantum algorithms is growing. However, such algorithms cannot yet be reliably tested on actual quantum hardware, which is still limited in several ways, including qub...
ver más
|
|
|
|
|
|
|
|
|
Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo and Eleanor G. Rieffel
We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of w...
ver más
|
|
|
|