Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  quantum algorithms
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
PL
W pracy zaproponowano zastosowanie modelu uczenia maszynowego do realizacji zadania faktoryzacji liczb całkowitych na iloczyn liczb pierwszych. Podano dwa algorytmy faktoryzacji oraz zaprezentowano model procesora analogowego realizującego powyższe zadanie. Efektywne metody faktoryzacji mają istotne znaczenie w łamaniu szyfrów opartych na systemie kryptograficznym RSA.
EN
In this paper a model for factorization of integer numbers on the product of prime numbers is presented. Two algorithms of factorization and a model of analog processor accomplishing the task of factorization are provided. Effective factoring methods are important in breaking codes on the RSA cryptographic system.
EN
In this paper, we analyze existing quantum computer simulation techniques and their realizations to minimize the impact of the exponential complexity of simulated quantum computations. As a result of this investigation, we propose a quantum computer simulator with an integrated development environment – QuIDE – supporting the development of algorithms for future quantum computers. The simulator simplifies building and testing quantum circuits and understanding quantum algorithms in an efficient way. The development environment provides flexibility of source code edition and ease of the graphical building of circuit diagrams. We also describe and analyze the complexity of algorithms used for simulation as well as present performance results of the simulator as well as results of its deployment during university classes.
EN
We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.
4
Content available Control parameters for the quantum Deutsch algorithm
EN
An example of two-qubit scenario for finding an optimal control parameters on a spin chain to implement the quantum Deutsch algorithm is provided. Two cases are studied in this paper: two-qubit and three-qubit systems. The latter case is used to study the impact of interaction with an environment on the outcome of the algorithm.
PL
Przedstawiono przykład dwu-kubitowego znajdowania optymalnych wartości kontrolnych łańcucha spinowego implementującego kwantowy algorytm Deutscha. W tym artykule rozważane są dwa przypadki: systemy dwu-kubitowe i trój-kubitowe. Ostatni przypadek jest użyty do zbadania wpływu oddziaływania ze środowiskiem na wynik algorytmu.
PL
W artykule przedstawiono analizę możliwości wykorzystania obliczeń kwantowych do zapewnienia bezpieczeństwa transmisji i przetwarzania danych w rozproszonym systemie pomiarowym. Omówiono zagrożenia dla poufności danych w takim systemie oraz ich źródła. Przedstawiono ideę komputera kwantowego i kwantowego kanału transmisyjnego oraz potencjalne sposoby wykorzystania ich w celu zapewnienia bezpieczeństwa danych pomiarowych i sterujących.
EN
The paper deals with the analysis of possible implementation of the quantum computations to ensure security of data transmission and processing in the distributed measurement system. Firstly, sources of security threats (mainly the transmission media) in the typical system are presented. Then, two applications of quantum computing are presented to defend the system against the intruders. The first one, the quantum transmission channel, is reliable, safe and can be implemented using today technology. The paper describes the BB84 algorithm that ensures the safe data transfer. Another one, the quantum computer, is a device of novel computational capabilities, which can be used to break contemporary cryptographic systems (such as RSA). The paper considers possible cryptographic algo-rithms that could be resilient to the attack using such device. All methods are discussed from the measuring systems point of view and refer to their specific characteristics. Finally, conclusions and future prospects are presented.
6
Content available remote Nano and quantum systems of informatics
EN
The fundamental concepts of nano and quantum systems of informatics have been presented. The nanotechnological processes taking place in biological systems of informatics have been discussed in terms of informatics. Presented analysis shows that the application of nanotechonologies in the technical informatic systems enables realization of processes for formation of products and objects with self-replication feature, similarly to the processes existing in biological informatic systems. It seems also that the quantum technologies enable further miniaturization of the technical systems of informatics as well as make the execution time of some computing processes like, e.g. Shor's and Grover's algorithms, shorter.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.