arXiv subjects

Ilaria Siloi

Publications and source records attributed to Ilaria Siloi.

At least 19 recordsLinked to original sources

arXiv2026

Color code thresholds under circuit-level noise beyond the Pauli framework

A quantum error correction code is assessed over its ability to correct errors in noisy quantum circuits. This task requires extensive simulations of faulty quantum circuits, which are often made tractable by considering stochastic Pauli noise models, as they are compatible with efficient classical simulation techniques. However, such noise models do not fully capture the variety of physical error mechanisms encountered in realistic quantum platforms. In this work, we extend circuit-level noise modeling beyond the Pauli framework by estimating the threshold of the hexagonal color code under more general noise models. Specifically, we consider two representative non-Pauli error channels: a systematic $X$-rotation model that introduces coherent over-rotations, and an amplitude damping channel that captures relaxation processes. These models are incorporated at the circuit level into color code circuits using a Tree Tensor Network ansatz. Our simulations demonstrate that tensor network simulations enable accurate threshold estimation under non-Pauli noise for color codes up to distance $d=7$ (73 qubits). Comparing our results with the Pauli twirling approximations of the noise models, we find that coherent over-rotations yield systematically higher error rates, deviating from the Pauli twirling approximation as the code distance increases.

quant-ph↗

arXiv2026

Phase transitions in quantum-circuit compilation

Quantum-circuit compilation aims at finding an optimized realization of a target circuit under given constraints, e.g., the minimization of hardware-induced errors and the unitary-equivalence of the circuit. We connect the compilation process with the thermodynamics of a many-body spin system: circuit infidelity plays the role of the energy function and low-temperature states correspond to compiled circuits. In the paradigmatic case where crosstalk between parallel gates is present, we find a phase transition between a disordered phase and an antiferromagnetic brick-wall phase, compatible with the Ising universality class. At larger crosstalk, we observe a $\mathbb{Z}_3$-ordered regime, suggesting that increasingly serial compiled circuits are associated with emergent $\mathbb{Z}_n$-ordered phases. When the unitary-equivalence constraint is removed, these phases disappear, showing that the equivalence between circuits underlies the emergent criticality and constitutes a source of complexity in quantum-circuit compilation and, more generally, in equivalence-constrained optimization. Finally, we observe that the Kolmogorov complexity of the circuit enhances the emergence of ordered phases.

quant-ph↗

arXiv2026

Observable Estimation in the Absence of Classical Verification

The predictive success of quantum mechanics underpins many areas of modern science, even as the exact simulation of large, interacting quantum systems remains beyond the reach of classical computation. This success has been enabled by the remarkable advancement of scalable numerical approximation methods, which often demonstrate practical accuracy despite the absence of formal guarantees. As quantum simulation pushes into regimes where these approximations struggle, a fundamental challenge arises: How can quantum outcomes be trusted when reliable classical benchmarks are unavailable? Here, we establish a framework for the independent validation of quantum estimates in this setting and present evidence that they provide the most credible result among several considered methods, in the absence of an immediately accessible ground-truth solution. We apply our framework to the semi-scrambling dynamics of a physical model that strains several leading classical simulation methods yet remains experimentally accessible, in part through our introduction of the \textit{operator Loschmidt echo}. We systematically design a series of experiments using quantum heuristics that, taken together, test the underlying assumptions and provide strong confidence in the observable estimates obtained from the quantum computer. We then show how this framework can be extended to place accuracy bounds on quantum estimates via careful characterization and manipulation of the device noise, transforming the problem of validating the observable estimation to validating the noise model. These results establish a route towards trusted quantum computation for scientific discovery, independent of classical verification.

quant-ph↗

arXiv2026

Quantum algorithms for equational reasoning

As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential remains limited by the exponential growth of equivalent expressions with increasing problem size. We introduce quantum normal form reduction, a quantum computational framework designed to address this challenge. We construct an efficiently implementable quantum Hamiltonian whose ground state encodes all equivalent expressions in a quantum superposition. By preparing and manipulating these states, we tackle fundamental problems in equational reasoning, including verifying and counting equivalent expressions and identifying structural properties of equivalence classes. We demonstrate a quantum-inspired version of the algorithm, using tensor networks to solve instances involving up to 10^28 equivalent expressions, far beyond the reach of classical graph exploration. This framework opens the path for quantum symbolic computation in areas from circuit design to data compression, computational group theory, linguistics, and macromolecular modeling, unlocking previously inaccessible problems.

quant-ph↗

arXiv2026

Quantum algorithms for compact polymer thermodynamics

Efficient sampling from ensembles of Hamiltonian cycles is critical for predicting the thermodynamic properties of compact polymers, with applications including modeling protein and RNA folding and designing soft materials. Although classical Monte Carlo methods are widely regarded as the standard approach, their efficiency is strongly limited when applied to compact polymers. In this work, we enable a quadratic speedup in the estimation of thermodynamic properties of maximally compact polymers and heteropolymers by quantum computation. To this end, we encode the target thermodynamic ensemble into the amplitudes of a quantum state, i.e., a quantum sample, which can be processed via amplitude amplification. Using quantum equational reasoning, we construct a local parent Hamiltonian whose unique ground state realizes a quantum sample of all Hamiltonian cycles. This state can be prepared on quantum hardware using ground-state preparation methods, such as quantum annealing, and subsequently manipulated to generate quantum samples of polymers and heteropolymers at a target temperature. Finally, we approximate the quantum sample as a tensor network, revealing an entanglement area law. For fixed-width rectangular lattices, we obtain a time-efficient and compact encoding of the full ensemble of Hamiltonian cycles, enabling the efficient evaluation of expectation values, partition functions, and configuration probabilities via tensor contractions, without resorting to sampling.

quant-ph↗

arXiv2026

Integer Factorization via Tensor Network Schnorr's Sieving

Classical public-key cryptography standards rely on the Rivest-Shamir-Adleman (RSA) encryption protocol. The security of this protocol is based on the exponential computational complexity of the most efficient classical algorithms for factoring large semiprime numbers into their two prime components. Here, we address RSA factorization building on Schnorr's mathematical framework where factorization translates into a combinatorial optimization problem. We solve the optimization task via tensor network methods, a quantum-inspired classical numerical technique. This tensor network Schnorr's sieving algorithm displays numerical evidence of polynomial scaling of resources with the bit-length of the semiprime. We factorize RSA numbers up to 100 bits and assess how computational resources scale through numerical simulations up to 130 bits, encoding the optimization problem in quantum systems with up to 256 qubits. Only the high-order polynomial scaling of the required resources limits the factorization of larger numbers. Although these results do not currently undermine the security of the present communication infrastructure, they strongly highlight the urgency of implementing post-quantum cryptography or quantum key distribution.

cs.CR↗

arXiv2025

Quantum circuit compilation with quantum computers

Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers, paving the way for a quantum advantage in compilation. We demonstrate the effectiveness of this approach via Quantum and Simulated Annealing-based compilation: we successfully compile a Trotterized Hamiltonian simulation with up to 64 qubits and 64 time-steps and a Quantum Fourier Transform with up to 40 qubits and 771 time steps. We show that, for a translationally invariant circuit, the compilation results in a fidelity gain that grows extensively in the size of the input circuit, outperforming any local or quasi-local compilation approach.

quant-ph↗

arXiv2024

Digital quantum simulation of lattice fermion theories with local encoding

We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and two-qubit gates and is scalable since integrating each Hamiltonian term requires a finite (non-scaling) cost. The exact local fermion encoding we adopt relies on auxiliary $\mathbb{Z}_2$ lattice gauge fields by adding a pure gauge Hamiltonian term akin to the Toric Code. By numerically emulating the quantum simulator real-time dynamics, we observe a timescale separation for spin- and charge-excitations in a spin-$\frac{1}{2}$ Hubbard ladder in the $t-J$ model limit.

quant-ph↗

arXiv2021

Relaxation time approximations in PAOFLOW 2.0

Regardless of its success, the constant relaxation time approximation has limited validity. Temperature and energy dependent effects are important to match experimental trends even in simple situations. We present the implementation of relaxation time approximation models in the calculation of Boltzmann transport in PAOFLOW 2.0 and apply those to model band-structures. In addition, using a self-consistent fitting of the model parameters to experimental conductivity data, we provide a flexible tool to extract scattering rates with high accuracy. We illustrate the approximations using simple models and then apply the method to GaAs, Si, Mg3Sb2, and CoSb3.

cond-mat.mtrl-sci↗

arXiv2021

Advanced modeling of materials with PAOFLOW 2.0: New features and software design

Recent research in materials science opens exciting perspectives to design novel quantum materials and devices, but it calls for quantitative predictions of properties which are not accessible in standard first principles packages. PAOFLOW is a software tool that constructs tight-binding Hamiltonians from self-consistent electronic wavefunctions by projecting onto a set of atomic orbitals. The electronic structure provides numerous materials properties that otherwise would have to be calculated via phenomenological models. In this paper, we describe recent re-design of the code as well as the new features and improvements in performance. In particular, we have implemented symmetry operations for unfolding equivalent k-points, which drastically reduces the runtime requirements of first principles calculations, and we have provided internal routines of projections onto atomic orbitals enabling generation of real space atomic orbitals. Moreover, we have included models for non-constant relaxation time in electronic transport calculations, doubling the real space dimensions of the Hamiltonian as well as the construction of Hamiltonians directly from analytical models. Importantly, PAOFLOW has been now converted into a Python package, and is streamlined for use directly within other Python codes. The new object oriented design treats PAOFLOWs computational routines as class methods, providing an API for explicit control of each calculation.

cond-mat.mtrl-sci↗

arXiv2020

Vacancies in graphene: an application of adiabatic quantum optimization

Quantum annealers have grown in complexity to the point that quantum computations involving few thousands of qubits are now possible. In this paper, \textcolor{black}{with the intentions to show the feasibility of quantum annealing to tackle problems of physical relevance, we used a simple model, compatible with the capability of current quantum annealers, to study} the relative stability of graphene vacancy defects. By mapping the crucial interactions that dominate carbon-vacancy interchange onto a quadratic unconstrained binary optimization problem, our approach exploits \textcolor{black}{the ground state as well the excited states found by} the quantum annealer to extract all the possible arrangements of multiple defects on the graphene sheet together with their relative formation energies. This approach reproduces known results and provides a stepping stone towards applications of quantum annealing to problems of physical-chemical interest.

cond-mat.mtrl-sci↗

arXiv2020

Investigating the Chinese Postman Problem on a Quantum Annealer

The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and using a D-Wave device. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution.

quant-ph↗

arXiv2019

Lattice quantum magnetometry

We put forward the idea of lattice quantum magnetometry, i.e. quantum sensing of magnetic fields by a charged (spinless) particle placed on a finite two-dimensional lattice. In particular, we focus on the detection of a locally static transverse magnetic field, either homogeneous or inhomogeneous, by performing ground state measurements. The system turns out to be of interest as quantum magnetometer, since it provides a non-negligible quantum Fisher information (QFI) in a large range of configurations. Moreover, the QFI shows some relevant peaks, determined by the spectral properties of the Hamiltonian, suggesting that certain values of the magnetic fields may be estimated better than the others, depending on the value of other tunable parameters. We also assess the performance of coarse-grained position measurement, showing that it may be employed to realize nearly optimal estimation strategies.

quant-ph↗

arXiv2018

Back and forth from Fock space to Hilbert space: a guide for commuters

Quantum states of systems made of many identical particles, e.g. those described by Fermi-Hubbard and Bose-Hubbard models, are conveniently depicted in the Fock space. However, in order to evaluate some specific observables or to study the system dynamics, it is often more effective to employ the Hilbert space description. Moving effectively from one description to the other is thus a desirable feature, especially when a numerical approach is needed. Here we recall the construction of the Fock space for systems of indistinguishable particles, and then present a set of recipes and advices for those students and researchers in the need to commute back and forth from one description to the other. The two-particle case is discussed in some details and few guidelines for numerical implementations are given.

quant-ph↗

arXiv2017

The AFLOW Fleet for Materials Discovery

The traditional paradigm for materials discovery has been recently expanded to incorporate substantial data driven research. With the intent to accelerate the development and the deployment of new technologies, the AFLOW Fleet for computational materials design automates high-throughput first principles calculations, and provides tools for data verification and dissemination for a broad community of users. AFLOW incorporates different computational modules to robustly determine thermodynamic stability, electronic band structures, vibrational dispersions, thermo-mechanical properties and more. The AFLOW data repository is publicly accessible online at aflow.org, with more than 1.7 million materials entries and a panoply of queryable computed properties. Tools to programmatically search and process the data, as well as to perform online machine learning predictions, are also available.

cond-mat.mtrl-sci↗

arXiv2017

Quantum metrology at level anti-crossing

We address parameter estimation in two-level systems exhibiting level anti-crossing and prove that universally optimal strategies for parameter estimation may be designed, that is, we may find a parameter independent measurement scheme leading to the ultimate quantum precision independently on the nature and the value of the parameter of interest. Optimal estimation may be achievable also at high temperature depending on the structure of the two-level Hamiltonian. Finally, we show that no improvement is achievable by dynamical strategies and discuss examples of applications.

quant-ph↗

arXiv2017

Noisy quantum walks of two indistinguishable interacting particles

We investigate the dynamics of continuous-time two-particle quantum walks on a one-dimensional noisy lattice. Depending on the initial condition, we show how the interplay between particle indistinguishability and interaction determines distinct propagation regimes. A realistic model for the environment is considered by introducing non-Gaussian noise as time-dependent fluctuations of the tunneling amplitudes between adjacent sites. We observe that the combined effect of particle interaction and fast noise (weak coupling with the environment) provides a faster propagation compared to the noiseless case. This effect can be understood in terms of the band structure of the Hubbard model, and a detailed analysis as a function of both noise and system parameters is presented.

quant-ph↗

arXiv2016

GPU-accelerated algorithms for many-particle continuous-time quantum walks

Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantum technology, including quantum search algorithms and universal quantum computation. In order to design and implement CTQWs in a realistic scenario, one needs effective simulation tools for Hamiltonians that take into account static noise and fluctuations in the lattice, i.e. Hamiltonians containing stochastic terms. To this aim, we suggest a parallel algorithm based on the Taylor series expansion of the evolution operator, and compare its performances with those of algorithms based on the exact diagonalization of the Hamiltonian or a 4-th order Runge-Kutta integration. We prove that both Taylor-series expansion and Runge-Kutta algorithms are reliable and have a low computational cost, the Taylor-series expansion showing the additional advantage of a memory allocation not depending on the precision of calculation. Both algorithms are also highly parallelizable within the SIMT paradigm, and are thus suitable for GPGPU computing. In turn, we have benchmarked 4 NVIDIA GPUs and 3 quad-core Intel CPUs for a 2-particle system over lattices of increasing dimension, showing that the speedup providend by GPU computing, with respect to the OPENMP parallelization, lies in the range between 8x and (more than) 20x, depending on the frequency of post-processing. GPU-accelerated codes thus allow one to overcome concerns about the execution time, and make it possible simulations with many interacting particles on large lattices, with the only limit of the memory available on the device.

quant-ph↗