Sökning: "quantum algorithms"

Visar resultat 11 - 15 av 47 avhandlingar innehållade orden quantum algorithms.

  1. 11. Interactions, initial states, and low-dimensional semiconductors

    Författare :Peter Jaksch; Stephanie M. Reimann-Wacker; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Q!uantum mechanical interactions; quantum point contact QPC ; quantum wires; exchange-correlation energy; Reilly model; quantum algorithms; Physics; Fysik;

    Sammanfattning : This thesis is concerned with different aspects of quantum mechanical interactions. The first part of the thesis focuses on their effects in low-dimensional semiconductors; the second part on one of their applications: quantum algorithms, which utilize superpositions created from quantum mechanical interactions. LÄS MER

  2. 12. Side-Channel Analysis of Post-Quantum Cryptographic Algorithms

    Författare :Kalle Ngo; Johnny Öberg; Ingo Sander; Elena Dubrova; Lejla Batina; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Side-channel attack; Post-quantum cryptography; Deep learning; LWE LWR-based KEM; Hardware security; Sidokanalsattack; Postkvantkryptering; Djupinlärning; LWE LWR-baserad KEM; Hårdvarusäkerhet; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Public key cryptographic schemes used today rely on the intractability of certain mathematical problems that are known to be efficiently solvable with a large-scale quantum computer. To address the need for long-term security, in 2016 NIST started a project for standardizing post-quantum cryptography (PQC) primitives that rely on problems not known to be targets for a quantum computer, such as lattice problems. LÄS MER

  3. 13. Algorithms for Molecular Dynamics Simulations

    Författare :Fredrik Hedman; Aatto Laaksonen; Tom Darden; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; molecular dynamics; MD; first principles molecular dynamics; quantum mechanics; liquid water; parallel algorithm; data parallel; MPI; Coulombic interaction; Ewald summation; nonuniform fast Fourier transform; FFT; FFTW; NFFT; ENUF; Physical chemistry; Fysikalisk kemi;

    Sammanfattning : Methods for performing large-scale parallel Molecular Dynamics(MD) simulations are investigated. A perspective on the field of parallel MD simulations is given. Hardware and software aspects are characterized and the interplay between the two is briefly discussed. LÄS MER

  4. 14. New efficient integral algorithms for quantum chemistry

    Författare :Jaime Axel Rosal Sandberg; Zilvinas Rinkevicius; Hans Jørgen Aagaard Jensen; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Teoretisk kemi och biologi; Theoretical Chemistry and Biology;

    Sammanfattning : The contents of this thesis are centered in the developement of new efficient algorithms for molecular integral evaluation in quantum chemistry, as well as new design and implementation strategies for such algorithms aimed at maximizing their performance and the utilization of modern hardware.This thesis introduces the K4+MIRROR algorithm for 2-electron repulsion integrals, a new ERI integral scheme effective for both segmented and general contraction, which surpasses the performance of all previous ERI analytic algorithms published in the literature. LÄS MER

  5. 15. Quantum information processing with tunable and low-loss superconducting circuits

    Författare :Andreas Bengtsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; parametric modulation; quantum information; high coherence; superconducting circuits; circuit quantum electrodynamics;

    Sammanfattning : The perhaps most promising platform for quantum information processing is the circuit-QED architecture based on superconducting circuits representing quantum bits. These circuits must be made with low losses so that the quantum information is retained for as long as possible. LÄS MER