arXiv subjects

Ariana Torres-Knoop

Publications and source records attributed to Ariana Torres-Knoop.

8 recordsLinked to original sources

arXiv2026

Allocating Access to Quantum Computing: A Legal-Ethical Framework

Along with the increased availability and capabilities of quantum computers comes the core question: how can access to quantum computing be allocated in a responsible way? This report introduces a general legal-ethical framework that providers of access to quantum computing can apply to develop robust access policies tailored to their specific context. We demonstrate the applicability of this general legal-ethical framework in the specific context of a small, 16-qubit quantum computer that will be hosted by SURF (the Dutch IT cooperative for research and education), integrated with Snellius (the Dutch national supercomputer), and operated jointly as part of the EuroSSQ-HPC consortium, procured in partnership with the EU-wide EuroHPC Joint Undertaking.

physics.soc-ph↗

arXiv2026

Rethinking Reproducibility in the Classical (HPC)-Quantum Era: Toward Workflow-Centered Science

Scientific knowledge increasingly depends on complex computational processes where both hardware and software layers can influence research outcomes. As computational complexity grows, classical-quantum integration provides a lens for examining how the scientific method adapts, particularly regarding a foundational principle of scientific validation - reproducibility. Building upon previous warnings of an ongoing reproducibility crisis in the computational context, this paper examines challenges across classical (HPC) and quantum computing. Despite its deterministic nature, HPC faces reproducibility threats from hardware dependencies, documentation inadequacies, disincentivizing research culture and infrastructure variation. Quantum computing, at low technological maturity, amplifies some challenges, while creating new ones through probabilistic outputs, hardware-specific noise, and tight software-hardware coupling. Classical-quantum integration reveals a telling pattern, where current reproducibility frameworks prove inadequate, as infrastructure blends with the results. Quantum integration serves as a catalyst exposing methodological limitations across the computational domain. We propose a workflow-centered path forward, pointing to the value of gradual cultural shift toward workflow-centered scientific practice. By developing meta-workflows that document both process abstractions and implementation contexts, we create a more robust foundation for scientific knowledge that acknowledges complexity without sacrificing rigor. The path forward involves embracing this evolution in understanding scientific knowledge rather than resisting it

cs.ET↗

arXiv2024

Towards a Dutch hybrid quantum/HPC infrastructure

Quantum Inspire has taken important steps to enable quantum applications by developing a setting that allows the execution of hybrid algorithms. Currently, the setting uses a classical server (HPC node) co-located with the quantum computer for the high frequency coupling needed by hybrid algorithms. A fast task manager (dispatcher) has been developed to orchestrate the interaction between the server and the quantum computer. Although successful, the setting imposes a specific hybrid job-structure. This is most likely always going to be the case and we are currently discussing how to make sure this does not hamper the uptake of the setting. Furthermore, first steps have been taken towards the integration with the Dutch National High-Performance Computing (HPC) Center, hosted by SURF. As a first approach we have setup a setting consisting of two SLURM clusters, one in the HPC (C1) and the second (C2) co-located with Quantum Inspire API. Jobs are submitted from C1 to C2. Quantum Inspire can then schedule with C2 the jobs to the quantum computer. With this setting, we enable control from both SURF and Quantum Inspire on the jobs being executed. By using C1 for the jobs submission we remove the accounting burden from Quantum Inspire. By having C2 co-located with Quantum Inspire API, we make the setting more resilient towards network failures. This setting can be extended for other HPC centers to submit jobs to Quantum Inspire backends.

quant-ph↗

arXiv2023

Requirements for a processing-node quantum repeater on a real-world fiber grid

We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verifiable blind quantum computation using color centers and trapped ions. Our results are obtained considering restrictions imposed by a real-world fiber grid and using detailed hardware-specific models. By comparing our results to those we would obtain in idealized settings we show that simplifications lead to a distorted picture of hardware demands, particularly on memory coherence and photon collection. We develop general machinery suitable for studying arbitrary processing-node repeater chains using NetSquid, a discrete-event simulator for quantum networks. This enables us to include time-dependent noise models and simulate repeater protocols with cut-offs, including the required classical control communication. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performance-computing cluster. Our work provides guidance for further experimental progress, and showcases limitations of studying quantum-repeater requirements in idealized situations.

quant-ph↗

arXiv2021

NetSquid, a NETwork Simulator for QUantum Information using Discrete events

In order to bring quantum networks into the real world, we would like to determine the requirements of quantum network protocols including the underlying quantum hardware. Because detailed architecture proposals are generally too complex for mathematical analysis, it is natural to employ numerical simulation. Here we introduce NetSquid, the NETwork Simulator for QUantum Information using Discrete events, a discrete-event based platform for simulating all aspects of quantum networks and modular quantum computing systems, ranging from the physical layer and its control plane up to the application level. We study several use cases to showcase NetSquid's power, including detailed physical layer simulations of repeater chains based on nitrogen vacancy centres in diamond as well as atomic ensembles. We also study the control plane of a quantum switch beyond its analytically known regime, and showcase NetSquid's ability to investigate large networks by simulating entanglement distribution over a chain of up to one thousand nodes.

quant-ph↗

arXiv2021

Learning heterogenous reaction rates from stochastic simulations

Reaction rate equations are ordinary differential equations that are frequently used to describe deterministic chemical kinetics at the macroscopic scale. At the microscopic scale, the chemical kinetics is stochastic and can be captured by complex dynamical systems reproducing spatial movements of molecules and their collisions. Such molecular dynamics systems may implicitly capture intricate phenomena that affect reaction rates but are not accounted for in the macroscopic models. In this work we present a data assimilation procedure for learning non-homogenous kinetic parameters from molecular simulations with many simultaneously reacting species. The learned parameters can then be plugged into the deterministic reaction rate equations to predict long time evolution of the macroscopic system. In this way, our procedure discovers an effective differential equation for reaction kinetics. To demonstrate the procedure, we upscale the kinetics of a molecular system that forms a complex covalently bonded network severely interfering with the reaction rates. Incidentally, we report that the kinetic parameters of this system feature a peculiar time and temperature dependences, whereas the probability of a network strand to close a cycle follows a universal distribution.

cond-mat.soft↗

arXiv2021

Effect of different monomer precursors with identical functionality on the properties of the polymer network

Thermo-mechanical properties of polymer networks depend on functionality of the monomer precursors -- an association that is frequently exploited in materials science. We use molecular simulations to generate spatial networks from chemically different monomers with identical functionality and show that such networks have several universal graph-theoretical properties as well as near universal Young's modulus. The vitrification temperature is shown to be universal only up to a certain density of the network, as measured by the bond conversion. The latter observation is explained by the fact that monomer's tendency to coil enhances formation of topological holes, which, when accumulated in the network, amount to a percolating cell complex restricting network's mobility. This higher-order percolation occurs late after gelation and is shown to coincide with the onset of brittleness, as indicated by a sudden increase in the glass transition temperature. This phenomenon may signify a new type of phase transition in polymer materials.

cond-mat.soft↗

arXiv2020

Optimizing Entanglement Generation and Distribution Using Genetic Algorithms

Long-distance quantum communication via entanglement distribution is of great importance for the quantum internet. However, scaling up to such long distances has proved challenging due to the loss of photons, which grows exponentially with the distance covered. Quantum repeaters could in theory be used to extend the distances over which entanglement can be distributed, but in practice hardware quality is still lacking. Furthermore, it is generally not clear how an improvement in a certain repeater parameter, such as memory quality or attempt rate, impacts the overall network performance, rendering the path towards scalable quantum repeaters unclear. In this work we propose a methodology based on genetic algorithms and simulations of quantum repeater chains for optimization of entanglement generation and distribution. By applying it to simulations of several different repeater chains, including real-world fiber topology, we demonstrate that it can be used to answer questions such as what are the minimum viable quantum repeaters satisfying given network performance benchmarks. This methodology constitutes an invaluable tool for the development of a blueprint for a pan-European quantum internet. We have made our code, in the form of NetSquid simulations and the smart-stopos optimization tool, freely available for use either locally or on high-performance computing centers.

quant-ph↗