Sökning: "quantum algorithms"

Visar resultat 16 - 20 av 47 avhandlingar innehållade orden quantum algorithms.

  1. 16. Quantum Computing for Airline Planning and Operations

    Författare :Marika Svensson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; quantum technology;

    Sammanfattning : Classical algorithms and mathematical optimization techniques have been used extensively by airlines to optimize their profit and ensure that regulations are followed. In this thesis, we explore which role quantum algorithms can have for airlines. LÄS MER

  3. 17. Numerical algorithms for nonlinear eigenproblems with eigenvector nonlinearities

    Författare :Parikshit Upadhyaya; Elias Jarlebring; Robert Corless; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerical algorithms; nonlinear eigenproblems; multiparameter eigenvalue problem; nonlinear eigenvalue problem; eigenvector nonlinearities; nepv; scf; p-laplacian; quasi-newton; Numerical Analysis; Numerisk analys;

    Sammanfattning : Eigenproblems and their nonlinear generalizations appear as important problems in a wide variety of fields, ranging from quantum chemistry and vibration analysis to macroeconomics and data science. Hence, the development and analysis of numerical algorithms to solve such problems has a broad multiplicative effect on our ability to answer several crucial scientific questions. LÄS MER

  4. 18. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

    Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

    Sammanfattning : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. LÄS MER

  5. 19. Parallelization of dynamic algorithms for electronic structure calculations

    Författare :Anton G. Artemov; Emanuel H. Rubensson; Maya Neytcheva; Bo Kågström; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; parallelization; task-based programming; matrix algorithms; sparse matrices; inverse factorization; localized computations; density matrix methods; electronic structure calculations; Scientific Computing; Beräkningsvetenskap;

    Sammanfattning : The aim of electronic structure calculations is to simulate behavior of complex materials by resolving interactions between electrons and nuclei in atoms at the level of quantum mechanics. Progress in the field allows to reduce the computational complexity of the solution methods to linear so that the computational time scales proportionally to the size of the physical system. LÄS MER

  7. 20. Decryption Failure Attacks on Post-Quantum Cryptography

    Författare :Alexander Nilsson; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Post-quantum cryptography; Code-based cryptography; Lattice-based cryptography; side-channel attack;

    Sammanfattning : This dissertation discusses mainly new cryptanalytical results related to issues of securely implementing the next generation of asymmetric cryptography, or Public-Key Cryptography (PKC).PKC, as it has been deployed until today, depends heavily on the integer factorization and the discrete logarithm problems. LÄS MER