Introduction to Quantum Computing
Linnaeus University (Kalmar Växjö)
Start date:
End date:
Pace of study: 50 %
Published education catalogue
Education information from the published source. The education record and its time-bound offerings are kept separate.
Code: 4FY590
Classical computers are based on bits, which are either 0 or 1. Quantum computers, on the other hand, use qubits, which can be both 0 and 1 simultaneously, thanks to a phenomenon called superposition. This allows quantum computers to process much more information at once. Another unique feature is entanglement, where qubits affect each other regardless of distance, enabling faster problem solving. In quantum computers, quantum gates like the Hadamard and Pauli gates are used to manipulate qubits. Algorithms such as Shor's factoring algorithm and Grover's search algorithm demonstrate quantum computers' ability to solve problems faster than classical computers. In fields like quantum chemistry, quantum computers can simulate molecules and calculate energies with high precision. Quantum cryptography and quantum teleportation open new doors for secure communication. The development of physical qubits — from ion traps to superconducting circuits — is ongoing, though challenges like decoherence, where qubits lose their quantum information, require advanced error-correction techniques. Recent advancements have improved the performance of quantum computers, and although the technology is still young, it is expected to soon revolutionize both science and industry.
General entry requirements for secondÂcycle studies and specific entry requirements: A bachelor in physics or engineering physics; or: a bachelor in chemistry, mathematics, or computer science with a good knowledge of basic quantum mechanics or equivalent. English 6
Each offering has its own dates and conditions. Closed offerings are retained as history and do not mean that a new application is open.
Linnaeus University (Kalmar Växjö)
Start date:
End date:
Pace of study: 50 %
Retrieved: .
Published: .
Publication version: 8e217193-f5fa-4778-b085-a4521fd03e8d
Checksum: 1b0dc54c0fc8a359f83ba9dc8f9d468479ce432de4c03bce3b8b33dd67fe3f6c
Last changed according to the source: 2025-09-16T22:02:00