Publications

Order by: publication date number of citations

QArray: A GPU-accelerated constant capacitance model simulator for large quantum dot arrays

Barnaby van Straaten, Joseph Hickie, Lucas Schorling, Jonas Schuff, Federico Fedele, Natalia Ares

SciPost Phys. Codebases 35 (2024) · published 21 October 2024 | · pdf

Semiconductor quantum dot arrays are a leading architecture for the development of quantum technologies. Over the years, the constant capacitance model has served as a fundamental framework for simulating, understanding, and navigating the charge stability diagrams of small quantum dot arrays. However, while the size of the arrays keeps growing, solving the constant capacitance model becomes computationally prohibitive. This paper presents an open-source software package able to compute a $100 × 100$ pixels charge stability diagram of a 16-dot array in less than a second. Smaller arrays can be simulated in milliseconds - faster than they could be measured experimentally, enabling the creation of diverse datasets for training machine learning models and the creation of digital twins that can interface with quantum dot devices in real-time. Our software package implements its core functionalities in the systems programming language Rust and the high-performance numerical computing library JAX. The Rust implementation benefits from advanced optimisations and parallelisation, enabling the users to take full advantage of multi-core processors. The JAX implementation allows for GPU acceleration.

1 citation
Codebase release 1.3 for QArray

Barnaby van Straaten, Joseph Hickie, Lucas Schorling, Jonas Schuff, Federico Fedele, Natalia Ares

SciPost Phys. Codebases 35-r1.3 (2024) · published 21 October 2024 | · src

Semiconductor quantum dot arrays are a leading architecture for the development of quantum technologies. Over the years, the constant capacitance model has served as a fundamental framework for simulating, understanding, and navigating the charge stability diagrams of small quantum dot arrays. However, while the size of the arrays keeps growing, solving the constant capacitance model becomes computationally prohibitive. This paper presents an open-source software package able to compute a $100 × 100$ pixels charge stability diagram of a 16-dot array in less than a second. Smaller arrays can be simulated in milliseconds - faster than they could be measured experimentally, enabling the creation of diverse datasets for training machine learning models and the creation of digital twins that can interface with quantum dot devices in real-time. Our software package implements its core functionalities in the systems programming language Rust and the high-performance numerical computing library JAX. The Rust implementation benefits from advanced optimisations and parallelisation, enabling the users to take full advantage of multi-core processors. The JAX implementation allows for GPU acceleration.

1 citation
Codebase release 1.0 for GRIFFIN

Lisong Chen, Ayres Freitas

SciPost Phys. Codebases 18-r1.0 (2023) · published 10 October 2023 | · src

This paper describes a modular framework for the description of electroweak scattering and decay processes, including but not limited to Z-resonance physics. The framework consistently combines a complex-pole expansion near an s-channel resonance with a regular fixed-order perturbative description away from the resonance in a manifestly gauge-invariant scheme. Leading vertex correction contributions are encapsulated in form factors that can be predicted or treated as numerical fit parameters. This framework has been implemented in the publicly available object-oriented C++ library GRIFFIN. Version 1.0 of this library provides Standard Model predictions for the IR-subtracted matrix elements for the process $f\bar{f} \to f'\bar{f}'$ with full NNLO and leading higher-order contributions on the Z-resonance, and with NLO corrections off-resonance. The library can straightforwardly be extended to include higher-order corrections, should they become available, or predictions for new physics models. It can be interfaced with Monte-Carlo programs to account for QED and QCD initial-state and final-state radiation.

1 citation
Codebase release 4.0 for QSpace

Andreas Weichselbaum

SciPost Phys. Codebases 40-r4.0 (2024) · published 14 November 2024 | · src

This is the documentation for the tensor library QSpace (v4.0) that provides a toolbox to exploit 'quantum symmetry spaces' in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the Abelian symmetries $\mathbb{Z}_n$ and $U(1)$, as well as all non-Abelian symmetries represented by the simple classical Lie algebras: $A_n$, $B_n$, $C_n$, and $D_n$, or respectively, the special unitary group SU($n$), the odd orthogonal group SO($2n+1$), the symplectic group Sp($2n$), and the even orthogonal group SO($2n$). The code (C++ embedded via the MEX interface into Matlab) is available (https://bitbucket.org/qspace4u) under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-Abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly computing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in its operations across all symmetries. At the level of an application, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-Abelian symmetries.

1 citation
Codebase release 1.1 for TASEPy

Luca Ciandrini, Richmond L. Crisostomo, Juraj Szavits-Nossan

SciPost Phys. Codebases 22-r1.1 (2023) · published 13 December 2023 | · src

The totally asymmetric simple exclusion process (TASEP) is a paradigmatic lattice model for one-dimensional particle transport subject to excluded-volume interactions. Solving the inhomogeneous TASEP in which particles' hopping rate vary across the lattice is a long-standing problem. In recent years, a power series approximation (PSA) has been developed to tackle this problem, however no computer algorithm currently exists that implements this approximation. This paper addresses this issue by providing a Python-based package TASEPy that finds the steady state solution of the inhomogeneous TASEP for any set of hopping rates using the PSA truncated at a user-defined order.

1 citation
Making digital objects FAIR in high energy physics: An implementation for Universal FeynRules Output (UFO) models

Mark S. Neubauer, Avik Roy, Zijun Wang

SciPost Phys. Codebases 13 (2023) · published 9 June 2023 | · pdf

Research in the data-intensive discipline of high energy physics (HEP) often relies on domain-specific digital contents. Reproducibility of research relies on proper preservation of these digital objects. This paper reflects on the interpretation of principles of Findability, Accessibility, Interoperability, and Reusability (FAIR) in such context and demonstrates its implementation by describing the development of an end-to-end support infrastructure for preserving and accessing Universal FeynRules Output (UFO) models guided by the FAIR principles. UFO models are custom-made python libraries used by the HEP community for Monte Carlo simulation of collider physics events. Our framework provides simple but robust tools to preserve and access the UFO models and corresponding metadata in accordance with the FAIR principles.

1 citation
Tensor network Python (TeNPy) version 1

Johannes Hauschild, Jakob Unfried, Sajant Anand, Bartholomew Andrews, Marcus Bintz, Umberto Borla, Stefan Divic, Markus Drescher, Jan Geiger, Martin Hefel, Kévin Hémery, Wilhelm Kadow, Jack Kemp, Nico Kirchner, Vincent S. Liu, Gunnar Möller, Daniel Parker, Michael Rader, Anton Romen, Samuel Scalet, Leon Schoonderwoerd, Maximilian Schulz, Tomohiro Soejima, Philipp Thoma, Yantao Wu, Philip Zechmann, Ludwig Zweng, Roger S. K. Mong, Michael P. Zaletel, Frank Pollmann

SciPost Phys. Codebases 41 (2024) · published 26 November 2024 | · pdf

TeNPy (short for 'Tensor Network Python') is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package.

1 citation
Codebase release 2.0 for sauce

Caleb Marshall

SciPost Phys. Codebases 37-r2.0 (2024) · published 6 November 2024 | · src

Low energy nuclear physics experiments are transitioning towards fully digital data acquisition systems. Realizing the gains in flexibility afforded by these systems relies on equally flexible data reduction techniques. In this paper, methods utilizing data frames and in-memory techniques to work with data, including data from self-triggering, digital data acquisition systems, are discussed within the context of a Python package, sauce. It is shown that data frame operations can encompass common analysis needs and allow interactive data analysis. Two event building techniques, dubbed referenced and referenceless event building, are shown to provide a means to transform raw list mode data into correlated multi-detector events. These techniques are demonstrated in the analysis of two example data sets.

1 citation
Codebase release 0.4 for pyBumpHunter

Louis Vaslin, Samuel Calvet, Vincent Barra, Julien Donini

SciPost Phys. Codebases 15-r0.4 (2023) · published 14 July 2023 | · src

The BumpHunter algorithm is widely used in the search for new particles in High Energy Physics analysis. This algorithm offers the advantage of evaluating the local and global p-values of a localized deviation in the observed data without making any hypothesis on the supposed signal. The increasing popularity of the Python programming language motivated the development of a new public implementation of this algorithm in Python, called pyBumpHunter, together with several improvements and additional features. It is the first public implementation of the BumpHunter algorithm to be added to Scikit-HEP. This paper presents in detail the BumpHunter algorithm as well as all the features proposed in this implementation. All these features have been tested in order to demonstrate their behaviour and performance.

1 citation
Codebase release r1.0 for amcheck

Andriy Smolyanyuk, Libor Šmejkal, Igor I. Mazin

SciPost Phys. Codebases 30-r1.0 (2024) · published 12 June 2024 | · src

Altermagnets (AM) is a recently discovered class of collinear magnets that share some properties (anomalous transport, etc) with ferromagnets, some (zero net magnetization) with antiferromagnets, while also exhibiting unique properties (spin-splitting of electronic bands and resulting spin-splitter current). Since the moment compensation in AM is driven by symmetry, it must be possible to identify them by analyzing the crystal structure directly, without computing the electronic structure. Given the significant potential of AM for spintronics, it is very useful to have a tool for such an analysis. This work presents an open-access code implementing such a direct check.

1 citation

Previous 1 2 3 4 5 6 7 8 9 Next

Publications

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation