Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "quantum computation" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    From quantum logic to quantum computational logic
    Autorzy:
    Caponigro, M.
    Mancini, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1955359.pdf
    Data publikacji:
    2006
    Wydawca:
    Politechnika Gdańska
    Tematy:
    quantum logic
    quantum computation
    Opis:
    We overview the main concepts of quantum logic ranging from the orthodox formulation to the quantum computational aspects.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2006, 10, 1; 5-19
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Quantum Computer - What Does It Means?
    Autorzy:
    Kosiński, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/92895.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
    Tematy:
    qubit
    quantum gate
    quantum algorithm
    quantum computation
    Opis:
    In a classical measurement the Shannon information is a natural measure of our ignorance about properties of a system. There, observation removes that ignorance in revealing properties of the system which can be considered to preexist prior to and independent of observation. Because of the completely different root of a quantum measurement as compared to a classical measurement, conceptual difficulties arise when we try to define the information gain in a quantum measurement using the notion of Shannon information. In contrast to classical measurements, quantum measurements, with very few exceptions, cannot be claimed to reveal a property of the individual quantum system existing before the measurement is performed. A mathematical theory of computation that is based on quantum physics is bound to be different. They are the analogues for quantum computers to classical logic gates for conventional digital computers. Although quantum gates work on qubits in a much different fashion from standard electronic circuits, they only differ in their basic effects in one sense: reversibility.
    Źródło:
    Studia Informatica : systems and information technology; 2007, 1(8); 77-96
    1731-2264
    Pojawia się w:
    Studia Informatica : systems and information technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Extending scientific computing system with structural quantum programming capabilities
    Autorzy:
    Gawron, P.
    Klamka, J.
    Miszczak, J.
    Winiarczyk, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/199942.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    quantum information
    quantum programming
    models of quantum computation
    Opis:
    We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave providing library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for higl-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices implemented in quantum-octave.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2010, 58, 1; 77-88
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Towards a novel environment for simulation of quantum computing
    Autorzy:
    Patrzyk, J.
    Patrzyk, B.
    Rycerz, K.
    Bubak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/305327.pdf
    Data publikacji:
    2015
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    quantum computation
    quantum computer simulators
    development environment
    quantum algorithms
    SUS survey
    Opis:
    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.
    Źródło:
    Computer Science; 2015, 16 (1); 103-129
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary algorithm inspired by the methods of quantum computer sciences for the improvement of a neural model of the electric power exchange
    Autorzy:
    Tchórzewski, J.
    Ruciński, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/94729.pdf
    Data publikacji:
    2017
    Wydawca:
    Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
    Tematy:
    Artificial Neural Network
    Matlab language
    modelling
    quantum computation
    Polish Power Exchange
    day ahead market
    Opis:
    The work contains results of research on the possibility to improve the neural model of the Electric Power Exchange (polish: Towarowa Giełda Energii Elektrycznej – TGEE) in MATLAB and Simulink environment using evolutionary algorithm inspired by quantum computer science. The developed artificial neural network was trained using data for the Day Ahead Market, assuming the joint volume of supplied and sold electrical energy [MWh] as the input quantities in each hour of the 24-hour day, and average prices [PLN/MWh] as output quantities. The obtained model of the exchange system was improved using the evolutionary algorithm, and further improvement in the accuracy of the model by supplementing the evolutionary algorithm using quantum solutions, related to the initial population, crossover and mutation operators, selection, etc. were proposed.
    Źródło:
    Information Systems in Management; 2017, 6, 4; 343-355
    2084-5537
    2544-1728
    Pojawia się w:
    Information Systems in Management
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Natural quantum operational semantics with predicates
    Autorzy:
    Sawerwain, M.
    Gierelak, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/907907.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    obliczenia kwantowe
    predykat
    program kwantowy
    kwantowy system przejścia
    quantum computation
    predicate notion for quantum programs
    quantum labelled transition systems
    Opis:
    A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the existence of a GSOS format for quantum labelled transition systems. The first theorem is a slight generalisation of D’Hondt and Panagaden’s theorem about the quantum weakest precondition in terms of discrete support positive operator-valued measures.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 341-359
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A novel variant of the salp swarm algorithm for engineering optimization
    Autorzy:
    Jia, Fuyun
    Luo, Sheng
    Yin, Guan
    Ye, Yin
    Powiązania:
    https://bibliotekanauki.pl/articles/23944824.pdf
    Data publikacji:
    2023
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    salp swarm algorithm
    meta-heuristic algorithm
    chaos theory
    sine-cosine mechanism
    quantum computation
    optimization design of engineering
    Opis:
    There are many design problems need to be optimized in various fields of engineering, and most of them belong to the NP-hard problem. The meta-heuristic algorithm is one kind of optimization method and provides an effective way to solve the NP-hard problem. Salp swarm algorithm (SSA) is a nature-inspired algorithm that mimics and mathematically models the behavior of slap swarm in nature. However, similar to most of the meta-heuristic algorithms, the traditional SSA has some shortcomings, such as entrapment in local optima. In this paper, the three main strategies are adopted to strengthen the basic SSA, including chaos theory, sine-cosine mechanism and the principle of quantum computation. Therefore, the SSA variant is proposed in this research, namely SCQ-SSA. The representative benchmark functions are employed to test the performances of the algorithms. The SCQ-SSA are compared with the seven algorithms in high-dimensional functions (1000 dimensions), seven SSA variants and six advanced variants on benchmark functions, the experiment reveals that the SCQ-SSA enhances resulting precision and alleviates local optimal problems. Besides, the SCQ-SSA is applied to resolve three classical engineering problems: tubular column design problem, tension/compression spring design problem and pressure vessel design problem. The design results indicate that these engineering problems are optimized with high accuracy and superiority by the improved SSA. The source code is available in the URL: https://github.com/ye-zero/SCQSSA/tree/main/SCQ-SSA.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2023, 13, 3; 131--149
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Review on Performances of Reversible Ripple-Carry Adders
    Autorzy:
    Burignat, S.
    De Vos, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/227089.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    reversible computation
    design
    implementation
    pass-transistor logic
    ripple-carry adder
    sum-difference block
    Spectre simulation
    quantum computation
    adiabatic signal
    test and measurement
    error propagation
    Opis:
    Quantum computing and circuits are of growing interest and so is reversible logic as it plays an important role in the synthesis of quantum circuits. Moreover, reversible logic provides an alternative to classical computing machines, that may overcome many of the power dissipation problems in the near future. Some ripple-carry adders based on a do-spy-undo structure have been designed and tested reversibly. This paper presents a brief overview of the performances obtained with such chips processed in standard 0.35 um CMOS technology and used in true reversible calculation (computations are performed forwards and backwards such that addition and subtraction are made reversibly with the same chip). Adiabatic signals used are known to allow the signal energy stored on the various capacitances of the circuit to be redistributed rather than being dissipated as heat while allowing to avoid calculation errors introduced by the use of conventional rectangular pulses. Through the example of both simulations and experimental results, this paper aims at providing a base of knowledge and knowhow in physical implementation of reversible circuits.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 3; 205-212
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Symulacja metody kwantowych trajektorii dla problemów optyki kwantowej oraz informatyki kwantowej
    Simulating the quantum trajectories method for problems related to quantum optics and quantum computing
    Autorzy:
    Wiśniewska, J.
    Sawerwain, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/404272.pdf
    Data publikacji:
    2015
    Wydawca:
    Polskie Towarzystwo Symulacji Komputerowej
    Tematy:
    metoda kwantowych trajektorii
    symulacja kwantowych systemów otwartych
    obliczenia numeryczne
    technologia CUDA
    obliczenia GPU
    quantum trajectories method
    simulation of open quantum systems
    numerical computations
    CUDA technology
    GPU computation
    Opis:
    W artykule została przedstawiona równoległa implementacja odmiany metody Monte Carlo do symulacji dynamiki kwantowych systemów otwartych – jest to tzw. metoda kwantowych trajektorii (QTM). Implementacja została wykonana za pomocą technologii CUDA i obejmuje ona realizację procedury numerycznej odpowiedzialnej za algorytm QTM. W artykule została też pokazana wydajność otrzymanych metod numerycznych dla QTM w stosunku do innych znanych implementacji.
    The chapter contains a parallel implementation of Monte Carlo method for simulating the open quantum systems’ dynamics. The mentioned approach is the Quantum Trajectories Method (QTM). The implementation is carried out with use of CUDA technology and it is based on a numerical procedure realizing QTM algorithm. The chapter presents also a comparison of elaborated numerical methods’ performance in comparison to other existing implementations.
    Źródło:
    Symulacja w Badaniach i Rozwoju; 2015, 6, 1; 67-75
    2081-6154
    Pojawia się w:
    Symulacja w Badaniach i Rozwoju
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies