This code implements a Variational Monte Carlo algorithm where the total state is taken as a superposition of fermionic gaussian States combined with a machine learning-based gauge wavefunction. This code was used to study a magnetic versus fermionic phase transition and the confined-deconfined crossover.
Whether a temporal (Leggett–Garg) measurement can certify the computational power of an anyonic braid representation — its density in the unitary group, the property underlying universal topological quantum computation — has, to our knowledge, not been studied. We give a complete…
This record contains the complete anonymized reproducibility archive for the manuscript “Risk-averse optimization of Internet of Things sensor placement in semiconductor wastewater networks: A mass-balanced simulation and Monte Carlo framework.” The archive includes three reconst…
Standard correlation witnesses — spatial Bell/CHSH inequalities, temporal Leggett–Garg K₃, and KCBS contextuality — are known to detect nonstabilizerness ("magic") in some settings. We report a worked example, a k-resolved nonstabilizerness map of the SU(2)_k anyon braid-represen…
We report a real-space resolution of the full modular data of a doubled-Fibonacci Levin–Wen string-net, obtained by exact diagonalization on finite torus supercells (2×2, 2×3, 3×3), together with a sharply scoped negative result for the dynamical half of the same program — and we…
Ruby Sandy Moreno Mejia, Arnulfo Villanueva-Castillo, C.F. Pastelín, Claudia Mancilla-Simbro, Briseida Lucía Blanco Alfonso, ERICK FERNANDEZ MENESES, et al.
This repository contains the MATLAB scripts, input data, and model parameters for the computational simulation of an integrated multi-product biorefinery processing 2,740 t/day of mixed sugarcane bagasse and pineapple residues. The simulation encompasses four processing stages —…
We numerically test the three-time Leggett–Garg inequality K₃ ≤ 1 for the standard B₃ Fibonacci-anyon braiding representation on the two-dimensional fusion space of three τ anyons. Exhaustive enumeration over all 4^L braid words up to length L = 11 and random sampling to L = 40 s…