aqora

Quantum Technologies and AI

Matthias Klusch, Jörg Lässig, Frank K. Wilhelm

Künstliche Intell.Sep 13, 20241 citation

Nuclear binding near a quantum phase transition

Dean Lee

Serdar Elhatisari, Ning Li, Alexander Rokash, Jose Manuel Alarcon, Dechuan Du, Nico Klein, Bing-nan Lu, Ulf-G. Meisner, 2, 4 Evgeny Epelbaum, Hermann Krebs, Timo A. Lahde, Dean Lee, and Gautam Rupak Helmholtz-Institut fur Strahlenund Kernphysik and Bethe Center for Theoretical Physics, Universitat Bonn, D-53115 Bonn, Germany Institute for Advanced Simulation, Institut fur Kernphysik, and Julich Center for Hadron Physics, Forschungszentrum Julich, D-52425 Julich, Germany Institut fur Theoretische Physik II, Ruhr-Universitat Bochum, D-44870 Bochum, Germany JARA High Performance Computing, Forschungszentrum Julich, D-52425 Julich, Germany Department of Physics, North Carolina State University, Raleigh, NC 27695, USA Department of Physics and Astronomy and HPC Center for Computational Sciences, Mississippi State University, Mississippi State, MS 39762, USASerdar Elhatisari, Ning Li, Alexander Rokash, Jose Manuel Alarcon, Dechuan Du, Nico Klein, Bing-nan Lu, Ulf-G. Meisner, 2, 4 Evgeny Epelbaum, Hermann Krebs, Timo A. Lahde, Dean Lee, and Gautam Rupak Helmholtz-Institut fur Strahlenund Kernphysik and Bethe Center for Theoretical Physics, Universitat Bonn, D-53115 Bonn, Germany Institute for Advanced Simulation, Institut fur Kernphysik, and Julich Center for Hadron Physics, Forschungszentrum Julich, D-52425 Julich, Germany Institut fur Theoretische Physik II, Ruhr-Universitat Bochum, D-44870 Bochum, Germany JARA High Performance Computing, Forschungszentrum Julich, D-52425 Julich, Germany Department of Physics, North Carolina State University, Raleigh, NC 27695, USA Department of Physics and Astronomy and HPC Center for Computational Sciences, Mississippi State University, Mississippi State, MS 39762, USA

Bulletin of the American Physical SocietyApr 16, 20160 citations

Simulating the time evolution of large, sparse quantum states

Tanul Gupta

Master's thesis, Institute for Theoretical Physics, University of Cologne (submitted 10 February 2021). Supervisors: Prof. Dr. Tommaso Calarco and Dr. Robert Zeier. This thesis implements in Julia an algorithm, motivated by work of R. Zeier, for simulating the time evolution of large, sparse mixed quantum states in the product-operator basis. Instead of constructing the exponentially large unitary, the evolution is expanded in nested Lie commutators, which reduces the problem to sparse-state storage and fast commutator evaluation. For storage, the thesis introduces ClassicalMemory, a cache-aware associative array based on Judy arrays that supports essentially unbounded integer keys. It is benchmarked against SortedDict for up to 10^7 entries and key widths up to 640 bits. For commutators, the structure of the commutator and anticommutator tables is encoded in bitwise logic, following ideas and a prototype by R. Zeier, making commutator evaluation roughly 10^3–10^4 times faster than a table-based iterative approach. Example simulations include a 250-qubit Heisenberg chain, a 512-qubit XY chain, and a 5×5 XY lattice.Master's thesis, Institute for Theoretical Physics, University of Cologne (submitted 10 February 2021). Supervisors: Prof. Dr. Tommaso Calarco and Dr. Robert Zeier. This thesis implements in Julia an algorithm, motivated by work of R. Zeier, for simulating the time evolution of large, sparse mixed quantum states in the product-operator basis. Instead of constructing the exponentially large unitary, the evolution is expanded in nested Lie commutators, which reduces the problem to sparse-state storage and fast commutator evaluation. For storage, the thesis introduces ClassicalMemory, a cache-aware associative array based on Judy arrays that supports essentially unbounded integer keys. It is benchmarked against SortedDict for up to 10^7 entries and key widths up to 640 bits. For commutators, the structure of the commutator and anticommutator tables is encoded in bitwise logic, following ideas and a prototype by R. Zeier, making commutator evaluation roughly 10^3–10^4 times faster than a table-based iterative approach. Example simulations include a 250-qubit Heisenberg chain, a 512-qubit XY chain, and a 5×5 XY lattice.

Feb 10, 20210 citations

Quantum AI: Achievements and Challenges in the Interplay of Quantum Computing and Artificial Intelligence

Iñaki Fernández Pérez, Fernando De la Prieta, Sara Rodrı́guez +2 more

Lecture notes in networks and systemsJan 1, 202313 citations

Quantum Computing Research Lines in the Italian Center for Supercomputing

Alessandro Barenghi, Paolo Cremonesi, Gerardo Pelosi

Lecture notes in computer scienceJan 1, 20230 citations

Photonics Research Interview with Professor Marlan Scully

Lan Yang

Professor Marlan Scully discusses his career in quantum optics with the Editor-in-Chief of Photonics Research, Prof. Lan Yang.

Photonics ResearchNov 24, 20210 citations